PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains

In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, planetary rover exploration and spacecraft control domains. Other temporal and resource-intensive domains including logistics planning, plant control and manufacturing have also helped to focus the community on the modelling and reasoning issues that must be confronted to make planning technology meet the challenges of application. The International Planning Competitions have acted as an important motivating force behind the progress that has been made in planning since 1998. The third competition (held in 2002) set the planning community the challenge of handling time and numeric resources. This necessitated the development of a modelling language capable of expressing temporal and numeric properties of planning domains. In this paper we describe the language, PDDL2.1, that was used in the competition. We describe the syntax of the language, its formal semantics and the validation of concurrent plans. We observe that PDDL2.1 has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community.

[1]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[2]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[3]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[4]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[5]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[6]  Drew McDermott,et al.  A Temporal Logic for Reasoning About Processes and Plans , 1982, Cogn. Sci..

[7]  Johan van Benthem,et al.  The Logic of Time , 1983 .

[8]  Steven A. Vere,et al.  Planning in Time: Windows and Durations for Activities and Goals , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  James F. Allen Towards a General Theory of Action and Time , 1984, Artif. Intell..

[10]  Patrick J. Hayes,et al.  Short Time Periods , 1987, IJCAI.

[11]  Vladimir Lifschitz,et al.  ON THE SEMANTICS OF STRIPS , 1987 .

[12]  Edwin P. D. Pednault,et al.  FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK , 1987 .

[13]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[14]  David E. Wilkins,et al.  Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.

[15]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[16]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[17]  Murray Shanahan,et al.  Representing Continuous Change in the Event Calculus , 1990, ECAI.

[18]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[19]  Fahiem Bacchus,et al.  A Non-Reified Temporal Logic , 1989, Artif. Intell..

[20]  Michael Gelfond,et al.  What are the Limitations of the Situation Calculus? , 1991, Automated Reasoning: Essays in Honor of Woody Bledsoe.

[21]  James F. Allen Planning as Temporal Reasoning , 1991, KR.

[22]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[23]  Nicola Muscettola,et al.  Integrating Planning and Scheduling , 1993 .

[24]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[25]  Daniel S. Weld,et al.  Temporal Planning with Continuous Change , 1994, AAAI.

[26]  Austin Tate,et al.  The Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an Activity Based Planner , 1994, AIPS.

[27]  Malik Ghallab,et al.  Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.

[28]  VilaLluís,et al.  A survey on temporal reasoning in artificial intelligence , 1994 .

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

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

[31]  E. Sandewall Features and fluents (vol. 1): the representation of knowledge about dynamical systems , 1995 .

[32]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

[33]  Toby Walsh,et al.  Proceedings of AAAI-96 , 1996 .

[34]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[35]  A. El-Kholy,et al.  Temporal and Resource Reasoning in Planning: the parcPLAN approach , 1996, ECAI.

[36]  Amedeo Cesta,et al.  Gaining efficiency and flexibility in the simple temporal problem , 1996, Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96).

[37]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[38]  Thomas A. Henzinger,et al.  Robust Timed Automata , 1997, HART.

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

[40]  Murray Shanahan,et al.  The Event Calculus Explained , 1999, Artificial Intelligence Today.

[41]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

[42]  Hector Muñoz-Avila,et al.  SHOP: Simple Hierarchical Ordered Planner , 1999, IJCAI.

[43]  Nicola Muscettola,et al.  Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[44]  Drew McDermott,et al.  The 1998 AI Planning Systems Competition , 2000, AI Mag..

[45]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

[46]  Alex Fukunaga,et al.  Iterative Repair Planning for Spacecraft Operations Using the Aspen System , 2000 .

[47]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[48]  Michael Wooldridge,et al.  Artificial Intelligence Today , 1999, Lecture Notes in Computer Science.

[49]  Fahiem Bacchus,et al.  Planning with Resources and Concurrency: A Forward Chaining Approach , 2001, IJCAI.

[50]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

[51]  Malte Helmert,et al.  Decidability and Undecidability Results for Planning with Numerical State Variables , 2002, PuK.

[52]  Federico Barber Sanchís,et al.  Representation and reasoning with disjunctive temporal constraints , 2002, Proceedings Ninth International Symposium on Temporal Representation and Reasoning.

[53]  Derek Long,et al.  Validating plans with continuous effects , 2003 .

[54]  Maria Fox,et al.  Exploiting a Graphplan Framework in Temporal Planning , 2003, ICAPS.

[55]  M. Fox,et al.  The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..

[56]  Drew McDermott Reasoning about Autonomous Processes in an Estimated-Regression Planner , 2003, ICAPS.

[57]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.