• Login
    View Item 
    •   DSpace Home
    • English resources
    • Technology
    • View Item
    •   DSpace Home
    • English resources
    • Technology
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Utilizing Problem Structure in Planning: A Local Search Approach

    Thumbnail
    View/Open
    Utilizing-Problem-Structure-in-Planning-1409.pdf (2.682Mb)
    Date
    2003
    Author
    Hoffmann, Jörg
    Metadata
    Show full item record
    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.
    URI
    https://lib.hpu.edu.vn/handle/123456789/32783
    Collections
    • Technology [3206]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy Submit DateThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Submit Date

    My Account

    LoginRegister

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV