Gregory, Peter, Long, Derek, McNulty, Craig and Murphy, Susanne M. (2011) Exploiting Path Refinement Abstraction in Domain Transition Graphs. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011. AAAI Press, California, USA, 971 - 976. ISBN 978-1-57735-507-6Metadata only available from this repository.
Partial Refinement A-Star (PRA�) is an abstraction technique,
based on clustering nearby nodes in graphs, useful
in large path-planning problems. Abstracting the underlying
graph yields a simpler problem whose solution can be
used, by refinement, as a guide to a solution to the original
problem. A fruitful way to view domain independent planning
problems is as a collection of multi-valued variables that
must perform synchronised transitions through graphs of possible
values, where the edges are defined by the domain actions.
Planning involves finding efficient paths through Domain
Transition Graphs (DTGs). In problems where these
graphs are large, planning can be prohibitively expensive. In
this paper we explore two ways to exploit PRA� in DTGs.
|Item Type:||Book Chapter|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Schools:||School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge|
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
School of Computing and Engineering
|Depositing User:||Peter Gregory|
|Date Deposited:||10 Jan 2012 10:58|
|Last Modified:||14 Feb 2012 11:16|
Repository Staff Only: item control page