Planning Domain Definition Language
Encyclopedia
The Planning Domain Definition Language (PDDL) is an attempt to standardize planning
domain and problem description languages. It was developed mainly to make the 1998/2000 International Planning Competitions possible.
It was first developed by Drew McDermott in 1998 and later evolved with each International Planning Competition. The latest version of this language is PDDL3.1.
Planning tasks specified in PDDL are separated into two files:
PDDL also supports preference-based planning
.
Opt is a successor to PDDL.
Automated planning and scheduling
Automated planning and scheduling is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents, autonomous robots and unmanned vehicles. Unlike classical control and classification problems, the solutions are...
domain and problem description languages. It was developed mainly to make the 1998/2000 International Planning Competitions possible.
It was first developed by Drew McDermott in 1998 and later evolved with each International Planning Competition. The latest version of this language is PDDL3.1.
Planning tasks specified in PDDL are separated into two files:
- A domain file for predicates and actions
- A problem file for objects, initial states and goal specifications.
PDDL also supports preference-based planning
Preference-based planning
In artificial intelligence, preference-based planning is a form of automated planning and scheduling which focuses on producing plans that additionally satisfy as many user-specified preferences as possible. In many problem domains, a task can be accomplished by various sequences of actions...
.
Opt is a successor to PDDL.