The computational complexity of propositional STRIPS planning
Artificial Intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
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
Planning domain definition using GIPO
The Knowledge Engineering Review
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Cost-optimal planning with landmarks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Automatic generation of temporal planning domains for e-learning problems
Journal of Scheduling
Strengthening Landmark Heuristics via Hitting Sets
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Heuristics for planning with SAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
Bounded suboptimal search: a direct approach using inadmissible estimates
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Hi-index | 0.00 |
Domain-independent planning is one of the long-standing sub-areas of Artificial Intelligence (AI), aiming at approaching human problem-solving flexibility. The area has long had an affinity towards playful illustrative examples, imprinting it on the mind of many a student as an area concerned with the rearrangement of blocks, and with the order in which to put on socks and shoes (not to mention the disposal of bombs in toilets). Working on the assumption that this "student" is you - the readers in earlier stages of their careers - I herein aim to answer three questions that you surely desired to ask back then already: What is it good for? Does it work? Is it interesting to do research in? Answering the latter two questions in the affirmative (of course!), I outline some of the major developments of the last decade, revolutionizing the ability of planning to scale up, and the understanding of the enabling technology. Answering the first question, I point out that modern planning proves to be quite useful for solving practical problems - including, perhaps, yours.