Trending Bestseller

Utilizing Problem Structure in Planning

A Local Search Approach

No reviews yet Write a Review
Paperback / softback
10 October 2003
$121.54
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

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.

You Can Find This Title In

    Product Details
    ISBN-13
    9783540202592
    Author
    Jörg Hoffmann
    Publisher
    Springer Nature B.V.
    Published
    10 October 2003
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $121.54
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Utilizing Problem Structure in Planning

    $121.54

    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.

    You Can Find This Title In

      This Title Is Categorised As