Fast planning through planning graph analysis
Artificial Intelligence
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
An Iterative Algorithm for Synthesizing Invariants
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Searching with Pattern Databases
AI '96 Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Planning as Heuristic Search: New Results
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Automated Creation of Pattern Database Search Heuristics
Model Checking and Artificial Intelligence
Partial Symbolic Pattern Databases for Optimal Sequential Planning
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Directed Unfolding of Petri Nets
Transactions on Petri Nets and Other Models of Concurrency I
Unified Definition of Heuristics for Classical Planning
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Filtering, decomposition and search space reduction for optimal sequential planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Domain-independent construction of pattern database heuristics for cost-optimal planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Accuracy of admissible heuristic functions in selected planning domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
mGPT: a probabilistic planner based on heuristic search
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
New Islands of tractability of cost-optimal planning
Journal of Artificial Intelligence Research
A general theory of additive state space abstractions
Journal of Artificial Intelligence Research
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Set-structured and cost-sharing heuristics for classical planning
Annals of Mathematics and Artificial Intelligence
An LP-based heuristic for optimal planning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
The computational complexity of avoiding spurious states in state space abstraction
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
A weighted CSP approach to cost-optimal planning
AI Communications
Implicit abstraction heuristics
Journal of Artificial Intelligence Research
GA-FreeCell: evolving solvers for the game of FreeCell
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Controlled reachability analysis in AI planning: theory and practice
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Landmark-enhanced abstraction heuristics
Artificial Intelligence
Hi-index | 0.00 |
Admissible heuristics are critical for effective domain-independent planning when optimal solutions must be guaranteed. Two useful heuristics are the hm heuristics, which generalize the reachability heuristic underlying the planning graph, and pattern database heuristics. These heuristics, however, have serious limitations: reachability heuristics capture only the cost of critical paths in a relaxed problem, ignoring the cost of other relevant paths, while PDB heuristics, additive or not, cannot accommodate too many variables in patterns, and methods for automatically selecting patterns that produce good estimates are not known. We introduce two refinements of these heuristics: First, the additive hm heuristic which yields an admissible sum of hm heuristics using a partitioning of the set of actions. Second, the constrained PDB heuristic which uses constraints from the original problem to strengthen the lower bounds obtained from abstractions. The new heuristics depend on the way the actions or problem variables are partitioned. We advance methods for automatically deriving additive hm and PDB heuristics from STRIPS encodings. Evaluation shows improvement over existing heuristics in several domains, although, not surprisingly, no heuristic dominates all the others over all domains.