Complexity of nonholonomic motion planning
From MaRDI portal
Publication:3151582
DOI10.1080/00207170010017392zbMath1017.68138OpenAlexW2138137563MaRDI QIDQ3151582
Publication date: 16 October 2002
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207170010017392
Automated systems (robots, etc.) in control theory (93C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Related Items
Entropy estimations for motion planning problems in robotics ⋮ Controllability of mechanical systems near a degeneration subset of nonholonomic constraints ⋮ On the motion planning problem, complexity, entropy, and nonholonomic interpolation ⋮ Degeneration of nonholonomic constraints and Ferrers equations ⋮ Complexity of Control-Affine Motion Planning ⋮ On certain hyperelliptic signals that are natural controls for nonholonomic motion planning ⋮ High-order sufficient conditions for configuration tracking of affine connection control systems ⋮ On the codimension one motion planning problem ⋮ On the one-step-Bracket-Generating motion planning problem ⋮ Entropy and complexity of a path in sub-Riemannian geometry ⋮ On complexity and motion planning for co-rank one sub-Riemannian metrics ⋮ On polynomial vector fields having a given affine variety as attractive and invariant set: application to robotics
