Time complexity of iterative-deepening-A
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Sokoban: enhancing general single-agent search methods using domain knowledge
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Maximizing over multiple pattern databases speeds up heuristic search
Artificial Intelligence
New admissible heuristics for domain-independent planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Additive pattern database heuristics
Journal of Artificial Intelligence Research
Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Limits and Possibilities of BDDs in State Space Search
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Partial Symbolic Pattern Databases for Optimal Sequential Planning
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
Accuracy of admissible heuristic functions in selected planning domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Limits and possibilities of BDDs in state space search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Explicit-state abstraction: a new method for generating heuristic functions
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A general theory of additive state space abstractions
Journal of Artificial Intelligence Research
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
Fast directed model checking via Russian Doll abstraction
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Solving non-deterministic planning problems with pattern database heuristics
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Optimal admissible composition of abstraction heuristics
Artificial Intelligence
The computational complexity of avoiding spurious states in state space abstraction
Artificial Intelligence
Implicit abstraction heuristics
Journal of Artificial Intelligence Research
The influence of k-dependence on the complexity of planning
Artificial Intelligence
Landmark-enhanced abstraction heuristics
Artificial Intelligence
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
Iterative-Deepening search with on-line tree size prediction
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Predicting the size of IDA*'s search tree
Artificial Intelligence
Bridging the gap between refinement and heuristics in abstraction
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
Getting the most out of pattern databases for classical planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing upper bounds on lengths of transition sequences
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Symbolic merge-and-shrink for cost-optimal planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Iterative-deepening search with on-line tree size prediction
Annals of Mathematics and Artificial Intelligence
A Tabled Prolog Program for Solving Sokoban
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively guide the search. Pattern database heuristics (PDBs), which are based on abstractions of the search space, are currently one of the most promising approaches to developing better admissible heuristics. The informedness of PDB heuristics depends crucially on the selection of appropriate abstractions (patterns). Although PDBs have been applied to many search problems, including planning, there are not many insights into how to select good patterns, even manually. What constitutes a good pattern depends on the problem domain, making the task even more difficult for domain-independent planning, where the process needs to be completely automatic and generaL We present a novel way of constructing good patterns automatically from the specification of planning problem instances. We demonstrate that this allows a domain-independent planner to solve planning problems optimally in some very challenging domains, including a STRIPS formulation of the Sokoban puzzle.