國立虎尾科技大學 |

An introduction to the Planning Domain Definition Language /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	An introduction to the Planning Domain Definition Language // Patrik Haslum, Nir Lipovetzky, Daniele Magazzeni, Christian Muise.
Author:	Haslum, Patrik,
other author:	Lipovetzky, Nir,
Description:	1 PDF (xvii, 169 pages) :illustrations (some color). :
Notes:	Part of: Synthesis digital library of engineering and computer science.
Subject:	Artificial intelligence. -
Online resource:	https://doi.org/10.2200/S00900ED2V01Y201902AIM042
Online resource:	https://ieeexplore.ieee.org/servlet/opac?bknumber=8681776
ISBN:	9781627057370

An introduction to the Planning Domain Definition Language /
Haslum, Patrik,

An introduction to the Planning Domain Definition Language /Patrik Haslum, Nir Lipovetzky, Daniele Magazzeni, Christian Muise. - 1 PDF (xvii, 169 pages) :illustrations (some color). - Synthesis lectures on artificial intelligence and machine learning,#421939-4616 ;. - Synthesis lectures on artificial intelligence and machine learning ;29.

Part of: Synthesis digital library of engineering and computer science.

Includes bibliographical references (pages 151-163) and index.

1. Introduction -- 1.1. What is AI planning? -- 1.2. Planning models -- 1.3. Examples -- 1.4. The origins of PDDL and the scope of this book -- 1.5. Planning systems and modelling tools

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

Planning is the branch of Artificial Intelligence (AI) that seeks to automate reasoning about plans, most importantly the reasoning that goes into formulating a plan to achieve a given goal in a given situation. AI planning is model-based: a planning system takes as input a description (or model) of the initial situation, the actions available to change it, and the goal condition to output a plan composed of those actions that will accomplish the goal when executed from the initial situation. The Planning Domain Definition Language (PDDL) is a formal knowledge representation language designed to express planning models. Developed by the planning research community as a means of facilitating systems comparison, it has become a de-facto standard input language of many planning systems, although it is not the only modelling language for planning. Several variants of PDDL have emerged that capture planning problems of different natures and complexities, with a focus on deterministic problems. The purpose of this book is two-fold. First, we present a unified and current account of PDDL, covering the subsets of PDDL that express discrete, numeric, temporal, and hybrid planning. Second, we want to introduce readers to the art of modelling planning problems in this language, through educational examples that demonstrate how PDDL is used to model realistic planning problems. The book is intended for advanced students and researchers in AI who want to dive into the mechanics of AI planning, as well as those who want to be able to use AI planning systems without an in-depth explanation of the algorithms and implementation techniques they use.

Mode of access: World Wide Web.

ISBN: 9781627057370

Standard No.: 10.2200/S00900ED2V01Y201902AIM042doiSubjects--Uniform Titles:

Planning Domain Definition Language.
Subjects--Topical Terms:

559380
Artificial intelligence.
Subjects--Index Terms:

AI planning

LC Class. No.: Q335 / .H37 2019eb

Dewey Class. No.: 006.3

An introduction to the Planning Domain Definition Language /
LDR:05220nam 2200625 i 4500 001 959755
003 IEEE
005 20190503190106.0
006 m eo d
007 cr bn |||m|||a
008 201209s2019 caua fob 001 0 eng d
020 $a 9781627057370 $q electronic
020 $z 9781681735122 $q hardcover
020 $z 9781627058759 $q paperback
024 7 $a 10.2200/S00900ED2V01Y201902AIM042 $2 doi
035 $a (CaBNVSL)thg00978840
035 $a (OCoLC)1091844807
035 $a 8681776
040 $a CaBNVSL $b eng $e rda $c CaBNVSL $d CaBNVSL
050 4 $a Q335 $b .H37 2019eb
082 0 4 $a 006.3 $2 23
100 1 $a Haslum, Patrik, $e author. $3 1253077
245 1 3 $a An introduction to the Planning Domain Definition Language / $c Patrik Haslum, Nir Lipovetzky, Daniele Magazzeni, Christian Muise.
264 1 $a [San Rafael, California] : $b Morgan & Claypool, $c [2019]
300 $a 1 PDF (xvii, 169 pages) : $b illustrations (some color).
336 $a text $2 rdacontent
337 $a electronic $2 isbdmedia
338 $a online resource $2 rdacarrier
490 1 $a Synthesis lectures on artificial intelligence and machine learning, $x 1939-4616 ; $v #42
500 $a Part of: Synthesis digital library of engineering and computer science.
504 $a Includes bibliographical references (pages 151-163) and index.
505 0 $a 1. Introduction -- 1.1. What is AI planning? -- 1.2. Planning models -- 1.3. Examples -- 1.4. The origins of PDDL and the scope of this book -- 1.5. Planning systems and modelling tools
505 8 $a 2. Discrete and deterministic planning -- 2.1. Domain and problem definition -- 2.2. Plans and plan validity -- 2.3. Notes on PDDL's syntax : the strips fragment -- 2.4. Advanced modelling examples -- 2.5. Expressiveness and complexity
505 8 $a 3. More expressive classical planning -- 3.1. Conditional and quantified conditions and effects -- 3.2. Axioms -- 3.3. Preferences and plan quality -- 3.4. State trajectory constraints -- 3.5. Expressiveness and complexity
505 8 $a 4. Numeric planning -- 4.1. Numeric planning in PDDL -- 4.2. Numeric plan validity -- 4.3. More modelling examples -- 4.4. Complexity of numeric planning
505 8 $a 5. Temporal planning -- 5.1. Durative actions -- 5.2. Planning with predictable events -- 5.3. Temporal plan validity -- 5.4. Combining numeric and temporal planning
505 8 $a 6. Planning with hybrid systems -- 6.1. Continuous processes -- 6.2. Exogenous events -- 6.3. Example : the generator -- 6.4. Example : multiple-battery management -- 6.5. Plan validation in hybrid domains
505 8 $a 7. conclusion -- 7.1. Other planning PDDL-like languages -- 7.2. The future of PDDL -- A. Online PDDL resources.
506 $a Abstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 $a Compendex
510 0 $a INSPEC
510 0 $a Google scholar
510 0 $a Google book search
520 3 $a Planning is the branch of Artificial Intelligence (AI) that seeks to automate reasoning about plans, most importantly the reasoning that goes into formulating a plan to achieve a given goal in a given situation. AI planning is model-based: a planning system takes as input a description (or model) of the initial situation, the actions available to change it, and the goal condition to output a plan composed of those actions that will accomplish the goal when executed from the initial situation. The Planning Domain Definition Language (PDDL) is a formal knowledge representation language designed to express planning models. Developed by the planning research community as a means of facilitating systems comparison, it has become a de-facto standard input language of many planning systems, although it is not the only modelling language for planning. Several variants of PDDL have emerged that capture planning problems of different natures and complexities, with a focus on deterministic problems. The purpose of this book is two-fold. First, we present a unified and current account of PDDL, covering the subsets of PDDL that express discrete, numeric, temporal, and hybrid planning. Second, we want to introduce readers to the art of modelling planning problems in this language, through educational examples that demonstrate how PDDL is used to model realistic planning problems. The book is intended for advanced students and researchers in AI who want to dive into the mechanics of AI planning, as well as those who want to be able to use AI planning systems without an in-depth explanation of the algorithms and implementation techniques they use.
530 $a Also available in print.
538 $a Mode of access: World Wide Web.
538 $a System requirements: Adobe Acrobat Reader.
588 $a Title from PDF title page (viewed on May 3, 2019).
630 0 0 $a Planning Domain Definition Language. $3 1253081
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computational complexity. $3 527777
653 $a AI planning
653 $a problem modelling
653 $a classical planning
653 $a numeric planning
653 $a temporal planning
653 $a hybrid planning
700 1 $a Lipovetzky, Nir, $e author. $3 1253078
700 1 $a Magazzeni, Daniele, $e author. $3 1253079
700 1 $a Muise, Christian, $e author. $3 1253080
776 0 8 $i Print version: $z 9781681735122 $z 9781627058759
830 0 $a Synthesis lectures on artificial intelligence and machine learning ; $v 29 $3 1136768
830 0 $a Synthesis digital library of engineering and computer science. $3 598254
856 4 0 $3 Abstract with links to full text $u https://doi.org/10.2200/S00900ED2V01Y201902AIM042
856 4 2 $3 Abstract with links to resource $u https://ieeexplore.ieee.org/servlet/opac?bknumber=8681776