Optimal admissible composition of abstraction heuristics
From MaRDI portal
(Redirected from Publication:991018)
Recommendations
Cites work
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 2243373 (Why is no real title available?)
- A general theory of additive state space abstractions
- An LP-Based Heuristic for Optimal Planning
- An interior-point approach for primal block-angular problems
- Automated Creation of Pattern Database Search Heuristics
- Friends or foes? On planning as satisfiability and abstract CNF encodings
- Implicit abstraction heuristics
- Model Checking Software
- New islands of tractability of cost-optimal planning
- Planning as heuristic search
- The computational complexity of propositional STRIPS planning
- The fast downward planning system
Cited in
(8)- Landmark-enhanced abstraction heuristics
- Backdoors to planning
- Deterministic oversubscription planning as heuristic search: abstractions and reformulations
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Implicit abstraction heuristics
- Saturated cost partitioning for optimal classical planning
- scientific article; zbMATH DE number 2243373 (Why is no real title available?)
This page was built for publication: Optimal admissible composition of abstraction heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991018)