Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T18:50:31.622Z Has data issue: false hasContentIssue false

On complexity and motion planning for co-rank one sub-Riemannian metrics

Published online by Cambridge University Press:  15 October 2004

Cutberto Romero-Meléndez
Affiliation:
Laboratoire d'Analyse Appliquée et Optimisation, Département de Mathématiques, Université de Bourgogne, 21078 Dijon, France.
Jean Paul Gauthier
Affiliation:
Departement Maths, Lab. LE2I, UMR CNRS 5158, Université de Bourgogne, BP 47870, 21078 Dijon, France.
Felipe Monroy-Pérez
Affiliation:
Basic Sciences Department, UAM-Azcapotzalco, 02200, México D.F., Mexico; fmp@correo.azc.uam.mx.
Get access

Abstract

In this paper, we study the motion planning problem for generic sub-Riemannian metrics of co-rank one. We give explicit expressions for the metric complexity (in the sense of Jean [CITE]), in terms of the elementary invariants of the problem. We construct asymptotic optimal syntheses. It turns out that among the results we show, the most complicated case is the 3-dimensional. Besides the generic C ∞ case, we study some non-generic generalizations in the analytic case.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable