Movement Planning in the Presence of Flows
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
New lower bound techniques for robot motion planning problems
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Intentional motion on-line learning and prediction
Machine Vision and Applications
Timed trajectory generation using dynamical systems: Application to a Puma arm
Robotics and Autonomous Systems
A maneuvering-board approach to path planning with moving obstacles
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
An architecture for multirobot motion coordination
RA '07 Proceedings of the 13th IASTED International Conference on Robotics and Applications
Collision avoidance in dynamic environments: an ICS-based solution and its comparative evaluation
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A path planning method for dynamic object closure by using random caging formation testing
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Guaranteeing safety in spatially situated agents
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
This paper investigates the computational complexity of planning the motion of a body B in 2-D or 3-D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3-D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACE-hard if B is given a velocity modulus bound on its movements and is NP hard even if B has no velocity modulus bound, where in both cases B has 6 degrees of freedom. To prove these results we use a unique method of simulation of a Turing machine which uses time to encode configurations (whereas previous lower bound proofs in robotics used the system position to encode configurations and so required unbounded number of degrees of freedom). We also investigate a natural class of dynamic problems which we call asteroid avoidance problems: B, the object we wish to move, is a convex polyhedron which is free to move by translation with bounded velocity modulus, and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance. Our main positive results are polynomial time algorithms for the 2-D asteroid avoidance problem with bounded number of obstacles as well as single exponential time and nO(log n) space algorithms for the 3-D asteroid avoidance problem with an unbounded number of obstacles. Our techniques for solving these asteroid avoidance problems are novel in the sense that they are completely unrelated to previous algorithms for planning movement in the case of static obstacles. We also give some additional positive results for various other dynamic movers problems, and in particular give polynomial time algorithms for the case in which B has no velocity bounds and the movements of obstacles are algebraic in space-time.