Reparametrization of 3D CSC Dubins Paths Enabling 2D Search

This paper addresses the Dubins path planning problem for vehicles in 3D space. In particular, we consider the problem of computing CSC paths -- paths that consist of a circular arc (C) followed by a straight segment (S) followed by a circular arc (C). These paths are useful for vehicles such as fix...

Full description

Saved in:
Bibliographic Details
Main Authors Xu, Ling, Baryshnikov, Yuliy, Sung, Cynthia
Format Journal Article
LanguageEnglish
Published 13.03.2025
Subjects
Computer Science - Robotics
Online AccessGet full text
DOI10.48550/arxiv.2503.11560

Cover

More Information
Summary:This paper addresses the Dubins path planning problem for vehicles in 3D space. In particular, we consider the problem of computing CSC paths -- paths that consist of a circular arc (C) followed by a straight segment (S) followed by a circular arc (C). These paths are useful for vehicles such as fixed-wing aircraft and underwater submersibles that are subject to lower bounds on turn radius. We present a new parameterization that reduces the 3D CSC planning problem to a search over 2 variables, thus lowering search complexity, while also providing gradients that assist that search. We use these equations with a numerical solver to explore numbers and types of solutions computed for a variety of planar and 3D scenarios. Our method successfully computes CSC paths for the large majority of test cases, indicating that it could be useful for future generation of robust, efficient curvature-constrained trajectories.
DOI:10.48550/arxiv.2503.11560