Chrpa, Lukáš and Bartak, Roman (2009) Reformulating Planning Problems by Eliminating Unpromising Actions. In: Proceedings, the Eighth Symposium on Abstraction, Reformulation and Approximation. Symposium on Abstraction, Reformulation and Approximation (SARA 2009) . AAAI Press, California, USA, pp. 50-57. ISBN 9781577354338Metadata only available from this repository.
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions is exploiting knowledge engineering techniques such as (re)formulating the planning problem to be easier to solve for existing planners. In particular, it is possible to automatically gather knowledge from toy planning problems and exploit this knowledge when solving more complex planning problems. In this paper we propose a method for eliminating some actions from the problem specification that are often useless or may mislead the planners. The method detects if actions are somehow connected with the initial or goal predicates and by using this information we suggest that some actions are not necessary when solving the planning problem. To eliminate these actions we modify the planning domain and hence the method remains independent of used planning system.
|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:||14 Feb 2012 11:32|
|Last Modified:||27 Jun 2013 10:51|
Item control for Repository Staff only: