Movement problems for 2-dimensional linkages
SIAM Journal on Computing
The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Planning, geometry, and complexity of robot motion
Planning, geometry, and complexity of robot motion
Motion planning among time dependent obstacles
Acta Informatica
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Retraction: A new approach to motion-planning
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Reachability by paths of bounded curvature in convex polygons
Proceedings of the sixteenth annual symposium on Computational geometry
Time-minimal paths amidst moving obstacles in three dimensions
Theoretical Computer Science
Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths
International Journal of Robotics Research
Offline variants of the "lion and man" problem
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Offline variants of the “lion and man” problem
Theoretical Computer Science
Maximum thick paths in static and dynamic environments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Maximum thick paths in static and dynamic environments
Computational Geometry: Theory and Applications
Collision Avoidance between Avatars of Real and Virtual Individuals
MIG '09 Proceedings of the 2nd International Workshop on Motion in Games
Multicriteria tunnel computation
CGIM '08 Proceedings of the Tenth IASTED International Conference on Computer Graphics and Imaging
Safe obstacle avoidance for industrial robot working without fences
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Kinematics-based characterization of the collision course
International Journal of Robotics and Automation
Algorithms and theory of computation handbook
Reachability by paths of bounded curvature in a convex polygon
Computational Geometry: Theory and Applications
Conflict Detection and Resolution Method for Cooperating Unmanned Aerial Vehicles
Journal of Intelligent and Robotic Systems
Safe distributed motion coordination for second-order systems with different planning cycles
International Journal of Robotics Research
Sixth sense transport: challenges in supporting flexible time travel
Proceedings of the Twelfth Workshop on Mobile Computing Systems & Applications
Proceedings of the 1st International Conference on Application and Theory of Automation in Command and Control Systems
Hi-index | 0.01 |
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 that uses time to encode configurations (whereas previous lower bound proofs in robotic motion planning 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 that we call asteroid avoidance problems: B, the object we wish to move, is a convex polyhedron that 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, where B is a moving polygon and we assume a constant number of obstacles, as well as single exponential time or polynomial space algorithms for the 3-D asteroid avoidance problem, where B is a convex polyhedron and there are arbitrarily many obstacles. Our techniques for solving these asteroid avoidance problems use “normal path” arguments, which are an intereting generalization of techniques previously used to solve static shortest path problems. 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.