Efficient symbolic search for cost-optimal planning

DOI10.1016/J.ARTINT.2016.10.001MaRDI QIDQ343909zbMATH OpenOpenAlexFDO

Authors Álvaro Torralba, Vidal Alcázar, Peter Kissmann, 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)

Recommendations

• scientific article; zbMATH DE number 2086969
• Symbolic perimeter abstraction heuristics for cost-optimal planning
• State-set branching: leveraging BDDs for heuristic search
• Implicit abstraction heuristics
• A weighted CSP approach to cost-optimal planning

Cites work

• scientific article; zbMATH DE number 2086969 (Why is no real title available?)
• A note on two problems in connexion with graphs
• A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
• BDD ordering heuristics for classical planning
• Concise finite-domain representations for PDDL planning tasks
• Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
• Finding the Shortest Route between Two Points in a Network
• Graph-Based Algorithms for Boolean Function Manipulation
• Heuristic search. Theory and applications
• Interpolants and Symbolic Model Checking
• Merge-and-Shrink Abstraction
• Planning as heuristic search
• Solving Simple Planning Problems with More Inference and No Search
• State-set branching: leveraging BDDs for heuristic search
• The computational complexity of avoiding spurious states in state space abstraction
• The fast downward planning system

Cited in

(6)

• Gradient-based mixed planning with symbolic and numeric action parameters
• Boosting optimal symbolic planning: operator-potential heuristics
• scientific article; zbMATH DE number 2086969 (Why is no real title available?)
• Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
• Symbolic perimeter abstraction heuristics for cost-optimal planning
• State-set branching: leveraging BDDs for heuristic search

Describes a project that uses

Uses Software

• CUDD

This page was built for publication: Efficient symbolic search for cost-optimal planning

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