• Login
    View Item 
    •   DSpace@RPI Home
    • Tetherless World Constellation
    • Tetherless World Publications
    • View Item
    •   DSpace@RPI Home
    • Tetherless World Constellation
    • Tetherless World Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Using Planning Graphs for Solving HTN Planning Problems

    Author
    Lotem, Amnon; Hendler, Jim
    Thumbnail
    Other Contributors
    Date Issued
    1999-01-01
    Degree
    Terms of Use
    Metadata
    Show full item record
    URI
    http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai99.html#LotemNH99; https://hdl.handle.net/20.500.13015/4835
    Abstract
    In this paper we present the GraphHTN algorithm, a hybrid planning algorithm that does Hierarchical Task-Network (HTN) planning using a combination of HTN-style problem reduction and Graphplan-style planning-graph generation. We also present experimental results comparing GraphHTN with ordinary HTN decomposition (as implemented in the UMCP planner) and ordinary Graphplan search (as implemented in the IPP planner). Our experimental results show that (1) the performance of HTN planning can be improved significantly by using planning graphs, and (2) that planning with planning graphs can be sped up by exploiting HTN control knowledge.;
    Department
    Relationships
    Access
    Collections
    • Tetherless World Publications

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV