Width and serialization of classical planning problems

MaRDI QIDQ3455576zbMATH OpenFDO

Authors Nir Lipovetzky, Hector Geffner

Publication date 11 December 2015

Full work available at URL http://ebooks.iospress.nl/volumearticle/7029

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Compiling uncertainty away in conformant planning problems with bounded width
• Time and Space Bounds for Planning
• Fast planning through planning graph analysis
• Complexity results for standard benchmark domains in planning
• The fast downward planning system

Cited in

(11)

• Selecting goals in oversubscription planning using relaxed plans
• Formalizing Goal Serializability for Evaluation of Planning Features
• Belief tracking for planning with sensing: width, complexity and approximations
• Planning as satisfiability: heuristics
• Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
• A Comprehensive Framework for Learning Declarative Action Models
• Inner entanglements: narrowing the search in classical planning by problem reformulation
• Logics in Artificial Intelligence
• Width-based search for multi agent privacy-preserving planning
• Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
• Learning from planner performance

This page was built for publication: Width and serialization of classical planning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455576)