Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies

Authors:
Lukáš Chrpa;Roman Barták
Affiliations:
Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic;Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic
Venue:
Proceedings of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008
Year:
2008

Citing 4
Cited 1

Automatically generating abstractions for planning

Artificial Intelligence
Complexity results for standard benchmark domains in planning

Artificial Intelligence
Planning as Heuristic Search: New Results

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice

Review:

The Knowledge Engineering Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are a lot of planning techniques for solving planning problems and many of them solve the planning problems by 'brute force' even though some problems (or parts of them) are easy. An easy planning problem typically has a plan with a specific structure. The structure described in this paper is based on action dependencies that appear in plans. We are looking for such constraints that are in the plan structures that provide algorithms running in polynomial time.