Entropy and complexity of a path in sub-Riemannian geometry

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 e 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 e -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 on the tangent space that depends on a parameter e > 0. Our main result states then that the entropy of a path is equivalent to the integral of this e -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.

[1]  Jean-Paul Laumond,et al.  Guidelines in nonholonomic motion planning for mobile robots , 1998 .

[2]  L. Goddard.  Approximation of Functions , 1965, Nature.

[3]  J. Hatzenbuhler,et al.  DIMENSION THEORY , 1997 .

[4]  Géométrie sous-riemannienne , 1996 .

[5]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[6]  Henry Hermes,et al.  Nilpotent and High-Order Approximations of Vector Field Systems , 1991, SIAM Rev..

[7]  Frédéric Jean,et al.  Geometry of nonholonomic systems , 1998 .

[8]  F. Jean.  Complexity of nonholonomic motion planning , 2001 .

[9]  A. Kolmogorov,et al.  Entropy and "-capacity of sets in func-tional spaces , 1961 .

[10]  F. Jean.  Paths in sub-Riemannian geometry , 2001 .

[11]  E. Stein,et al.  Hypoelliptic differential operators and nilpotent groups , 1976 .

[12]  Jean-Paul Laumond,et al.  Singularities and Topological Aspects in Nonholonomic Motion Planning , 1993 .

[13]  Andrew Donald Booth,et al.  Theory of the transmission and processing of information , 1961 .

[14]  J. Laumond.  Controllability of a multibody mobile robot , 1991 .

[15]  H. Sussmann.  An extension of a theorem of Nagano on transitive Lie algebras , 1974 .

[16]  G. Lorentz.  Metric entropy and approximation , 1966 .

[17]  Frédéric Jean,et al.  Uniform Estimation of Sub-Riemannian Balls , 2001 .

[18]  F. Jean.  The car with N Trailers : characterization of the singular configurations , 1996 .

[19]  T. Nagano.  Linear differential systems with singularities and an application to transitive Lie algebras , 1966 .

[20]  J. Mitchell.  On Carnot-Carathéodory metrics , 1985 .

[21]  Wei-Liang Chow.  Über Systeme von liearren partiellen Differentialgleichungen erster Ordnung , 1940 .

[22]  A. Bellaïche.  The tangent space in sub-riemannian geometry , 1994 .

[23]  M. Gromov.  Carnot-Carathéodory spaces seen from within , 1996 .

[24]  J. Laumond,et al.  NILPOTENT INFINITESIMAL APPROXIMATIONS TO A CONTROL LIE ALGEBRA , 1992 .

[25]  John Canny,et al.  The complexity of robot motion planning , 1988 .