Shortest Paths to Obstacles for a Polygonal Dubins Car

In this paper, we characterize the time-optimal trajectories leading a Dubins car in collision with the obstacles in its workspace. Due to the constant velocity constraint characterizing the Dubins car model, these trajectories form a sufficient set of shortest paths between any robot configuration and the obstacles in the environment. Based on these paths, we define and give the algorithm for computing a distance function that takes into account the nonholonomic constraints and captures the nonsymmetric nature of the system. The developments presented here assume that the obstacles and the robot are polygons although the methodology can be applied to different shapes.