This paper introduces a geometric algorithm for Continuous Collision Detection (CCD). It can be used for so-called Dubins paths, which are composed of arcs and straight lines. The CCD approach checks for an overlap between the area covered by the vehicle during a full arc and the polytopic obstacles. Previous work has already demonstrated the potential benefits over other methods, which perform collision checks at discrete sample points along the path. Compared to the previous CCD implementation, the proposed geometric algorithm requires only on elementary functions and does not depend on external libraries, e.g., for numerical optimization. A numerical study demonstrates the numerical speed-up, for elementary collision checks and in combination with a basic Rapidly-exploring Random Tree (RRT) path planner.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Continuous Collision Detection Algorithm for Dubins Paths


    Contributors:


    Publication date :

    2023-06-04


    Size :

    1392652 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Lateral Interception of Maneuvering Targets Using Dubins Paths

    G, Akhil / Ratnoo, Ashwini / Ghose, Debasish | AIAA | 2015




    Shortest Dubins Paths to Intercept a Target Moving on a Circle

    Gupta Manyam, Satyanarayana / Casbeer, David W. / Von Moll, Alexander et al. | AIAA | 2022


    Lateral Interception of Maneuvering Targets Using Dubins Paths (AIAA 2015-0339)

    Gopalan, Akhil / Ratnoo, Ashwini / Ghose, Debasish | British Library Conference Proceedings | 2015