On the motion planning problem, complexity, entropy, and nonholonomic interpolation
type: Item
instance of: scholarly article
title: On the motion planning problem, complexity, entropy, and nonholonomic interpolation
zbMATH Open document ID: 1121.53025
published in: Journal of Dynamical and Control Systems
publication date: 2007-02-15T00:00:00Z
review text: A general motion planning problem from robotics is defined by a triple \((\Delta, \, g, \, \Gamma)\) which consists of: 1 a distribution \(\Delta\) over \(\mathbb{R}^{n}\) of a certain co-rank \(p\) which represents the admissible motion (the kinematic constrains) of the robot; 2 a Riemannian metric \(g\) over \(\Delta\) providing a sub-Riemannian metric structure \(d\) to measure the length of admissible curves; 3 a smooth non-admissible curve \(\Gamma : [0,1] \rightarrow \mathbb{R}^{n}\). The paper under review deals with the sub-Riemannian motion planning problem defined by a sub-Riemannian metric and a non-admissible curve to be \(\varepsilon\)-approximated in the sub-Riemannian sense by a trajectory of the robot. It is shown that the metric complexity \(MC\) and the entropy \(E\) characterize the \(\varepsilon\)-optimality of the approximation. The main results of the paper are as follows: a) For generic one-step bracket-generating problems, when the co-rank is at most \(3\), the entropy is related to the complexity by \(E=2 \pi MC\). b) The entropy in the special \(2\)-step bracket-generating case is computed. c) It is shown that the formula for entropy which is valid up to co-rank \(3\) changes in a wild case of co-rank \(6\): it has to be multiplied by a factor which is at most \(3/2\).
reviewed by: Adrian Sandovici
Mathematics Subject Classification ID: 53C17
Mathematics Subject Classification ID: 49J15
Mathematics Subject Classification ID: 34H05
Mathematics Subject Classification ID: 58A15
zbMATH DE Number: 5127405
zbMATH Keywords: robotics
zbMATH Keywords: sub-Riemannian gometry
zbMATH Keywords: entropy
zbMATH Keywords: metric complexity
author: Jean-Paul Gauthier
author: V. M. Zakalyukin
MaRDI profile type: Publication
full work available at URL: s10450-006-0005-y
OpenAlex ID: W2014373684
cites work: Q4258204
cites work: Sub-Riemannian metrics and isoperimetric problems in the contact case
cites work: Quasi-contact S-R metrics: Normal form in \(\mathbb{R}^{2n}\), wave front and caustic in \(\mathbb{R}^4\)
cites work: Small sub-Riemannian balls on \(\mathbf R^3\)
cites work: Optimization and nonsmooth analysis
cites work: On complexity and motion planning for co-rank one sub-Riemannian metrics
cites work: On the codimension one motion planning problem
cites work: On the one-step-Bracket-Generating motion planning problem
cites work: Q4718347
cites work: Complexity of nonholonomic motion planning
cites work: Entropy and complexity of a path in sub-Riemannian geometry
cites work: Measures of transverse paths in sub-Riemannian geometry
cites work: Q5844404
DOI: 10.1007/S10450-006-0005-Y
description: scientific article; zbMATH DE number 5127405