Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies

There are a lot of approaches for solving planning problems. Many of these approaches are based on ‘brute force‘ search methods and do not care about structures of plans previously computed in certain planning domains. By analyzing these structures we can obtain useful knowledge that can help in finding solutions for more complex planning problems. Methods described in this paper are based on analysis of action dependencies appearing in plans. This analysis provides new knowledge about the planning domain that can be passed directly to planning algorithms to improve their efficiency

[1]  Hector Geffner,et al.  Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..

[2]  Pat Langley,et al.  Learning hierarchical task networks by observation , 2006, ICML.

[3]  Lukáš Chrpa,et al.  Using of a Graph of Action Dependencies for Plans Optimization , 2007 .

[4]  Hector Geffner,et al.  Causal Theories for Nonmonotonic Reasoning , 1990, AAAI.

[5]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[6]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[7]  Craig A. Knoblock.  Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[8]  John Levine,et al.  Genetically evolved macro-actions in AI planning problems , 2005 .

[9]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

[10]  Andrew Coles,et al.  Online Identification of Useful Macro-Actions for Planning , 2007, ICAPS.

[11]  Anders Jonsson,et al.  On the Hardness of Planning Problems with Simple Causal Graphs , 2007, ICAPS.

[12]  Carmel Domshlak,et al.  Structural Patterns of Tractable Sequentially-Optimal Planning , 2007, ICAPS.

[13]  Qiang Yang,et al.  ARMS : Action-Relation Modelling System for Learning Action Models , 2005 .

[14]  Malte Helmert,et al.  New Complexity Results for Classical Planning Benchmarks , 2006, ICAPS.

[15]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[16]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[17]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[18]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[19]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..