03402nam 22005655 450 991014402630332120200701173119.03-540-39607-110.1007/b93903(CKB)1000000000212231(SSID)ssj0000327517(PQKBManifestationID)11245711(PQKBTitleCode)TC0000327517(PQKBWorkID)10301908(PQKB)11374831(DE-He213)978-3-540-39607-9(MiAaPQ)EBC3087791(PPN)155174134(EXLCZ)99100000000021223120121227d2003 u| 0engurnn|008mamaatxtccrUtilizing Problem Structure in Planning[electronic resource] A Local Search Approach /by Jörg Hoffmann1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (XVIII, 254 p.) Lecture Notes in Artificial Intelligence ;2854Bibliographic Level Mode of Issuance: Monograph3-540-20259-5 Includes bibliographical references and index.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.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.Lecture Notes in Artificial Intelligence ;2854Artificial intelligenceAlgorithmsArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Artificial intelligence.Algorithms.Artificial Intelligence.Algorithm Analysis and Problem Complexity.006.3/33Hoffmann Jörgauthttp://id.loc.gov/vocabulary/relators/aut564758BOOK9910144026303321Utilizing problem structure in planning955105UNINA