Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/009285864/catalog> ?p ?o. }

• catalog abstract "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.".
• catalog contributor b13104142.
• catalog created "2003.".
• catalog date "2003".
• catalog date "2003.".
• catalog dateCopyrighted "2003.".
• catalog description "Includes bibliographical references and index.".
• catalog 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.".
• catalog description "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.".
• catalog extent "xiii, 251 p. :".
• catalog identifier "3540202595 (alk. paper)".
• catalog isPartOf "Lecture notes in computer science ; 2854.".
• catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 2385. Lecture notes in artificial intelligence".
• catalog isPartOf "Lecture notes in computer science. Lecture notes in artificial intelligence.".
• catalog issued "2003".
• catalog issued "2003.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer-Verlag,".
• catalog subject "006.3/33 22".
• catalog subject "Artificial intelligence.".
• catalog subject "Computer science.".
• catalog subject "Computer software.".
• catalog subject "Planning Methodology.".
• catalog subject "Problem solving.".
• catalog subject "Proof theory.".
• catalog subject "QA63 .H64 2003".
• catalog tableOfContents "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.".
• catalog title "Utilizing problem structure in planning : a local search approach / Jörg Hoffmann.".
• catalog type "text".