Classification Scheme for the Three-Point Dubins Problem

This is the authors' abstract. We don't add key points for this paper.

This paper proposes an optimal path type classification scheme for the three-point Dubins problem. It allows us to directly extract the shortest path type from a Dubins set, evaluating only the relative initial and final configurations with the via point position using a suitable partition of the Cartesian plane. Two alternative approaches are proposed to address the problem: an analytical approach and a heuristic one. The latter is revealed to be much faster from a computational point of view. The proposed classification logic makes the path planning for the three-point Dubins problem much more effective and suitable for real-time applications. Numerical examples are provided to show the efficiency of the proposed strategy.