LEADER 04376nam  22007215  450 
001 996465286803316
005 20200704083010.0
010   $a3-540-77723-7
024 7 $a10.1007/978-3-540-77723-6
035   $a(CKB)1000000000491063
035   $a(SSID)ssj0000320573
035   $a(PQKBManifestationID)11213048
035   $a(PQKBTitleCode)TC0000320573
035   $a(PQKBWorkID)10249243
035   $a(PQKB)11254559
035   $a(DE-He213)978-3-540-77723-6
035   $a(MiAaPQ)EBC3062163
035   $a(MiAaPQ)EBC6281063
035   $a(PPN)12374346X
035   $a(EXLCZ)991000000000491063
100   $a20100301d2008      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aUnderstanding Planning Tasks$b[electronic resource] $eDomain Complexity and Heuristic Decomposition /$fby Malte Helmert
205   $a1st ed. 2008.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008.
215   $a1 online resource (XIV, 270 p.) 
225 1 $aLecture Notes in Artificial Intelligence ;$v4929
300   $a"Revised version of Malte Helmert's doctoral thesis, Solving planning tasks in theory and practice, written ... at Albert-Ludwigs-Universita?t Freiburg, Germany, in 2006"p. [4] of cover.
311   $a3-540-77722-9 
320   $aIncludes bibliographical references and index.
327   $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.
330   $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.
410  0$aLecture Notes in Artificial Intelligence ;$v4929
606   $aArtificial intelligence
606   $aAlgorithms
606   $aComputers
606   $aMathematical statistics
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aProbability and Statistics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17036
615  0$aArtificial intelligence.
615  0$aAlgorithms.
615  0$aComputers.
615  0$aMathematical statistics.
615 14$aArtificial Intelligence.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aComputation by Abstract Devices.
615 24$aProbability and Statistics in Computer Science.
676   $a006.3
700   $aHelmert$b Malte$4aut$4http://id.loc.gov/vocabulary/relators/aut$0508833
701   $aHelmert$b Malte$0508833
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465286803316
996   $aUnderstanding Planning Tasks$9774400
997   $aUNISA