Planning in polynomial time: the SAS-PUBS class
Computational Intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Automatically generating abstractions for planning
Artificial Intelligence
Fast planning through planning graph analysis
Artificial Intelligence
State-variable planning under structural restrictions: algorithms and complexity
Artificial Intelligence
Inferring state constraints for domain-independent planning
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 - Special issue on heuristic search in artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity results for standard benchmark domains in planning
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
Ignoring Irrelevant Facts and Operators in Plan Generation
ECP '97 Proceedings of the 4th 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
Utilizing Problem Structure in Planning: A Local Search Approach
Utilizing Problem Structure in Planning: A Local Search Approach
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
Learning from planner performance
Artificial Intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
A reactive planner for a model-based executive
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Structure and complexity in planning with unary operators
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
The complexity of planning problems with simple causal graphs
Journal of Artificial Intelligence Research
New Islands of tractability of cost-optimal planning
Journal of Artificial Intelligence Research
Planning over chain causal graphs for variables with domains of size 5 Is NP-hard
Journal of Artificial Intelligence Research
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
The detection and exploitation of symmetry in planning problems
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Reducing accidental complexity in planning problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Cost-optimal planning with landmarks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The role of macros in tractable planning
Journal of Artificial Intelligence Research
Causal graphs and structurally restricted planning
Journal of Computer and System Sciences
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
Macro learning in planning as parameter configuration
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Post-design analysis for building and refining AI planning systems
Engineering Applications of Artificial Intelligence
The complexity of optimal monotonic planning: the bad, the good, and the causal graph
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic h+ has amazing qualities in many classical planning benchmarks, in particular pertaining to the complete absence of local minima. The proofs of this are hand-made, raising the question whether such proofs can be lead automatically by domain analysis techniques. In contrast to earlier disappointing results - the analysis method has exponential runtime and succeeds only in two extremely simple benchmark domains - we herein answer this question in the afirmative. We establish connections between causal graph structure and h+ topology. This results in low-order polynomial time analysis methods, implemented in a tool we call TorchLight. Of the 12 domains where the absence of local minima has been proved, TorchLight gives strong success guarantees in 8 domains. Empirically, its analysis exhibits strong performance in a further 2 of these domains, plus in 4 more domains where local minima may exist but are rare. In this way, TorchLight can distinguish "easy" domains from "hard" ones. By summarizing structural reasons for analysis failure, TorchLight also provides diagnostic output indicating domain aspects that may cause local minima.