On the Complexity of Case-Based Planning

Details On the Complexity of Case-Based Planning On the Complexity of Case-Based Planning

2004-07-15

arxiv.org/abs/cs/0407034v1

Computer Science

Artificial Intelligence

Scientific paper

We analyze the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. We prove that planning from a single case has the same complexity than generative planning (i.e., planning "from scratch"); using an extended definition of cases, complexity is reduced if the domain stored in the case is similar to the one to search plans for. Planning from a library of cases is shown to have the same complexity. In both cases, the complexity of planning remains, in the worst case, PSPACE-complete.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Case-Based Planning 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 On the Complexity of Case-Based Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Case-Based Planning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-570521