Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition (Lecture Notes in Computer Science)

Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition (Lecture Notes in Computer Science) by Malte Helmert

Title: Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition (Lecture Notes in Computer Science)
Author: Malte Helmert
ISBN10: 3540777229
ISBN13: 978-3540777229
Publisher: Springer; 2008 edition (March 11, 2008)
Language: English
Subcategory: Computer Science
Size PDF: 1298 kb
Size Fb2: 1815 kb
Rating: 4.3/5
Votes: 433
Pages: 270 pages
Other Format: mbr txt doc docx

Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition (Lecture Notes in Computer Science) by Malte Helmert


pdf epub fb2 djvu



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 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. Not only that, but it also provides an in-depth analysis of so-called routing and transportation problems.