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.
Definition - PLANSAT
denote the following decision problem. Given a STRIPS task (P, A, I, G), is the task solvable?
PLANSAT is PSPACE-complete. Proof in see [Bylander, 1994]
Let Bounded-PLANSAT denote the following decision problem. Given a STRIPS task
(P, A, I, G)
and an integer
. Is there a plan with at most
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License