Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Branching and pruning: an optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Planning with h+in theory and practice
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Optimal admissible composition of abstraction heuristics
Artificial Intelligence
Landmarks in Hierarchical Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Strengthening Landmark Heuristics via Hitting Sets
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Sound and Complete Landmarks for And/Or Graphs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A weighted CSP approach to cost-optimal planning
AI Communications
Implicit abstraction heuristics
Journal of Artificial Intelligence Research
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
Everything you always wanted to know about planning (but were afraid to ask)
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
Landmark-enhanced abstraction heuristics
Artificial Intelligence
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
On the utility of landmarks in SAT based planning
Knowledge-Based Systems
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Towards rational deployment of multiple heuristics in A*
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
An admissible heuristic for SAS+ planning obtained from the state equation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Planning landmarks are facts that must be true at some point in every solution plan. Previous work has very successfully exploited planning landmarks in satisficing (non-optimal) planning. We propose a methodology for deriving admissible heuristic estimates for cost-optimal planning from a set of planning landmarks. The resulting heuristics fall into a novel class of multi-path dependent heuristics, and we present a simple best-first search procedure exploiting such heuristics. Our empirical evaluation shows that this framework favorably competes with the state-of-the-art of cost-optimal heuristic search.