Planning Domain Definition Language (PDDL). PDDL2.1: An extension to PDDL for expressing temporal planning domains. In recent years research in the planning community has moved increasingly toward s application of planners to realistic problems involving both time and many typ es of resources. For example, interest in planning demonstrated by the space res earch 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 com petition (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.
Keywords for this software
References in zbMATH (referenced in 92 articles , 1 standard article )
Showing results 81 to 92 of 92.
- Wah, Benjamin W.; Chen, Yixin: Constraint partitioning in penalty formulations for solving temporal planning problems (2006)
- Bock, Conrad; Gruninger, Michael: PSL: a semantic domain for flow models (2005) ioport
- Oglietti, Marcelo: Understanding planning with incomplete information and sensing (2005)
- Shin, Ji-Ae; Davis, Ernest: Processes and continuous change in a SAT-based planner (2005)
- Thiébaux, Sylvie; Hoffmann, Jörg; Nebel, Bernhard: In defense of PDDL axioms (2005)
- Eiter, Thomas; Faber, Wolfgang; Leone, Nicola; Pfeifer, Gerald; Polleres, Axel: A logic programming approach to knowledge-state planning. II: The DLV(^\mathcalK) system (2003)
- Fox, M.; Long, D.: PDDL2.1: An extension to PDDL for expressing temporal planning domains (2003)
- Geffner, H. A.: PDDL 2.1: Representation vs. computation (2003)
- Bonet, B.; Geffner, H.: Planning as heuristic search (2001)
- Bonet, Blai; Geffner, Héctor: Planning and control in artificial intelligence: A unifying perspective (2001)
- Lin, Fangzhen: On strongest necessary and weakest sufficient conditions (2001)
- Simpson, R. M.; McCluskey, T. L.; Liu, D.; Kitchin, D. E.: Knowledge representation in planning; A PDDL to (OCL_h) translation (2000)