2000 character limit reached
A geometric approach to shortest bounded curvature paths
Published 19 Mar 2014 in math.MG and math.GT | (1403.4899v2)
Abstract: Consider two elements in the tangent bundle of the Euclidean plane $(x,X),(y,Y)\in T{\mathbb R}2$. In this work we address the problem of characterizing the paths of bounded curvature and minimal length starting at $x$, finishing at $y$ and having tangents at these points $X$ and $Y$ respectively. This problem was first investigated in the late 50's by Lester Dubins. In this note we present a constructive proof of Dubins' result giving special emphasis on the geometric nature of this problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.