Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 4929 : Lecture Notes in Artificial Intelligence

ISBN: 3540777229, 9783540777229

Size: 2 MB (1998791 bytes)

Pages: 270/273

File format:

Language:

Publishing Year:

Category: Tags: , , ,

Malte Helmert (auth.)3540777229, 9783540777229

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.


Table of contents :
Front Matter….Pages –
Front Matter….Pages 1-1
The Role of Benchmarks….Pages 3-12
Defining Planning Domains….Pages 13-30
The Benchmark Suite….Pages 31-37
Transportation and Route Planning….Pages 39-73
IPC Domains: Transportation and Route Planning….Pages 75-112
IPC Domains: Others….Pages 113-149
Conclusions….Pages 151-154
Front Matter….Pages 155-155
Solving Planning Tasks Hierarchically….Pages 157-170
Translation….Pages 171-206
Knowledge Compilation….Pages 207-222
Search….Pages 223-237
Experiments….Pages 239-251
Discussion….Pages 253-258
Back Matter….Pages –

Reviews

There are no reviews yet.

Be the first to review “Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition”
Shopping Cart
Scroll to Top