ENGLISH

Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition

By Malte Helmert (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2008
ISBN
3540777229, 9783540777229
DOI
10.1007/978-3-540-77723-6
ISSN
0302-9743
Open Library ID
OL16751351M
Language
english
Format
PDF
Filesize
2 MB (1998791 bytes)
Series
Lecture Notes in Computer Science 4929 : Lecture Notes in Artificial Intelligence
Edition
1
Pages
270\273
Topic
Economy
Library
Kolxo3
Scanned
yes
Time added
2010-02-05 01:51:52
Artificial Intelligence (incl. Robotics); Algorith

Description

Action 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.

Similar books