In this paper, we propose an algorithm for optimal generation of nonholonomic paths for planning parking maneuvers with a kinematic car model. We demonstrate the use of Successive Convexification algorithms (SCvx), which guarantee path feasibility and constraint satisfaction, for parking scenarios. In addition, we formulate obstacle avoidance with state-triggered constraints which enables the use of logical constraints in a continuous formulation of optimization problems. This paper contributes to the optimal nonholonomic path planning literature by demonstrating the use of SCvx and state-triggered constraints which allows the formulation of the parking problem as a single optimisation problem. The resulting algorithm can be used to plan constrained paths with cusp points in narrow parking environments.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Autonomous Parking by Successive Convexification and Compound State Triggers


    Contributors:


    Publication date :

    2020-09-20


    Size :

    568951 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Applications of Successive Convexification in Autonomous Vehicle Planning and Control

    Boyali, Ali / Thompson, Simon / Wong, David | IEEE | 2020


    Successive Convexification for Tethered Debris Deorbiting

    Field, Liam / Hecht, Grant / Botta, Eleonora M. | AIAA | 2024


    Successive Convexification for 6-DoF Powered Descent Guidance with Compound State-Triggered Constraints

    Szmuk, Michael / Reynolds, Taylor / Acikmese, Behcet et al. | AIAA | 2019


    Successive Convexification for Mars 6-DoF Powered Descent Landing Guidance

    Szmuk, Michael / Eren, Utku / Acikmese, Behcet | AIAA | 2017