Output details
11 - Computer Science and Informatics
Teesside University
Return to search
Output 0 of 0 in the submission
Output title
Exploiting path refinement abstraction in domain transition graphs
Type
E - Conference contribution
DOI
-
Name of conference/published proceedings
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence
Volume number
-
Issue number
-
First page of article
971
ISSN of proceedings
-
Year of publication
2011
Number of additional authors
3
Additional information
<22> Despite huge advances in the practical applicability of planning technology, scalability of planning technology remains a problem. This work generalizes abstraction approaches in path planning to domain independent planning, demonstrating that it is possible to solve planning problems with very large underlying maps without a large increase in search cost. Since many natural planning domains (computer games, robot task-planning) require path planning as a sub-component, this work has potential for great practical impact.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
