Efficient symbolic search for cost-optimal planning
From MaRDI portal
Publication:343909
DOI10.1016/J.ARTINT.2016.10.001zbMATH Open1392.68391OpenAlexW2530510313MaRDI QIDQ343909FDOQ343909
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
Recommendations
Cites Work
- A note on two problems in connexion with graphs
- Graph-Based Algorithms for Boolean Function Manipulation
- Planning as heuristic search
- The fast downward planning system
- 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
- Heuristic search. Theory and applications
- Merge-and-Shrink Abstraction
- Solving Simple Planning Problems with More Inference and No Search
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
- Title not available (Why is that?)
- Interpolants and Symbolic Model Checking
- Finding the Shortest Route between Two Points in a Network
- The computational complexity of avoiding spurious states in state space abstraction
Cited In (6)
- State-set branching: leveraging BDDs for heuristic search
- Boosting optimal symbolic planning: operator-potential heuristics
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Title not available (Why is that?)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
- Gradient-based mixed planning with symbolic and numeric action parameters
Uses Software
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)
