Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms

DOI10.1007/978-3-642-17452-0_18MaRDI QIDQ3020421zbMATH OpenOpenAlexFDO

Authors Dmitry S. Yershov, Steven M. LaValle

Publication date 4 August 2011

Published in Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17452-0_18

Mathematics Subject Classification ID

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

Recommendations

• Algorithms and conditional lower bounds for planning problems
• scientific article; zbMATH DE number 1560491
• A complete parameterized complexity analysis of bounded planning
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Planning as satisfiability: parallel plans and algorithms for plan search
• Complexity, decidability and undecidability results for domain-independent planning
• scientific article; zbMATH DE number 6519681
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

Cited in

(1)

• Equivalent environments and covering spaces for robots

This page was built for publication: Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms

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