Domain-independent planning: representation and plan generation
Artificial Intelligence
Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Planning for conjunctive goals
Artificial Intelligence
AI planning: systems and techniques
AI Magazine
Planning and control
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Fast planning through planning graph analysis
Artificial Intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using regression-match graphs to control search in planning
Artificial Intelligence
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Artificial Intelligence
A Computer Model of Skill Acquisition
A Computer Model of Skill Acquisition
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Perspectives on artificial intelligence planning
Eighteenth national conference on Artificial intelligence
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Utilizing Problem Structure in Planning: A Local Search Approach
Utilizing Problem Structure in Planning: A Local Search Approach
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
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
Heuristics for Planning with Action Costs Revisited
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
New admissible heuristics for domain-independent planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Accuracy of admissible heuristic functions in selected planning domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
Planning graph heuristics for belief space search
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Probabilistic planning via heuristic forward search and weighted model counting
Journal of Artificial Intelligence Research
The GRT planning system: backward heuristic construction in forward state-space planning
Journal of Artificial Intelligence Research
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Generalizing GraphPlan by formulating planning as a CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Conformant planning via heuristic forward search: A new approach
Artificial Intelligence
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Cost-sharing in Bayesian knowledge bases
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
Problem abstractions based on (either completely or partially) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of the conceptual tools exploited by these heuristics remains rather limited. We study a framework for approximating the optimal cost solutions for problems with no delete effects that bridges between certain works on heuristic-search classical planning and on probabilistic reasoning. Our analysis results in developing a novel heuristic function that combines "informed" set-structured cost estimates and "conservative" action cost sharing. Our empirical comparative evaluation provides a clear evidence for the attractiveness of this heuristic estimate. In addition, we examine a (suggested before in the context of probabilistic reasoning) admissible heuristic based on a stronger variant of action cost sharing. We show that what is good for "typical" problems of probabilistic reasoning turns out not to be so for "typical" problems of classical planning, and provide a formal account for that difference.