scientific article; zbMATH DE number 2086969
From MaRDI portal
Publication:4737581
Recommendations
- Efficient symbolic search for cost-optimal planning
- State-set branching: leveraging BDDs for heuristic search
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Conformant planning via symbolic model checking and heuristic search
- Data representation and efficient solution: a decision diagram approach
Cited in
(14)- Symbolic perimeter abstraction heuristics for cost-optimal planning
- State-set branching: leveraging BDDs for heuristic search
- Efficient incremental planning and learning with multi-valued decision diagrams
- BDD ordering heuristics for classical planning
- Iterative bounding \(\text{LAO}^*\)
- Influence of modeling structure in probabilistic sequential decision problems
- Efficient symbolic search for cost-optimal planning
- Survey on Directed Model Checking
- scientific article; zbMATH DE number 1979555 (Why is no real title available?)
- AI 2003: Advances in Artificial Intelligence
- LAO*: A heuristic search algorithm that finds solutions with loops
- Boosting optimal symbolic planning: operator-potential heuristics
- Symbolic search for cost-optimal planning with expressive model extensions
- Weighted A^* search - unifying view and application
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737581)