Optimal admissible composition of abstraction heuristics
From MaRDI portal
Publication:991018
DOI10.1016/J.ARTINT.2010.04.021zbMATH Open1205.68376OpenAlexW2081726708MaRDI QIDQ991018FDOQ991018
Authors: J. Martínez 
Publication date: 2 September 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.04.021
Recommendations
Cites Work
- Planning as heuristic search
- The computational complexity of propositional STRIPS planning
- The fast downward planning system
- Title not available (Why is that?)
- An interior-point approach for primal block-angular problems
- An LP-Based Heuristic for Optimal Planning
- New islands of tractability of cost-optimal planning
- A general theory of additive state space abstractions
- Model Checking Software
- Friends or foes? On planning as satisfiability and abstract CNF encodings
- Title not available (Why is that?)
- Implicit abstraction heuristics
- Automated Creation of Pattern Database Search Heuristics
Cited In (8)
- Backdoors to planning
- Deterministic oversubscription planning as heuristic search: abstractions and reformulations
- Implicit abstraction heuristics
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Title not available (Why is that?)
- Landmark-enhanced abstraction heuristics
- Saturated cost partitioning for optimal classical planning
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
Uses Software
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)
