380:. 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:
376:. 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
59:
the action and the effects of the action. PDDL separates the model of the planning problem into two major parts: (1) a domain description of those elements that are present in every problem of the problem domain, and (2) the problem description which determines the specific planning problem. The problem description includes the initial state and the goals to be accomplished. The
557:) 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
443:
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
58:
PDDL is a human-readable format for problems in automated planning that gives a description of the possible states of the world, a description of the set of possible actions, a specific initial state of the world, and a specific set of desired goals. Action descriptions include the prerequisites of
673:
anguage) is a newer variant of NDDL from 2006, which is more abstract than most existing planning languages such as PDDL or NDDL. 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
797:
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
307:(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) to enable
331:(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.
784:
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
94:(OWL). Ontologies are a formal way to describe taxonomies and classification networks, essentially defining the structure of knowledge for various domains: the nouns representing classes of objects and the verbs representing relations between the objects.
50:(IPC) possible, and then evolved with each competition. The standardization provided by PDDL has the benefit of making research more reusable and easily comparable, though at the cost of some expressive power, compared to domain-specific systems.
236:(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.
141:
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 as several instances may exist of a class in
283:(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.
491:
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
263:(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.
66:
PDDL becomes the input to planner software, which is usually a domain-independent
Artificial Intelligence (AI) planner. PDDL does not describe the output of the planner software, but the output is usually a
479:(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
392:
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.
798:
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,
162:(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...
709:
IPC in 2011. 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
553:), 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 (
531:, 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
1922:
279:(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
721:
by representing everything (state-fluents, observations, actions, ...) with variables. This way RDDL departs from PDDL significantly. Grounded RDDL corresponds to
2036:
2080:
718:
259:(to allow quantitative evaluation of plans, and not just goal-driven, but utility-driven planning, i.e. optimization, metric-minimization/maximization), and
2058:
2088:
1886:
303:
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) and
154:
of a planner (usually domain-independent AI planner) software, which aims to solve the given planning-problem via some appropriate planning algorithm. The
2386:
823:
75:
471:
anguage, pronounced "maple") is an extension of PDDL2.1 from around 2003. It is a quite serious modification of the original language. It introduces
1385:
And this is the problem definition that instantiates the previous domain definition with a concrete environment with two rooms and two balls.
1825:
678:, and also some other concepts, but still its expressive power is much less than PDDL's (in hope of staying robust and formally verifiable).
137:
present in every specific problem of the problem-domain (these elements are contained in the domain-description), and those elements, which
150:
for example). Thus a domain and a connecting problem description forms the PDDL-model of a planning-problem, and eventually this is the
642:(which were true, if the state-trajectory incorporated at least one goal-state). Eventually these changes allowed PPDDL1.0 to realize
47:
311:. Eventually PDDL3.0 updated the expressiveness of the language to be able to cope with recent, important developments in planning.
39:
1755:
646:
planning, where there may be uncertainty in the state-transitions, but the environment is fully observable for the planner/agent.
368:
This extension of PDDL2.1 from around 2002–2006 provides a more flexible model of continuous change through the use of autonomous
251:
63:
below gives a domain definition and a problem description instance for the automated planning of a robot with two gripper arms.
2308:. 22nd International Conference on Automated Planning and Scheduling (ICAPS-2012). Atibaia, São Paulo, Brazil. pp. 19–27.
496:
for the sake of handling concurrency of actions. Thus events become part of plans explicitly, and are assigned to agents by a
1636:
527:
from around 2003–2005 (with some similarities to PDDL+). It was an attempt to create a general-purpose notation for creating
440:
87:
1995:
245:
1951:
776:. The preconditions of actions now may directly refer to concurrent actions (e.g. the actions of other agents) and thus
1933:
2391:
2356:
180:
143:
79:
1846:
2174:
Proceedings of the
Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges
1973:
1693:
2254:
308:
1878:
565:
was borrowed mainly from PDDL+ and PDDL2.1, but beyond that OPT offered many other significant extensions (e.g.
272:
722:
384:
an action or event starts a period of continuous change on a numeric variable expressed by means of a process;
83:
1686:
674:
management or automated rendezvous in future manned spacecraft. APPL used the same concepts as NDDL with the
423:'s response to PDDL from around 2002. Its representation differs from PDDL in several respects: 1) it uses a
2188:
714:
643:
780:
can be represented in a general, flexible way (e.g. suppose that at least 2 agents are needed to execute a
549:), but also the functions/fluents defined above these objects had types in the form of arbitrary mappings (
101:
syntax definition of PDDL 3.1. Several online resources of how to use PDDL are available, and also a book.
2107:
1857:
1665:
428:
232:(the initial state of the planning environment, a conjunction of true/false facts), and the definition of
159:
68:
2166:
1788:
475:(which may be n-ary: true, false, unknown, or anything else). It introduces a temporal model given with
195:(operator-schemas with parameters, which should be grounded/instantiated during execution). Actions had
147:
91:
2017:
344:
340:
175:(to declare those model-elements to the planner which the PDDL-model is actually using), definition of
98:
2298:
713:
is one of the most important changes in RDDL compared to PPDDL1.0. It allows efficient description of
118:
IPC in 1998 and 2000 respectively. It separated the model of the planning problem in two major parts:
2176:. 17th International Conference on Automated Planning and Scheduling (ICAPS-2007). Rhode Island, US.
2144:
2112:
1862:
1809:
1670:
1781:
2198:. 13th International Conference on Automated Planning and Scheduling (ICAPS-2003). Trento, Italy.
2125:
2097:
1903:
133:. Such a division of the model allows for an intuitive separation of those elements, which are
1821:
432:
255:(e.g. to model non-binary resources such as fuel-level, time, energy, distance, weight, ...),
1632:
634:(for incrementing or decrementing the total reward of a plan in the effects of the actions),
348:
17:
2335:
2320:
2233:"PPDDL 1.0: an extension to PDDL for expressing planning domains with probabilistic effects"
2210:
2117:
1923:"PDDL2.2: The Language for the Classical Part of the 4th International planning Competition"
1895:
1813:
2276:
1803:
537:
1662:
Proceedings of the 3rd
International NASA Workshop on Planning and Scheduling for Space
542:
524:
43:
1959:
Proceedings of the ICAPS-2006 Workshop on
Preferences and Soft Constraints in Planning
1845:; Knoblock, Craig; Ram, Ashwin; Veloso, Manuela; Weld, Daniel; Wilkins, David (1998).
810:, and both being compatible with all the previous features of the language, including
619:
352:
2380:
591:
2232:
1802:
Haslum, Patrik; Lipovetzky, Nir; Magazzeni, Daniele; Muise, Christian (April 2019).
638:(for rewarding a state-trajectory, which incorporates at least one goal-state), and
2129:
1983:. Dipartimento di Elettronica per l'Automazione, UniversitĂ degli Studi di Brescia.
1907:
706:
596:
324:
630:(discrete, general probability distributions over possible effects of an action),
2340:
300:
2306:
Proceedings of the 3rd
Workshop on the International Planning Competition (IPC)
1660:
Fox, M.; Long, D. (2002). "PDDL+: Modeling continuous time dependent effects".
1842:
1817:
535:, which allowed users to make use of higher-order constructs such as explicit
488:
71:, which is a sequence of actions, some of which may be executed in parallel.
2277:"Relational Dynamic Influence Diagram Language (RDDL): Language Description"
2059:"BNF Definition of PDDL3.1: partially corrected, with comments/explanations"
1707:
1733:
1879:"PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains"
320:
2121:
1899:
826:
instance for the automated planning of a robot with two gripper arms.
1759:
1711:
760:
multiple agents. The addition is compatible with all the features of
347:
syntax definition of PDDL3.1 can be found among the resources of the
115:
388:
the process realizes the continuous change of the numeric variable;
2211:"OPT Manual Version 1.7.3 (Reflects Opt Version 1.6.11) * DRAFT **"
2037:"BNF Definition of PDDL3.1: completely corrected, without comments"
1856:. New Haven, CT: Yale Center for Computational Vision and Control.
772:(i.e. different capabilities). Similarly different agents may have
705:
anguage) was the official language of the uncertainty track of the
191:(templates for logical facts), and also the definition of possible
2102:
725:
similarly to PPDDL1.0, but RDDL is more expressive than PPDDL1.0.
618:) 1.0 was the official language of the probabilistic track of the
187:(which are present in every problem in the domain), definition of
319:
This was the official language of the deterministic track of the
292:
291:
This was the official language of the deterministic track of the
271:
This was the official language of the deterministic track of the
623:
420:
437:
intervals (activities) and constraints between those activities
768:. It adds the possibility to distinguish between the possibly
439:. In this respect, models in NDDL look more like schemas for
158:
of the planner is not specified by PDDL, but it is usually a
626:
IPC in 2004 and 2006 respectively. It extended PDDL2.1 with
82:(ADL), among others. The PDDL language uses principles from
435:, and 2) there is no concept of states or actions, only of
2167:"Developing Domain-Independent Search Control for EUROPA2"
2081:"Modelling Mixed Discrete-Continuous Domains for Planning"
1805:
787:
inheritance and polymorphism of actions, goals and metrics
46:
and his colleagues in 1998 mainly to make the 1998/2000
719:
Partially
Observable Markov Decision Processes (POMDPs)
1734:"What is Planning Domain Definition Language (PDDL)?"
2218:
Unpublished
Manuscript from Drew McDermott's Website
2003:
Unpublished
Manuscript Linked from the IPC-5 Website
481:
actions whose duration will be determined in runtime
425:
variable/value representation (timelines/activities)
199:(variables that may be instantiated with objects),
2145:"Constraint-based attribute and interval planning"
327:IPC in 2008 and 2011 respectively. It introduced
2284:Unpublished Manuscript from the IPC-2011 Website
2066:Unpublished Manuscript from the IPC-2011 Website
2044:Unpublished Manuscript from the IPC-2011 Website
1847:"PDDL---The Planning Domain Definition Language"
2154:. Moffett Field, CA: NASA Ames Research Center.
1633:"Writing Planning Domains and Problems in PDDL"
114:This was the official language of the 1st and
2022:Unpublished Summary from the IPC-2008 Website
806:, respectively, the latter being inspired by
523:ypes) was a profound extension of PDDL2.1 by
97:The latest version of PDDL is described in a
8:
2321:"Converting MA-PDDL to extensive-form games"
1756:"Planning Domain Definition Language (PDDL)"
2089:Journal of Artificial Intelligence Research
1974:"Plan Constraints and Preferences in PDDL3"
1952:"Preferences and Soft Constraints in PDDL3"
1887:Journal of Artificial Intelligence Research
2319:Kovacs, D. L.; Dobrowiecki, T. P. (2013).
748:) is a minimalistic, modular extension of
220:definition, the definition of the related
76:Stanford Research Institute Problem Solver
2339:
2262:NASA Technical Report NASA/TM-2006-214518
2242:. Pittsburgh: Carnegie Mellon University.
2231:Younes, H. L. S.; Littman, M. L. (2004).
2111:
2101:
1932:. Institut fĂĽr Informatik. Archived from
1861:
1669:
1655:
1653:
789:was also introduced in MA-PDDL (assuming
545:(i.e. not only domain objects had types (
2255:"An Abstract Plan Preparation Language"
1854:Technical Report CVC TR98003/DCS TR1165
1626:
1624:
1620:
216:The problem description consisted of a
207:. The effects of actions could be also
359:Successors/variants/extensions of PDDL
339:The latest version of the language is
244:This was the official language of the
167:The domain description consisted of a
74:The PDDL language was inspired by the
2165:Bernardini, S.; Smith, D. E. (2007).
770:different actions of different agents
224:, the definition of all the possible
42:languages. It was first developed by
40:Artificial Intelligence (AI) planning
7:
2299:"A Multi-Agent Extension of PDDL3.1"
764:and addresses most of the issues of
2196:Proceedings of the Workshop on PDDL
1921:Edelkamp, S.; Hoffmann, J. (2003).
822:This is the domain definition of a
86:languages which are used to author
32:Planning Domain Definition Language
1780:Helmert, Malte (16 October 2014).
500:, which is also part of the plan.
228:(atoms in the logical universe),
105:De facto official versions of PDDL
48:International Planning Competition
25:
2387:Automated planning and scheduling
1981:Technical Report R. T. 2005-08-47
1841:McDermott, Drew; Ghallab, Malik;
494:events (endogenous and exogenous)
473:non-propositional state-variables
160:totally or partially ordered plan
144:OOP (Object Oriented Programming)
69:totally or partially ordered plan
2189:"A Multiagent Planning Language"
778:actions with interacting effects
723:Dynamic Bayesian Networks (DBNs)
715:Markov Decision Processes (MDPs)
444:intuitive than in case of PDDL.
179:(just like a class-hierarchy in
2143:Frank, J.; Jonsson, A. (2002).
1994:Gerevini, A.; Long, D. (2005).
1972:Gerevini, A.; Long, D. (2005).
1950:Gerevini, A.; Long, D. (2006).
752:introduced in 2012 (i.e. a new
587:hierarchy of domain definitions
38:) is an attempt to standardize
2253:Butler, R.; Muñoz, C. (2006).
2240:Technical Report CMU-CS-04-167
1637:Australian National University
774:different goals and/or metrics
1:
644:Markov Decision Process (MDP)
583:hierarchical action expansion
485:explicit plan synchronization
299:(hard-constraints in form of
27:Planning programming language
18:Multi-Agent Planning Language
2362:. Carnegie Mellon University
1996:"BNF Description of PDDL3.0"
1687:"BNF definition of PDDL 3.1"
794:
761:
749:
297:state-trajectory constraints
60:
2341:10.12700/APH.10.08.2013.8.2
2328:Acta Polytechnica Hungarica
595:for compatibility with the
295:IPC in 2006. It introduced
275:IPC in 2004. It introduced
261:durative/continuous actions
248:IPC in 2002. It introduced
148:OWL (Web Ontology Language)
80:Action description language
2408:
2079:Fox, M.; Long, D. (2006).
1877:Fox, M.; Long, D. (2003).
1694:University of Huddersfield
807:
487:which is realized through
209:conditional (when-effects)
171:definition, definition of
1818:10.1007/978-3-031-01584-7
1782:"An Introduction to PDDL"
1685:Kovacs, Daniel L (2011).
765:
756:requirement) that allows
309:preference-based planning
1930:Technical Report No. 195
1708:"A PDDL Reference Guide"
1387:
828:
378:start-process-stop model
84:knowledge representation
541:allowing for efficient
2297:Kovacs, D. L. (2012).
2209:McDermott, D. (2005).
2057:Kovacs, D. L. (2011).
2035:Kovacs, D. L. (2011).
804::probabilistic-effects
800::partial-observability
345:BNF (Backus–Naur Form)
281:timed initial literals
99:BNF (Backus–Naur Form)
2018:"Changes in PDDL 3.1"
1789:University of Toronto
711:partial observability
640:goal-achieved fluents
628:probabilistic effects
533:elaborate type system
177:object-type hierarchy
92:Web Ontology Language
2187:Brenner, M. (2003).
2016:Helmert, M. (2008).
793:is declared). Since
676:extension of actions
90:, an example is the
2275:Sanner, S. (2010).
758:planning by and for
571:non-Boolean fluents
131:problem description
2392:Computer languages
277:derived predicates
230:initial conditions
123:domain description
2357:"PDDL by Example"
2355:Veloso, Manuela.
2122:10.1613/jair.2044
1961:. pp. 46–54.
1900:10.1613/jair.1129
1827:978-3-031-00456-8
697:ynamic influence
581:between actions,
433:first-order logic
353:IPC-2014 homepage
349:IPC-2011 homepage
335:Current situation
183:), definition of
78:(STRIPS) and the
16:(Redirected from
2399:
2371:
2370:
2368:
2367:
2361:
2352:
2346:
2345:
2343:
2325:
2316:
2310:
2309:
2303:
2294:
2288:
2287:
2281:
2272:
2266:
2265:
2259:
2250:
2244:
2243:
2237:
2228:
2222:
2221:
2215:
2206:
2200:
2199:
2193:
2184:
2178:
2177:
2171:
2162:
2156:
2155:
2152:Technical Report
2149:
2140:
2134:
2133:
2115:
2105:
2085:
2076:
2070:
2069:
2063:
2054:
2048:
2047:
2041:
2032:
2026:
2025:
2013:
2007:
2006:
2000:
1991:
1985:
1984:
1978:
1969:
1963:
1962:
1956:
1947:
1941:
1940:
1938:
1927:
1918:
1912:
1911:
1883:
1874:
1868:
1867:
1865:
1851:
1838:
1832:
1831:
1799:
1793:
1792:
1786:
1777:
1771:
1770:
1768:
1766:
1752:
1746:
1745:
1743:
1741:
1729:
1723:
1722:
1720:
1718:
1704:
1698:
1697:
1691:
1682:
1676:
1675:
1673:
1657:
1648:
1647:
1645:
1643:
1631:Haslum, Patrik.
1628:
1610:
1607:
1604:
1601:
1598:
1595:
1592:
1589:
1586:
1583:
1580:
1577:
1574:
1571:
1568:
1565:
1562:
1559:
1556:
1553:
1550:
1547:
1544:
1541:
1538:
1535:
1532:
1529:
1526:
1523:
1520:
1517:
1514:
1511:
1508:
1505:
1502:
1499:
1496:
1493:
1490:
1487:
1484:
1481:
1478:
1475:
1472:
1469:
1466:
1463:
1460:
1457:
1454:
1451:
1448:
1445:
1442:
1439:
1436:
1433:
1430:
1427:
1424:
1421:
1418:
1415:
1412:
1409:
1406:
1403:
1400:
1397:
1394:
1391:
1381:
1378:
1375:
1372:
1369:
1366:
1363:
1360:
1357:
1354:
1351:
1348:
1345:
1342:
1339:
1336:
1333:
1330:
1327:
1324:
1321:
1318:
1315:
1312:
1309:
1306:
1303:
1300:
1297:
1294:
1291:
1288:
1285:
1282:
1279:
1276:
1273:
1270:
1267:
1264:
1261:
1258:
1255:
1252:
1249:
1246:
1243:
1240:
1237:
1234:
1231:
1228:
1225:
1222:
1219:
1216:
1213:
1210:
1207:
1204:
1201:
1198:
1195:
1192:
1189:
1186:
1183:
1180:
1177:
1174:
1171:
1168:
1165:
1162:
1159:
1156:
1153:
1150:
1147:
1144:
1141:
1138:
1135:
1132:
1129:
1126:
1123:
1120:
1117:
1114:
1111:
1108:
1105:
1102:
1099:
1096:
1093:
1090:
1087:
1084:
1081:
1078:
1075:
1072:
1069:
1066:
1063:
1060:
1057:
1054:
1051:
1048:
1045:
1042:
1039:
1036:
1033:
1030:
1027:
1024:
1021:
1018:
1015:
1012:
1009:
1006:
1003:
1000:
997:
994:
991:
988:
985:
982:
979:
976:
973:
970:
967:
964:
961:
958:
955:
952:
949:
946:
943:
940:
937:
934:
931:
928:
925:
922:
919:
916:
913:
910:
907:
904:
901:
898:
895:
892:
889:
886:
883:
880:
877:
874:
871:
868:
865:
862:
859:
856:
853:
850:
847:
844:
841:
838:
835:
832:
813:
805:
801:
792:
783:
755:
563:durative actions
498:control function
185:constant objects
21:
2407:
2406:
2402:
2401:
2400:
2398:
2397:
2396:
2377:
2376:
2375:
2374:
2365:
2363:
2359:
2354:
2353:
2349:
2323:
2318:
2317:
2313:
2301:
2296:
2295:
2291:
2279:
2274:
2273:
2269:
2257:
2252:
2251:
2247:
2235:
2230:
2229:
2225:
2213:
2208:
2207:
2203:
2191:
2186:
2185:
2181:
2169:
2164:
2163:
2159:
2147:
2142:
2141:
2137:
2083:
2078:
2077:
2073:
2061:
2056:
2055:
2051:
2039:
2034:
2033:
2029:
2015:
2014:
2010:
1998:
1993:
1992:
1988:
1976:
1971:
1970:
1966:
1954:
1949:
1948:
1944:
1936:
1925:
1920:
1919:
1915:
1881:
1876:
1875:
1871:
1849:
1840:
1839:
1835:
1828:
1801:
1800:
1796:
1784:
1779:
1778:
1774:
1764:
1762:
1754:
1753:
1749:
1739:
1737:
1736:. Planning.wiki
1731:
1730:
1726:
1716:
1714:
1706:
1705:
1701:
1689:
1684:
1683:
1679:
1659:
1658:
1651:
1641:
1639:
1630:
1629:
1622:
1617:
1612:
1611:
1608:
1605:
1602:
1599:
1596:
1593:
1590:
1587:
1584:
1581:
1578:
1575:
1572:
1569:
1566:
1563:
1560:
1557:
1554:
1551:
1548:
1545:
1542:
1539:
1536:
1533:
1530:
1527:
1524:
1521:
1518:
1515:
1512:
1509:
1506:
1503:
1500:
1497:
1494:
1491:
1488:
1485:
1482:
1479:
1476:
1473:
1470:
1467:
1464:
1461:
1458:
1455:
1452:
1449:
1446:
1443:
1440:
1437:
1434:
1431:
1428:
1425:
1422:
1419:
1416:
1413:
1410:
1407:
1404:
1402:strips-gripper2
1401:
1398:
1395:
1392:
1389:
1383:
1382:
1379:
1376:
1373:
1370:
1367:
1364:
1361:
1358:
1355:
1352:
1349:
1346:
1343:
1340:
1337:
1334:
1331:
1328:
1325:
1322:
1319:
1316:
1313:
1310:
1307:
1304:
1301:
1298:
1295:
1292:
1289:
1286:
1283:
1280:
1277:
1274:
1271:
1268:
1265:
1262:
1259:
1256:
1253:
1250:
1247:
1244:
1241:
1238:
1235:
1232:
1229:
1226:
1223:
1220:
1217:
1214:
1211:
1208:
1205:
1202:
1199:
1196:
1193:
1190:
1187:
1184:
1181:
1178:
1175:
1172:
1169:
1166:
1163:
1160:
1157:
1154:
1151:
1148:
1145:
1142:
1139:
1136:
1133:
1130:
1127:
1124:
1121:
1118:
1115:
1112:
1109:
1106:
1103:
1100:
1097:
1094:
1091:
1088:
1085:
1082:
1079:
1076:
1073:
1070:
1067:
1064:
1061:
1058:
1055:
1052:
1049:
1046:
1043:
1040:
1037:
1034:
1031:
1028:
1025:
1022:
1019:
1016:
1013:
1010:
1007:
1004:
1001:
998:
995:
992:
989:
986:
983:
980:
977:
974:
971:
968:
965:
962:
959:
956:
953:
950:
947:
944:
941:
938:
935:
932:
929:
926:
923:
920:
917:
914:
911:
908:
905:
902:
899:
896:
893:
890:
887:
884:
881:
878:
875:
872:
869:
866:
863:
860:
857:
854:
851:
848:
845:
842:
839:
836:
833:
830:
820:
811:
803:
799:
790:
781:
753:
731:
684:
652:
605:
567:data-structures
506:
477:modal operators
450:
398:
366:
361:
337:
317:
289:
269:
242:
212:
163:
112:
107:
56:
28:
23:
22:
15:
12:
11:
5:
2405:
2403:
2395:
2394:
2389:
2379:
2378:
2373:
2372:
2347:
2311:
2289:
2267:
2245:
2223:
2201:
2179:
2157:
2135:
2113:10.1.1.75.6792
2071:
2049:
2027:
2008:
1986:
1964:
1942:
1939:on 2016-10-12.
1913:
1869:
1863:10.1.1.51.9941
1833:
1826:
1794:
1772:
1747:
1724:
1699:
1677:
1671:10.1.1.15.5965
1649:
1619:
1618:
1616:
1613:
1414:gripper-strips
1388:
843:gripper-strips
829:
819:
816:
730:
727:
683:
680:
651:
648:
632:reward fluents
604:
601:
543:type inference
525:Drew McDermott
505:
502:
449:
446:
427:rather than a
397:
394:
365:
362:
360:
357:
336:
333:
329:object-fluents
316:
313:
288:
285:
268:
265:
241:
238:
111:
108:
106:
103:
55:
52:
44:Drew McDermott
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
2404:
2393:
2390:
2388:
2385:
2384:
2382:
2358:
2351:
2348:
2342:
2337:
2333:
2329:
2322:
2315:
2312:
2307:
2300:
2293:
2290:
2285:
2278:
2271:
2268:
2263:
2256:
2249:
2246:
2241:
2234:
2227:
2224:
2219:
2212:
2205:
2202:
2197:
2190:
2183:
2180:
2175:
2168:
2161:
2158:
2153:
2146:
2139:
2136:
2131:
2127:
2123:
2119:
2114:
2109:
2104:
2099:
2095:
2091:
2090:
2082:
2075:
2072:
2067:
2060:
2053:
2050:
2045:
2038:
2031:
2028:
2023:
2019:
2012:
2009:
2004:
1997:
1990:
1987:
1982:
1975:
1968:
1965:
1960:
1953:
1946:
1943:
1935:
1931:
1924:
1917:
1914:
1909:
1905:
1901:
1897:
1893:
1889:
1888:
1880:
1873:
1870:
1864:
1859:
1855:
1848:
1844:
1837:
1834:
1829:
1823:
1819:
1815:
1811:
1810:Springer Cham
1807:
1806:
1798:
1795:
1790:
1783:
1776:
1773:
1761:
1757:
1751:
1748:
1735:
1732:Green, Adam.
1728:
1725:
1713:
1709:
1703:
1700:
1695:
1688:
1681:
1678:
1672:
1667:
1663:
1656:
1654:
1650:
1638:
1634:
1627:
1625:
1621:
1614:
1386:
1254::precondition
1080::precondition
969::precondition
827:
825:
817:
815:
809:
796:
788:
779:
775:
771:
767:
763:
759:
751:
747:
743:
739:
735:
728:
726:
724:
720:
716:
712:
708:
704:
700:
696:
692:
688:
681:
679:
677:
672:
668:
664:
660:
656:
649:
647:
645:
641:
637:
633:
629:
625:
621:
617:
614:robabilistic
613:
609:
602:
600:
598:
594:
593:
589:, the use of
588:
584:
580:
577:for actions,
576:
575:return-values
572:
568:
564:
560:
556:
552:
551:level 1 types
548:
547:level 0 types
544:
540:
539:
538:λ-expressions
534:
530:
526:
522:
518:
515:ntology with
514:
510:
503:
501:
499:
495:
490:
486:
482:
478:
474:
470:
466:
462:
458:
454:
447:
445:
442:
438:
434:
430:
429:propositional
426:
422:
418:
414:
410:
406:
402:
395:
393:
391:
387:
383:
379:
375:
371:
363:
358:
356:
354:
350:
346:
342:
334:
332:
330:
326:
322:
314:
312:
310:
306:
302:
298:
294:
286:
284:
282:
278:
274:
266:
264:
262:
258:
254:
253:
247:
239:
237:
235:
231:
227:
223:
219:
215:
210:
206:
202:
201:preconditions
198:
194:
190:
186:
182:
178:
174:
170:
166:
161:
157:
153:
149:
145:
140:
136:
132:
128:
124:
121:
117:
109:
104:
102:
100:
95:
93:
89:
85:
81:
77:
72:
70:
64:
62:
53:
51:
49:
45:
41:
37:
33:
19:
2364:. Retrieved
2350:
2334:(8): 27–47.
2331:
2327:
2314:
2305:
2292:
2283:
2270:
2261:
2248:
2239:
2226:
2217:
2204:
2195:
2182:
2173:
2160:
2151:
2138:
2093:
2087:
2074:
2065:
2052:
2043:
2030:
2021:
2011:
2002:
1989:
1980:
1967:
1958:
1945:
1934:the original
1929:
1916:
1891:
1885:
1872:
1853:
1836:
1804:
1797:
1775:
1763:. Retrieved
1750:
1738:. Retrieved
1727:
1715:. Retrieved
1702:
1680:
1661:
1640:. Retrieved
1384:
821:
812::multi-agent
786:
777:
773:
769:
757:
754::multi-agent
745:
741:
737:
733:
732:
710:
702:
698:
694:
690:
686:
685:
675:
670:
666:
662:
658:
654:
653:
639:
636:goal rewards
635:
631:
627:
615:
611:
607:
606:
597:semantic web
590:
586:
582:
578:
574:
570:
566:
562:
558:
555:level 2 type
554:
550:
546:
536:
532:
528:
520:
516:
512:
508:
507:
497:
493:
484:
480:
476:
472:
468:
464:
460:
456:
452:
451:
436:
424:
419:anguage) is
416:
412:
408:
404:
400:
399:
389:
385:
381:
377:
373:
369:
367:
338:
328:
318:
304:
296:
290:
280:
276:
270:
260:
257:plan-metrics
256:
249:
243:
233:
229:
225:
221:
218:problem-name
217:
213:
208:
204:
200:
196:
192:
188:
184:
176:
173:requirements
172:
168:
164:
155:
151:
138:
134:
130:
129:the related
126:
122:
119:
113:
96:
73:
65:
57:
35:
31:
29:
2096:: 235–297.
1843:Howe, Adele
1236::parameters
1062::parameters
954::parameters
852::predicates
669:reparation
519:olymorphic
305:preferences
301:modal-logic
234:goal-states
222:domain-name
169:domain-name
2381:Categories
2366:2015-11-28
1894:: 61–124.
1765:5 February
1740:5 February
1717:5 February
1642:5 February
1615:References
693:elational
592:namespaces
529:ontologies
489:speech act
415:efinition
197:parameters
189:predicates
88:ontologies
2108:CiteSeerX
2103:1110.2200
1858:CiteSeerX
1666:CiteSeerX
559:processes
370:processes
1528:at-robby
1423::objects
1377:?gripper
1356:?gripper
1317:at-robby
1308:?gripper
1293:?gripper
1248:?gripper
1221:?gripper
1182:?gripper
1158:?gripper
1143:at-robby
1119:?gripper
1074:?gripper
1044:at-robby
1026:at-robby
1005:at-robby
894:at-robby
808:PPDDL1.0
661:bstract
467:lanning
250:numeric
54:Overview
2130:5730335
1908:1397894
1516:gripper
1504:gripper
1411::domain
1399:problem
1326::effect
1290:gripper
1230::action
1164::effect
1116:gripper
1056::action
1014::effect
948::action
882:gripper
818:Example
795:PDDL3.1
791::typing
762:PDDL3.1
750:PDDL3.1
734:MA-PDDL
729:MA-PDDL
701:iagram
351:or the
341:PDDL3.1
315:PDDL3.1
287:PDDL3.0
267:PDDL2.2
252:fluents
240:PDDL2.1
226:objects
205:effects
193:actions
110:PDDL1.2
61:example
2128:
2110:
1906:
1860:
1824:
1760:GitHub
1712:GitHub
1668:
1393:define
840:domain
834:define
824:STRIPS
411:omain
374:events
343:. The
156:output
146:or in
2360:(PDF)
2324:(PDF)
2302:(PDF)
2280:(PDF)
2258:(PDF)
2236:(PDF)
2214:(PDF)
2192:(PDF)
2170:(PDF)
2148:(PDF)
2126:S2CID
2098:arXiv
2084:(PDF)
2062:(PDF)
2040:(PDF)
1999:(PDF)
1977:(PDF)
1955:(PDF)
1937:(PDF)
1926:(PDF)
1904:S2CID
1882:(PDF)
1850:(PDF)
1785:(PDF)
1690:(PDF)
1606:roomb
1603:ball1
1594::goal
1585:rooma
1582:ball2
1570:rooma
1567:ball1
1555:right
1531:rooma
1519:right
1495:ball2
1483:ball1
1471:roomb
1459:rooma
1450::init
1441:right
1435:ball2
1432:ball1
1429:roomb
1426:rooma
1380:)))))
1371:carry
1344:?room
1320:?room
1302:carry
1281:?room
1245:?room
1203:?room
1176:carry
1146:?room
1134:?room
1107:?room
1071:?room
1047:?from
1008:?from
984:?from
960:?from
933:carry
744:gent
740:ulti
608:PPDDL
603:PPDDL
579:links
463:gent
459:ulti-
364:PDDL+
152:input
1822:ISBN
1767:2024
1742:2024
1719:2024
1644:2024
1552:free
1543:left
1540:free
1507:left
1492:ball
1480:ball
1468:room
1456:room
1438:left
1374:?obj
1353:free
1341:?obj
1305:?obj
1278:room
1269:?obj
1266:ball
1242:?obj
1233:drop
1224:))))
1218:free
1200:?obj
1179:?obj
1155:free
1131:?obj
1104:room
1095:?obj
1092:ball
1068:?obj
1059:pick
1050:))))
993:room
981:room
951:move
921:free
870:ball
858:room
802:and
782:lift
766:MAPL
746:PDDL
717:and
687:RDDL
682:RDDL
665:lan
655:APPL
650:APPL
622:and
616:PDDL
561:and
483:and
453:MAPL
448:MAPL
421:NASA
401:NDDL
396:NDDL
372:and
323:and
203:and
125:and
36:PDDL
30:The
2336:doi
2118:doi
1896:doi
1814:doi
1609:)))
1365:not
1332:and
1260:and
1212:not
1191:not
1170:and
1086:and
1038:not
1029:?to
1020:and
996:?to
975:and
963:?to
814:).
707:7th
624:5th
620:4th
599:).
509:OPT
504:OPT
441:SAT
407:ew
390:(3)
386:(2)
382:(1)
325:7th
321:6th
293:5th
273:4th
246:3rd
214:(2)
181:OOP
165:(1)
139:(2)
135:(1)
127:(2)
120:(1)
116:2nd
2383::
2332:10
2330:.
2326:.
2304:.
2282:.
2260:.
2238:.
2216:.
2194:.
2172:.
2150:.
2124:.
2116:.
2106:.
2094:27
2092:.
2086:.
2064:.
2042:.
2020:.
2001:.
1979:.
1957:.
1928:.
1902:.
1892:20
1890:.
1884:.
1852:.
1820:.
1812:.
1808:.
1787:.
1758:.
1710:.
1692:.
1664:.
1652:^
1635:.
1623:^
1600:at
1588:))
1579:at
1564:at
1338:at
1323:))
1206:))
1197:at
1161:))
1128:at
1011:))
942:))
939:?g
936:?o
924:?g
912:?r
909:?b
906:at
897:?r
885:?g
873:?b
861:?r
585:,
573:,
569:,
355:.
2369:.
2344:.
2338::
2286:.
2264:.
2220:.
2132:.
2120::
2100::
2068:.
2046:.
2024:.
2005:.
1910:.
1898::
1866:.
1830:.
1816::
1791:.
1769:.
1744:.
1721:.
1696:.
1674:.
1646:.
1597:(
1591:(
1576:(
1573:)
1561:(
1558:)
1549:(
1546:)
1537:(
1534:)
1525:(
1522:)
1513:(
1510:)
1501:(
1498:)
1489:(
1486:)
1477:(
1474:)
1465:(
1462:)
1453:(
1447:(
1444:)
1420:(
1417:)
1408:(
1405:)
1396:(
1390:(
1368:(
1362:(
1359:)
1350:(
1347:)
1335:(
1329:(
1314:(
1311:)
1299:(
1296:)
1287:(
1284:)
1275:(
1272:)
1263:(
1257:(
1251:)
1239:(
1227:(
1215:(
1209:(
1194:(
1188:(
1185:)
1173:(
1167:(
1152:(
1149:)
1140:(
1137:)
1125:(
1122:)
1113:(
1110:)
1101:(
1098:)
1089:(
1083:(
1077:)
1065:(
1053:(
1041:(
1035:(
1032:)
1023:(
1017:(
1002:(
999:)
990:(
987:)
978:(
972:(
966:)
957:(
945:(
930:(
927:)
918:(
915:)
903:(
900:)
891:(
888:)
879:(
876:)
867:(
864:)
855:(
849:(
846:)
837:(
831:(
742:A
738:M
736:(
703:L
699:D
695:D
691:R
689:(
671:L
667:P
663:P
659:A
657:(
612:P
610:(
521:T
517:P
513:O
511:(
469:L
465:P
461:A
457:M
455:(
431:/
417:L
413:D
409:D
405:N
403:(
211:.
34:(
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.