On complexity and motion planning for co-rank one sub-riemannian metrics
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 [10, 11]), 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 case, we study some non-generic generalizations in the analytic case.