Utilizing Problem Structure in Planning : A Local Search Approach / by Jörg Hoffmann.

Format:

Book

Author/Creator:

Hoffmann, J. (Jörg), author.

Contributor:

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science. Lecture notes in artificial intelligence ; 2854.

Lecture Notes in Artificial Intelligence ; 2854

Language:

English

Subjects (All):

Artificial intelligence.

Algorithms.

Artificial Intelligence.

Algorithm Analysis and Problem Complexity.

Local Subjects:

Artificial Intelligence.

Algorithm Analysis and Problem Complexity.

Physical Description:

1 online resource (XVIII, 254 pages).

Edition:

First edition 2003.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.

System Details:

text file PDF

Summary:

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.

Contents:

Planning: Motivation, Definitions, Methodology

1: Introduction

2: Planning

A Local Search Approach

3: Base Architecture

4: Dead Ends

5: Goal Orderings

6: The AIPS-2000 Competition

Local Search Topology

7: Gathering Insights

8: Verifying the h?+? Hypotheses

9: Supporting the hFF Hypotheses

10: Discussion

Appendix A: Formalized Benchmark Domains

Appendix B: Automated Instance Generation.

Other Format:

Printed edition:

ISBN:

978-3-540-39607-9

9783540396079

Access Restriction:

Restricted for use by site license.