Task and Motion Planning Is PSPACE-Complete
We present a new representation for task and motion planning that uses constraints to capture both continuous and discrete phenomena in a unified framework. We show that we can decide if a feasible plan exists for a given problem instance using only polynomial space if the constraints are semialgebr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Association for the Advancement of Artificial Intelligence (AAAI)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/130570 |