000 03650nam a22005895i 4500
001 978-3-540-77723-6
003 DE-He213
005 20240730201127.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540777236
_9978-3-540-77723-6
024 7 _a10.1007/978-3-540-77723-6
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
100 1 _aHelmert, Malte.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9166067
245 1 0 _aUnderstanding Planning Tasks
_h[electronic resource] :
_bDomain Complexity and Heuristic Decomposition /
_cby Malte Helmert.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXIV, 270 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4929
505 0 _aPlanning Benchmarks -- The Role of Benchmarks -- Defining Planning Domains -- The Benchmark Suite -- Transportation and Route Planning -- IPC Domains: Transportation and Route Planning -- IPC Domains: Others -- Conclusions -- Fast Downward -- Solving Planning Tasks Hierarchically -- Translation -- Knowledge Compilation -- Search -- Experiments -- Discussion.
520 _aAction planning has always played a central role in Artificial Intelligence. Given a description of the current situation, a description of possible actions and a description of the goals to be achieved, the task is to identify a sequence of actions, i.e., a plan that transforms the current situation into one that satisfies the goal description. This monograph is a revised version of Malte Helmert's doctoral thesis, Solving Planning Tasks in Theory and Practice, written under the supervision of Professor Bernhard Nebel as thesis advisor at Albert-Ludwigs-Universität Freiburg, Germany, in 2006. The book contains an exhaustive analysis of the computational complexity of the benchmark problems that have been used in the past decade, namely the standard benchmark domains of the International Planning Competitions (IPC). At the same time, it contributes to the practice of solving planning tasks by presenting a powerful new approach to heuristic planning. The author also provides an in-depth analysis of so-called routing and transportation problems. All in all, this book will contribute significantly to advancing the state of the art in automatic planning.
650 0 _aArtificial intelligence.
_93407
650 0 _aAlgorithms.
_93390
650 0 _aComputer science.
_99832
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aMathematical statistics.
_99597
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aAlgorithms.
_93390
650 2 4 _aTheory of Computation.
_9166068
650 2 4 _aProbability and Statistics in Computer Science.
_931857
710 2 _aSpringerLink (Online service)
_9166069
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540777229
776 0 8 _iPrinted edition:
_z9783540847250
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4929
_9166070
856 4 0 _uhttps://doi.org/10.1007/978-3-540-77723-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c96379
_d96379