Everything You Always Wanted to Know about Planning - (But Were Afraid to Ask)

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.

[1]  Eva Onaindia,et al.  Automatic generation of temporal planning domains for e-learning problems , 2010, J. Sched..

[2]  Carmel Domshlak,et al.  Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.

[3]  Malte Helmert,et al.  Preferred Operators and Deferred Evaluation in Satisficing Planning , 2009, ICAPS.

[4]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[5]  Jörg Hoffmann,et al.  SAP Speaks PDDL , 2010, AAAI.

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  Ronald P. A. Petrick,et al.  EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION , 2011, Comput. Intell..

[8]  T. L. McCluskey,et al.  Planning domain definition using GIPO , 2007, The Knowledge Engineering Review.

[9]  Jussi Rintanen,et al.  Heuristics for Planning with SAT , 2010, CP.

[10]  Carmel Domshlak,et al.  Structural Patterns Heuristics via Fork Decomposition , 2008, ICAPS.

[11]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[12]  Subbarao Kambhampati,et al.  An LP-Based Heuristic for Optimal Planning , 2007, CP.

[13]  Carlos Sarraute,et al.  Attack Planning in the Real World , 2013, ArXiv.

[14]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

[15]  Jörg Hoffmann.  Where Ignoring Delete Lists Works, Part II: Causal Graphs , 2011, ICAPS.

[16]  Jörg Hoffmann.  Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+ , 2011, J. Artif. Intell. Res..

[17]  Jj Org Hoomann.  Local Search Topology in Planning Benchmarks: a Theoretical Analysis , .

[18]  Jörg Hoffmann,et al.  Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF , 2010, ICAPS.

[19]  Wheeler Ruml,et al.  On-line Planning and Scheduling: An Application to Controlling Modular Printers , 2008, AAAI.

[20]  Jörg Hoffmann.  Utilizing Problem Structure in Planning: A Local Search Approach , 2003, Künstliche Intell..

[21]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[22]  Ilkka Niemelä,et al.  Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..

[23]  Blai Bonet,et al.  Heuristics for planning with penalties and rewards formulated in logic and computed through circuits , 2008, Artif. Intell..

[24]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[25]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[26]  Drew McDermott,et al.  A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.

[27]  Patrik Haslum,et al.  Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.

[28]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[29]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[30]  Blai Bonet,et al.  Strengthening Landmark Heuristics via Hitting Sets , 2010, ECAI.

[31]  Silvia Richter,et al.  The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..

[32]  Jorg Homann.  Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h + , 2011 .

[33]  Jörg Hoffmann,et al.  Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.

[34]  T. L. McCluskey,et al.  Acquisition of Object-Centred Domain Models from Planning Examples , 2009, ICAPS.

[35]  Wheeler Ruml,et al.  Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates , 2011, IJCAI.

[36]  Carmel Domshlak,et al.  Optimal Additive Composition of Abstraction-based Admissible Heuristics , 2008, ICAPS.

[37]  Jj Org Hoomann.  Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks , 2003 .

[38]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[39]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[40]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[41]  Erez Karpas,et al.  Sensible Agent Technology Improving Coordination and Communication in Biosurveillance Domains , 2009, IJCAI.

[42]  José Reinaldo Silva,et al.  itSIMPLE 2.0: An Integrated Tool for Designing Planning Domains , 2007, ICAPS.

[43]  J. Ho,et al.  The Metric FF Planning System Translating Ignoring Delete Lists to Numeric State Variables , 2003 .