Planning Domain Definition Language

From Wikipedia, the free encyclopedia
Jump to: navigation, search

The Planning Domain Definition Language (PDDL) is an attempt to standardize Artificial Intelligence (AI) planning languages. It was first developed by Drew McDermott and his colleagues in 1998 (inspired by STRIPS and ADL among others) mainly to make the 1998/2000 International Planning Competition (IPC) possible, and then evolved with each competition. "The adoption of a common formalism for describing planning domains fosters far greater reuse of research and allows more direct comparison of systems and approaches, and therefore supports faster progress in the field. A common formalism is a compromise between expressive power (in which development is strongly driven by potential applications) and the progress of basic research (which encourages development from well-understood foundations). The role of a common formalism as a communication medium for exchange demands that it is provided with a clear semantics."[1]

De facto official versions of PDDL[edit]

PDDL1.2[edit]

This was the official language of the 1st and 2nd IPC in 1998 and 2000 respectively.[2] It separated the model of the planning problem in two major parts: (1) domain description and (2) the related problem description. Such a division of the model allows for an intuitive separation of those elements, which are (1) present in every specific problem of the problem-domain (these elements are contained in the domain-description), and those elements, which (2) determine the specific planning-problem (these elements are contained in the problem-description). Thus several problem-descriptions may be connected to the same domain-description (just like several instances may exist of a class in OOP (Object Oriented Programming) or in OWL (Ontology Web Language) for example). Thus a domain and a connecting problem description forms the PDDL-model of a planning-problem, and eventually this is the input of a planner (usually domain-independent AI planner) software, which aims to solve the given planning-problem via some appropriate planning algorithm. The output of the planner is not specified by PDDL, but it is usually a totally or partially ordered plan (a sequence of actions, some of which may be executed even in parallel sometimes). Now lets take a look at the contents of a PDDL1.2 domain and problem description in general...
(1) The domain description consisted of a domain-name definition, definition of requirements (to declare those model-elements to the planner which the PDDL-model is actually using), definition of object-type hierarchy (just like a class-hierarchy in OOP), definition of constant objects (which are present in every problem in the domain), definition of predicates (templates for logical facts), and also the definition of possible actions (operator-schemas with parameters, which should be grounded/instantiated during execution). Actions had parameters (variables that may be instantiated with objects), preconditions and effects. The effects of actions could be also conditional (when-effects).
(2) The problem description consisted of a problem-name definition, the definition of the related domain-name, the definition of all the possible objects (atoms in the logical universe), initial conditions (the initial state of the planning environment, a conjunction of true/false facts), and the definition of goal-states (a logical expression over facts that should be true/false in a goal-state of the planning environment). Thus eventually PDDL1.2 captured the "physics" of a deterministic single-agent discrete fully accessible planning environment.

PDDL2.1[edit]

This was the official language of the 3rd IPC in 2002.[3] It introduced numeric fluents (e.g. to model non-binary resources such as fuel-level, time, energy, distance, weight, ...), plan-metrics (to allow quantitative evaluation of plans, and not just goal-driven, but utility-driven planning, i.e. optimization, metric-minimization/maximization), and durative/continuous actions (which could have variable, non-discrete length, conditions and effects). Eventually PDDL2.1 allowed the representation and solution of many more real-world problems than the original version of the language.

PDDL2.2[edit]

This was the official language of the deterministic track of the 4th IPC in 2004.[4] It introduced derived predicates (to model the dependency of given facts from other facts, e.g. if A is reachable from B, and B is reachable from C, then A is reachable from C (transitivity)), and timed initial literals (to model exogenous events occurring at given time independently from plan-execution). Eventually PDDL2.2 extended the language with a few important elements, but wasn't a radical evolution compared to PDDL2.1 after PDDL1.2.

PDDL3.0[edit]

This was the official language of the deterministic track of the 5th IPC in 2006.[5][6][7] It introduced state-trajectory constraints (hard-constraints in form of modal-logic expressions, which should be true for the state-trajectory produced during the execution of a plan, which is a solution of the given planning problem), preferences (soft-constraints in form of logical expressions, similar to hard-constraints, but their satisfaction wasn't necessary, although it could be incorporated into the plan-metric e.g. to maximize the number of satisfied preferences, or to just measure the quality of a plan). Eventually PDDL3.0 updated the expressiveness of the language to be able to cope with recent, important developments in planning.

PDDL3.1[edit]

This was the official language of the deterministic track of the 6th and 7th IPC in 2008 and 2011 respectively.[8][9][10] It introduced object-fluents (i.e. functions' range now could be not only numerical (integer or real), but it could be any object-type also). Thus PDDL3.1 adapted the language even more to modern expectations with a syntactically seemingly small, but semantically quite significant change in expressiveness.

Current situation[edit]

The latest version of the language is PDDL3.1. The BNF (Backus–Naur Form) syntax definition of PDDL3.1 can be found among the resources of the IPC-2011 homepage.

Successors/variants/extensions of PDDL[edit]

PDDL+[edit]

This extension of PDDL2.1 from around 2002-2006 provides a more flexible model of continuous change through the use of autonomous processes and events.[1][11] The key this extension provides is the ability to model the interaction between the agent's behaviour and changes that are initiated by the agent's environment. Processes run over time and have a continuous effect on numeric values. They are initiated and terminated either by the direct action of the agent or by events triggered in the environment. This 3-part structure is referred to as the start-process-stop model. Distinctions are made between logical and numeric states: transitions between logical states are assumed to be instantaneous whilst occupation of a given logical state can endure over time. Thus in PDDL+ continuous update expressions are restricted to occur only in process effects. Actions and events, which are instantaneous, are restricted to the expression of discrete change. This introduces the before mentioned 3-part modelling of periods of continuous change: (1) an action or event starts a period of continuous change on a numeric variable expressed by means of a process; (2) the process realizes the continuous change of the numeric variable; (3) an action or event finally stops the execution of the process and terminates its effect on the numeric variable. Comment: the goals of the plan might be achieved before an active process is stopped.

NDDL[edit]

NDDL (New Domain Definition Language) is NASA's response to PDDL from around 2002.[12][13] Its representation differs from PDDL in several respects: 1) it uses a variable/value representation (timelines/activities) rather than a propositional/first-order logic, and 2) there is no concept of states or actions, only of intervals (activities) and constraints between those activities. In this respect, models in NDDL look more like schemas for SAT encodings of planning problems rather than PDDL models. Because of the mentioned differences planning and execution of plans (e.g. during critical space missions) may be more robust when using NDDL, but the correspondence to standard planning-problem representations other than PDDL may be much less intuitive than in case of PDDL.

MAPL[edit]

MAPL (Multi-Agent Planning Language, pronounced "maple") is an extension of PDDL2.1 from around 2003.[14] It is a quite serious modification of the original language. It introduces non-propositional state-variables (which may be n-ary: true, false, unknown, or anything else). It introduces a temporal model given with modal operators (before, after, etc.). Nonetheless in PDDL3.0 a more thorough temporal model was given, which is also compatible with the original PDDL syntax (and it is just an optional addition). MAPL also introduces actions whose duration will be determined in runtime and explicit plan synchronization which is realized through speech act based communication among agents. This assumption may be artificial, since agents executing concurrent plans shouldn’t necessarily communicate to be able to function in a multi-agent environment. Finally, MAPL introduces events (endogenous and exogenous) for the sake of handling concurrency of actions. Thus events become part of plans explicitly, and are assigned to agents by a control function, which is also part of the plan.

OPT[edit]

OPT (Ontology with Polymorphic Types) was a profound extension of PDDL2.1 by Drew McDermott from around 2003-2005 (with some similarities to PDDL+).[15] It was an attempt to create a general-purpose notation for creating ontologies, defined as formalized conceptual frameworks for planning domains about which planning applications are to reason. Its syntax was based on PDDL, but it had a much more elaborate type system, which allowed users to make use of higher-order constructs such as explicit λ-expressions allowing for efficient type inference (i.e. not only domain objects had types (level 0 types), but also the functions/fluents defined above these objects had types in the form of arbitrary mappings (level 1 types), which could be generic, so their parameters (the domain and range of the generic mapping) could be defined with variables, which could have an even higher level type (level 2 type) not to speak of that the mappings could be arbitrary, i.e. the domain or range of a function (e.g. predicate, numeric fluent) could be any level 0/1/2 type. For example functions could map from arbitrary functions to arbitrary functions...). OPT was basically intended to be (almost) upwardly compatible with PDDL2.1. The notation for processes and durative actions was borrowed mainly from PDDL+ and PDDL2.1, but beyond that OPT offered many other significant extensions (e.g. data-structures, non-Boolean fluents, return-values for actions, links between actions, hierarchical action expansion, hierarchy of domain definitions, the use of namespaces for compatibility with the semantic web).

PPDDL[edit]

PPDDL (Probabilistic PDDL) 1.0 was the official language of the probabilistic track of the 4th and 5th IPC in 2004 and 2006 respectively.[16] It extended PDDL2.1 with probabilistic effects (discrete, general probability distributions over possible effects of an action), reward fluents (for incrementing or decrementing the total reward of a plan in the effects of the actions), goal rewards (for rewarding a state-trajectory, which incorporates at least one goal-state), and goal-achieved fluents (which were true, if the state-trajectory incorporated at least one goal-state). Eventually these changes allowed PPDDL1.0 to realize Markov Decision Process (MDP) planning, where there may be uncertainty in the state-transitions, but the environment is fully observable for the planner/agent.

APPL[edit]

APPL (Abstract Plan Preparation Language) is a newer variant of NDDL from 2006, which is more abstract than most existing planning languages such as PDDL or NDDL.[17] The goal of this language was to simplify the formal analysis and specification of planning problems that are intended for safety-critical applications such as power management or automated rendezvous in future manned spacecraft. APPL used the same concepts as NDDL with the extension of actions, and also some other concepts, but still it’s expressive power is much less than PDDL’s (in hope of staying robust and formally verifiable).

RDDL[edit]

RDDL (Relational Dynamic influence Diagram Language) was the official language of the uncertainty track of the 7th IPC in 2011.[18] Conceptually it is based on PPDDL1.0 and PDDL3.0, but practically it is a completely different language both syntactically and semantically. The introduction of partial observability is one of the most important changes in RDDL compared to PPDDL1.0. It allows efficient description of Markov Decision Processes (MDPs) and Partially Observable Markov Decision Processes (POMDPs) by representing everything (state-fluents, observations, actions, ...) with variables. This way RDDL departs from PDDL significantly. Grounded RDDL corresponds to Dynamic Bayesian Networks (DBNs) similarly to PPDDL1.0, but RDDL is more expressive than PPDDL1.0.

MA-PDDL[edit]

MA-PDDL (Multi Agent PDDL) is a minimalistic, modular extension of PDDL3.1 introduced in 2012 (i.e. a new :multi-agent requirement) that allows planning by and for multiple agents.[19] The addition is compatible with all the features of PDDL3.1 and addresses most of the issues of MAPL. It adds the possibility to distinguish between the possibly different actions of different agents (i.e. different capabilities). Similarly different agents may have different goals and/or metrics. The preconditions of actions now may directly refer to concurrent actions (e.g. the actions of other agents) and thus actions with interacting effects can be represented in a general, flexible way (e.g. suppose that at least 2 agents are needed to execute a lift action to lift a heavy table into the air, or otherwise the table would remain on the ground (this is an example of constructive synergy, but destructive synergy can be also easily represented in MA-PDDL)). Moreover, as kind of syntactic sugar, a simple mechanism for the inheritance and polymorphism of actions, goals and metrics was also introduced in MA-PDDL (assuming :typing is declared). Since PDDL3.1 assumes that the environment is deterministic and fully observable, the same holds for MA-PDDL, i.e. every agent can access the value of every state fluent at every time-instant and observe every previously executed action of each agent, and also the concurrent actions of agents unambiguously determine the next state of the environment. This was improved later by the addition of partial-observability and probabilistic effects (again, in form of two new modular requirements, :partial-observability and :probabilistic-effects, respectively, the latter being inspired by PPDDL1.0, and both being compatible with all the previous features of the language, including :multi-agent).[20]

Example[edit]

This is the problem definition of a STRIPS instance for the automated planning of a robot with two gripper arms.[21]

(define (problem strips-gripper2)
    (:domain gripper-strips)
    (:objects rooma roomb ball1 ball2 left right)
    (:init (room rooma)
           (room roomb)
           (ball ball1)
           (ball ball2)
           (gripper left)
           (gripper right)
           (at-robby rooma)
           (free left)
           (free right)
           (at ball1 rooma)
           (at ball2 rooma))
    (:goal (at ball1 roomb)))

References[edit]

  1. ^ a b Fox, M.; Long, D. (2002). "PDDL+: Modeling continuous time dependent effects". "Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for Space". CiteSeerX: 10.1.1.15.5965. 
  2. ^ McDermott, Drew; Ghallab, Malik; Howe, Adele; Knoblock, Craig; Ram, Ashwin; Veloso, Manuela; Weld, Daniel; Wilkins, David (1998). "PDDL---The Planning Domain Definition Language". Technical Report CVC TR­98­003/DCS TR­1165 (New Haven, CT: Yale Center for Computational Vision and Control). CiteSeerX: 10.1.1.51.9941. 
  3. ^ Fox, M.; Long, D. (2003). "PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains". Journal of Artificial Intelligence Research (JAIR) 20: 61–124. 
  4. ^ Edelkamp, S.; Hoffmann, J. (2003). "PDDL2.2: The Language for the Classical Part of the 4th International planning Competition". Technical Report No. 195 (Institut für Informatik). 
  5. ^ Gerevini, A.; Long, D. (2006). "Preferences and Soft Constraints in PDDL3". "Proceedings of the ICAPS-2006 Workshop on Preferences and Soft Constraints in Planning". pp. 46–54. 
  6. ^ Gerevini, A.; Long, D. (2005). "Plan Constraints and Preferences in PDDL3". Technical Report R. T. 2005-08-47 (Dipartimento di Elettronica per l'Automazione, Università degli Studi di Brescia). 
  7. ^ Gerevini, A.; Long, D. (2005). "BNF Description of PDDL3.0". Unpublished manuscript linked from the IPC-5 website. 
  8. ^ Helmert, M. (2008). "Changes in PDDL 3.1". Unpublished summary from the IPC-2008 website. 
  9. ^ Kovacs, D. L. (2011). "BNF Definition of PDDL3.1: completely corrected, without comments". Unpublished manuscript from the IPC-2011 website. 
  10. ^ Kovacs, D. L. (2011). "BNF Definition of PDDL3.1: partially corrected, with comments/explanations". Unpublished manuscript from the IPC-2011 website. 
  11. ^ Fox, M.; Long, D. (2006). "Modelling Mixed Discrete-Continuous Domains for Planning". Journal of Artificial Intelligence Research 27: 235–297. arXiv:1110.2200. doi:10.1613/jair.2044. CiteSeerX: 10.1.1.75.6792. 
  12. ^ Frank, J.; Jonsson, A. (2002). "Constraint-based attribute and interval planning". Technical report (Moffett Field, CA: NASA Ames Research Center). 
  13. ^ Bernardini, S.; Smith, D. E. (2007). "Developing Domain-Independent Search Control for EUROPA2". "Proceedings of the Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges". 17th International Conference on Automated Planning and Scheduling (ICAPS-2007). Rhode Island, USA. 
  14. ^ Brenner, M. (2003). "A Multiagent Planning Language". "Proceedings of the Workshop on PDDL". 13th International Conference on Automated Planning and Scheduling (ICAPS-2003). Trento, Italy. 
  15. ^ McDermott, D. (2005). "OPT Manual Version 1.7.3 (Reflects Opt Version 1.6.11) * DRAFT **". Unpublished manuscript from Drew McDermott's website. 
  16. ^ Younes, H. L. S.; Littman, M. L. (2004). "PPDDL 1.0: an extension to PDDL for expressing planning domains with probabilistic effects". Technical Report CMU-CS-04-167 (Pittsburgh: Carnegie Mellon University). 
  17. ^ Butler, R.; Muñoz, C. (2006). "An Abstract Plan Preparation Language". NASA Technical Report NASA/TM-2006-214518. 
  18. ^ Sanner, S. (2010). "Relational Dynamic Influence Diagram Language (RDDL): Language Description". Unpublished manuscript from the IPC-2011 website. 
  19. ^ Kovacs, D. L. (2012). "A Multi-Agent Extension of PDDL3.1". "Proceedings of the 3rd Workshop on the International Planning Competition (IPC)". 22nd International Conference on Automated Planning and Scheduling (ICAPS-2012). Atibaia, São Paulo, Brazil. pp. 19–27. 
  20. ^ Kovacs, D. L.; Dobrowiecki, T. P. (2013). "Converting MA-PDDL to extensive-form games". Acta Polytechnica Hungarica 10 (8): 27–47. doi:10.12700/APH.10.08.2013.8.2. 
  21. ^ Veloso, Manuela. "PDDL by Example" (pdf). Carnegie Mellon University. Retrieved 2013-02-27.