Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Complexity and Decidability

    Definition - PLANSAT

      Let PLANSAT denote the following decision problem. Given a STRIPS task (P, A, I, G), is the task solvable?

    Theorem

      PLANSAT is PSPACE-complete. Proof in see [Bylander, 1994]

    Definition – Bounded- PLANSAT

      Let Bounded-PLANSAT denote the following decision problem. Given a STRIPS task (P, A, I, G) and an integer b . Is there a plan with at most b actions?


Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.