Chrpa, Lukáš, McCluskey, T.L. and Osborne, Hugh (2012) Reformulating Planning Problems: A Theoretical Point of View. In: Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference. AAAI Press, Palo Alto, CA. ISBN 978-1-57735-558-8
|PDF - Accepted Version |
Restricted to Registered users only
Automated planning is a well studied research topic thanks to its wide range of real-world applications. Despite significant progress in this area many planning problems still remain hard and challenging. Some techniques such as learning macro-operators improve the planning process by reformulating the (original)
planning problem. While many encouraging practical results have been derived from such reformulation methods, little attention has been paid to the theoretical properties of reformulation such as soundness, completeness, and algorithmic complexity. In this paper we build up a theoretical framework describing reformulation schemes such as action elimination or creating macro-actions. Using this framework, we show that finding entanglements (relationships useful for action elimination) is as hard as planning itself. Moreover, we design a tractable algorithm for checking under what conditions it
is safe to reformulate a problem by removing primitive operators (assembled to a macro-operator).
|Item Type:||Book Chapter|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Schools:||School of Computing and Engineering|
School of Computing and Engineering > Informatics Research Group > Knowledge Engineering and Intelligent Interfaces
|Depositing User:||Lukas Chrpa|
|Date Deposited:||05 Apr 2012 15:00|
|Last Modified:||10 Aug 2012 16:31|
Downloader CountriesMore statistics for this item...
Item control for Repository Staff only: