# Entropy and complexity of a path in sub-Riemannian geometry

ESAIM: Control, Optimisation and Calculus of Variations (2010)

- Volume: 9, page 485-508
- ISSN: 1292-8119

## Access Full Article

top## Abstract

top## How to cite

topJean, Frédéric. "Entropy and complexity of a path in sub-Riemannian geometry." ESAIM: Control, Optimisation and Calculus of Variations 9 (2010): 485-508. <http://eudml.org/doc/90707>.

@article{Jean2010,

abstract = {
We characterize the geometry of a path in a sub-Riemannian manifold
using two metric invariants, the entropy and the complexity.
The entropy of a subset A of a metric space is the minimum number of
balls of a given radius ε needed to cover A.
It allows one to compute the Hausdorff dimension in some cases and
to bound it from above in general.
We define the complexity of a path in a sub-Riemannian manifold as the
infimum of the lengths of all trajectories contained in an
ε-neighborhood of the path, having the same extremities as the
path.
The concept of complexity for paths was first developed to model the
algorithmic complexity of the nonholonomic motion planning problem in
robotics. In this paper, our aim is to estimate the entropy, Hausdorff dimension and
complexity for a path in a general sub-Riemannian manifold.
We construct first a norm $\| \cdot \|_\{\varepsilon\}$ on the tangent space
that depends on a parameter ε > 0.
Our main result states then that the entropy of a path is equivalent to the
integral of this ε-norm along the path.
As a corollary we obtain upper and lower bounds for the Hausdorff
dimension of a path.
Our second main result is that complexity and entropy are equivalent
for generic paths.
We give also a computable sufficient condition on the path for this
equivalence to happen.
},

author = {Jean, Frédéric},

journal = {ESAIM: Control, Optimisation and Calculus of Variations},

keywords = {Complexity; Hausdorff
dimension; metric entropy; non-linear control; nonholonomic systems;
sub-Riemannian geometry.; Hausdorff dimension; sub-Riemannian geometry},

language = {eng},

month = {3},

pages = {485-508},

publisher = {EDP Sciences},

title = {Entropy and complexity of a path in sub-Riemannian geometry},

url = {http://eudml.org/doc/90707},

volume = {9},

year = {2010},

}

TY - JOUR

AU - Jean, Frédéric

TI - Entropy and complexity of a path in sub-Riemannian geometry

JO - ESAIM: Control, Optimisation and Calculus of Variations

DA - 2010/3//

PB - EDP Sciences

VL - 9

SP - 485

EP - 508

AB -
We characterize the geometry of a path in a sub-Riemannian manifold
using two metric invariants, the entropy and the complexity.
The entropy of a subset A of a metric space is the minimum number of
balls of a given radius ε needed to cover A.
It allows one to compute the Hausdorff dimension in some cases and
to bound it from above in general.
We define the complexity of a path in a sub-Riemannian manifold as the
infimum of the lengths of all trajectories contained in an
ε-neighborhood of the path, having the same extremities as the
path.
The concept of complexity for paths was first developed to model the
algorithmic complexity of the nonholonomic motion planning problem in
robotics. In this paper, our aim is to estimate the entropy, Hausdorff dimension and
complexity for a path in a general sub-Riemannian manifold.
We construct first a norm $\| \cdot \|_{\varepsilon}$ on the tangent space
that depends on a parameter ε > 0.
Our main result states then that the entropy of a path is equivalent to the
integral of this ε-norm along the path.
As a corollary we obtain upper and lower bounds for the Hausdorff
dimension of a path.
Our second main result is that complexity and entropy are equivalent
for generic paths.
We give also a computable sufficient condition on the path for this
equivalence to happen.

LA - eng

KW - Complexity; Hausdorff
dimension; metric entropy; non-linear control; nonholonomic systems;
sub-Riemannian geometry.; Hausdorff dimension; sub-Riemannian geometry

UR - http://eudml.org/doc/90707

ER -

## References

top- A. Bellaïche, The tangent space in sub-Riemannian geometry, edited by A. Bellaïche and J.-J. Risler, Sub-Riemannian Geometry. Birkhäuser, Progr. Math. (1996).
- A. Bellaïche, F. Jean and J.-J. Risler, Geometry of nonholonomic systems, edited by J.-P. Laumond, Robot Motion Planning and Control. Springer, Lecture Notes Inform. Control Sci. 229 (1998).
- A. Bellaïche, J.-P. Laumond and J. Jacobs, Controllability of car-like robots and complexity of the motion planning problem, in International Symposium on Intelligent Robotics. Bangalore, India (1991) 322-337.
- J.F. Canny, The Complexity of Robot Motion Planning. MIT Press (1988).
- W.L. Chow, Über Systeme von linearen partiellen Differentialgleichungen erster Ordnung. Math. Ann.117 (1940) 98-115.
- G. Comte and Y. Yomdin, Tame geometry with applications in smooth analysis. Preprint of the IHP-RAAG Network (2002).
- M. Gromov, Carnot-Carathéodory spaces seen from within, edited by A. Bellaïche and J.-J. Risler, Sub-Riemannian Geometry. Birkhäuser, Progr. Math. (1996).
- W. Hurewicz and H. Wallman, Dimension Theory. Princeton University Press, Princeton (1948).
- F. Jean, Paths in sub-Riemannian geometry, edited by A. Isidori, F. Lamnabhi-Lagarrigue and W. Respondek, Nonlinear Control in the Year 2000. Springer-Verlag (2000).
- F. Jean, Complexity of nonholonomic motion planning. Int. J. Control74 (2001) 776-782.
- F. Jean, Uniform estimation of sub-Riemannian balls. J. Dynam. Control Systems7 (2001) 473-500.
- A.N. Kolmogorov, On certain asymptotics characteristics of some completely bounded metric spaces. Soviet Math. Dokl.108 (1956) 385-388.
- I. Kupka, Géométrie sous-riemannienne, in Séminaire N. Bourbaki, Vol. 817 (1996).
- J.-P. Laumond, Controllability of a multibody mobile robot. IEEE Trans. Robotics Automation9 (1993) 755-763.
- J.-P. Laumond, S. Sekhavat and F. Lamiraux, Guidelines in nonholonomic motion planning for mobile robots, edited by J.-P. Laumond, Robot Motion Planning and Control. Springer, Lecture Notes Inform. Control Sci. 229 (1998).
- J. Mitchell, On Carnot-Carathéodory metrics. J. Differential Geom.21 (1985) 35-45.
- T. Nagano, Linear differential systems with singularities and an application to transitive Lie algebras. J. Math. Soc. Japan18 (1966) 398-404.
- J.T. Schwartz and M. Sharir, On the ``piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math.4 (1983) 298-351.
- H.J. Sussmann, An extension of theorem of Nagano on transitive Lie algebras. Proc. Amer. Math. Soc.45 (1974) 349-356.
- A.M. Vershik and V.Ya. Gershkovich, Nonholonomic dynamical systems, geometry of distributions and variational problems, edited by V.I. Arnold and S.P. Novikov, Dynamical Systems VII. Springer, Encyclopaedia Math. Sci. 16 (1994).

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.