The Complexity of Planning Problems With Simple Causal Graphs

Details The Complexity of Planning Problems With Simple Causal Graphs The Complexity of Planning Problems With Simple Causal Graphs

2011-10-31

arxiv.org/abs/1111.0056v1

Journal Of Artificial Intelligence Research, Volume 31, pages 319-351, 2008

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.2432

We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state variables and acyclic causal graphs. This implies that plan generation may be tractable even when a planning problem has an exponentially long minimal solution. We also prove that the problem of plan existence for planning problems with multi-valued variables and chain causal graphs is NP-hard. Finally, we show that plan existence for planning problems with binary state variables and polytree causal graphs is NP-complete.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Planning Problems With Simple Causal Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Planning Problems With Simple Causal Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Planning Problems With Simple Causal Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466765