Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 9.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Utilizing Problem Structure in Planning

Name: Utilizing Problem Structure in Planning
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01558687
Price: 51.61 EUR
Availability: InStock
Author: J. Hoffmann
ISBN: 9783540202592

A Local Search Approach

J. Hoffmann

Language

English

Book Paperback

Libristo code: 01558687

Publishers Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, October 2003

Planning is a crucial skill for any autonomous agent, be it a physically embedded agent, such as a r... Full description

Libristo code: 01558687

125 b

51.61 €

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

101 Recetas de Jugos Y Comidas Para El Cancer Testicular JOE CORREA

Paperback

20.29 €

Azijos Receptai 2022 RYAN PARIS

Paperback

27.47 €

Steuerfahndung Wolfgang Lübke

Paperback

51.81 €

Gestion des réservations des clients de l'auberge BulSU Mayleen Dorcas Castro

Paperback

32.01 €

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 mainpatterns 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.