Utilizing Problem Structure in Planning [[electronic resource] ] : A Local Search Approach / / by Jörg Hoffmann
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Autore: |
Hoffmann Jörg
|
| Titolo: |
Utilizing Problem Structure in Planning [[electronic resource] ] : A Local Search Approach / / by Jörg Hoffmann
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Edizione: | 1st ed. 2003. |
| Descrizione fisica: | 1 online resource (XVIII, 254 p.) |
| Disciplina: | 006.3/33 |
| Soggetto topico: | Artificial intelligence |
| Algorithms | |
| Artificial Intelligence | |
| Algorithm Analysis and Problem Complexity | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | 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. |
| Sommario/riassunto: | 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. |
| Titolo autorizzato: | Utilizing problem structure in planning |
| ISBN: | 3-540-39607-1 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465795203316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Artificial Intelligence ; ; 2854