Structural Patterns of Tractable Sequentially-Optimal Planning

We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting numerous structural characteristics of planning problems, and a constructive proof technique that connects between certain tools from planning and tractable constraint optimization. In particular, we believe that structure-based tractability results of this kind may help devising new admissible search heuristics. We discuss the prospects of this direction along a principled extension of pattern-database heuristics to “structural patterns” of unlimited dimensionality.

• Type: Conference
• Year: 2007
• Where: AIPS
• Authors: Michael Katz, Carmel Domshlak
• Keywords: Admissible Search Heuristics, AIPS 2007, Artificial Intelligence, Numerous Structural Characteristics, Sequentially-optimal Classical Planning