Paramètres
- 251pages
- 9 heures de lecture
En savoir plus sur le livre
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.
Achat du livre
Utilizing problem structure in planning, Jörg Hoffmann
- Langue
- Année de publication
- 2003
- product-detail.submit-box.info.binding
- (souple)
Modes de paiement
Personne n'a encore évalué .
- Titre
- Utilizing problem structure in planning
- Sous-titre
- A Local Search Approach
- Langue
- Anglais
- Auteurs
- Jörg Hoffmann
- Éditeur
- Springer
- Publié
- 2003
- Format
- souple
- Pages
- 251
- ISBN10
- 3540202595
- ISBN13
- 9783540202592
- Séries
- Mots clés
- Informatique & Internet, Mathématiques, Relations, Enquête, Intelligence Artificielle, Planification, Méthodologie, Résolution de problèmes, Algorithmes
- 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.