ENGLISH

Utilizing Problem Structure in Planning: A Local Search Approach

By Jörg Hoffmann (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2003
ISBN
978-3-540-20259-2, 978-3-540-39607-9
DOI
10.1007/b93903
Language
english
Format
PDF
Filesize
3 MB (3215933 bytes)
Series
Lecture Notes in Computer Science 2854
Edition
1
Pages
254\257
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Artificial Intelligence (incl. Robotics); Algorith

Description

Planning is a crucial skill for any autonomous agent, be it a physically embedded agent, such as a robot, or a purely simulated software agent. For this reason, planning, as a central research area of artificial intelligence from its beginnings, has gained even more attention and importance recently. After giving a general introduction to AI planning, the book describes and carefully evaluates the algorithmic techniques used in fast-forward planning systems (FF), demonstrating their excellent performance in many wellknown benchmark domains. In advance, an original and detailed investigation identifies the main patterns of structure which cause the performance of FF, categorizing planning domains in a taxonomy of different classes with respect to their aptitude for being solved by heuristic approaches, such as FF. As shown, the majority of the planning benchmark domains lie in classes which are easy to solve.

Similar books