Efficient symbolic search for cost-optimal planning

DOI10.1016/j.artint.2016.10.001zbMath1392.68391OpenAlexW2530510313MaRDI QIDQ343909

Peter Kissmann, Vidal Alcázar, Álvaro Torralba, Stefan Edelkamp

Publication date: 29 November 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.10.001

zbMATH Keywords

cost-optimal planningimage computationstate invariantssymbolic search

Mathematics Subject Classification ID

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

Related Items

Symbolic perimeter abstraction heuristics for cost-optimal planning

Uses Software

• CUDD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
• The computational complexity of avoiding spurious states in state space abstraction
• Concise finite-domain representations for PDDL planning tasks
• State-set branching: leveraging BDDs for heuristic search
• A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
• BDD Ordering Heuristics for Classical Planning
• Merge-and-Shrink Abstraction
• Solving Simple Planning Problems with More Inference and No Search
• Graph-Based Algorithms for Boolean Function Manipulation
• Interpolants and Symbolic Model Checking
• Finding the Shortest Route between Two Points in a Network
• Planning as heuristic search