Utilizing Problem Structure in Planning [electronic resource] : A Local Search Approach /

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.

Bibliographic Details

Main Authors:	Hoffmann, Jörg. author., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 2003
Subjects:	Computer science., Algorithms., Artificial intelligence., Computer Science., Artificial Intelligence (incl. Robotics)., Algorithm Analysis and Problem Complexity.,
Online Access:	http://dx.doi.org/10.1007/b93903
Tags:	Add Tag No Tags, Be the first to tag this record!