Collision Detection for Moving Polyhedra
IEEE Transactions on Pattern Analysis and Machine Intelligence
Intractable problems in control theory
SIAM Journal on Control and Optimization
A search algorithm for motion planning with six degrees of freedom
Artificial Intelligence
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Robot Analysis and Control
Robot Motion: Planning and Control
Robot Motion: Planning and Control
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators
Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds
Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds
Real-time robot motion planning using rasterizing computer graphics hardware
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Journal of the ACM (JACM)
On information invariants in robotics
Artificial Intelligence
| Hi-index | 0.00 |
We consider the following problem: given a robot system, find a minimal-time trajectory from a start state to a goal state, while avoiding obstacles by a speed-dependent safety margin and respecting dynamics bounds. In [CDRX] we developed a provably good approximation algorithm for the minimum-time trajectory problem for a robot system with decoupled dynamics bounds. This algorithm differed from previous work in three ways: it is possible (1) to bound the goodness of the approximation by an error term &egr; (2) to polynomially bound the running time (complexity) of our algorithm; and (3) to express the complexity as a polynomial function of the error term.We extend these results to d-link, revolute-joint 3D robots will full rigid body dynamics. Specifically, we first prove a generalized trajectory-tracking lemma for robots with coupled dynamics bounds. Using this result we describe polynomial-time approximation algorithms for Cartesian robots obeying L2 dynamics bounds and open kinematic chain manipulators with revolute and prismatic joints; the latter class includes most industrial manipulators. We obtain a general &Ogr;(n2 (log n)(1/&egr;6d-1) algorithm, where n is the geometric complexity. The algorithm is simple, but the new game-theoretic proof techniques we introduce are subtle, and employ tools from disparate parts of computational geometry, robotics, and dynamical systems.