Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071701
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:34:05 PM
Last modification on : Saturday, January 27, 2018 - 1:31:25 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:24:00 PM

Identifiers

  • HAL Id : inria-00071701, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

186

Files downloads

223