Cantitate/Preț
Produs

Utilizing Problem Structure in Planning: A Local Search Approach: Lecture Notes in Computer Science, cartea 2854

Autor Jörg Hoffmann
en Limba Engleză Paperback – 10 oct 2003
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33125 lei

Preț vechi: 41407 lei
-20% Nou

Puncte Express: 497

Preț estimativ în valută:
6339 6578$ 5298£

Carte tipărită la comandă

Livrare economică 17-31 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540202592
ISBN-10: 3540202595
Pagini: 268
Ilustrații: XVIII, 254 p.
Dimensiuni: 155 x 233 x 14 mm
Greutate: 0.39 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.