On complexity and motion planning for co-rank one sub-Riemannian metrics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2003

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

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 F. Jean), 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[infinite] case, we study some non-generic generalizations in the analytic case.
Fichier principal
Vignette du fichier
RR-4882.pdf (343.62 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071701 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071701 , version 1

Cite

C. Romero-Meléndez, J.P. Gauthier, Felipe Monroy-Pérez. On complexity and motion planning for co-rank one sub-Riemannian metrics. RR-4882, INRIA. 2003. ⟨inria-00071701⟩
78 View
17115 Download

Share

Gmail Facebook Twitter LinkedIn More