Complexity of control-affine motion planning
arXiv:1309.2571 · doi:10.1137/130950793
Abstract
In this paper we study the complexity of the motion planning problem for control-affine systems. Such complexities are already defined and rather well-understood in the particular case of nonholonomic (or sub-Riemannian) systems. Our aim is to generalize these notions and results to systems with a drift. Accordingly, we present various definitions of complexity, as functions of the curve that is approximated, and of the precision of the approximation. Due to the lack of time-rescaling invariance of these systems, we consider geometric and parametrized curves separately. Then, we give some asymptotic estimates for these quantities.
arXiv comment28 pages, 5 figures
References in corpus (4)
- Time Minimal Trajectories for a Spin 1/2 Particle in a Magnetic Field
- Approximate controllability, exact controllability, and conical eigenvalue intersections for quantum mechanical systems
- Resonance of Minimizers for -level Quantum Systems with an Arbitrary Cost
- Hölder equivalence of the value function for control-affine systems