This study presents an enhanced variant of the Rapidly Exploring Random Tree (RRT) algorithm tailored for efficient local path planning in autonomous vehicles. Building upon foundational RRT principles, the proposed algorithm integrates novel modifications to improve search efficiency during the sampling phase. These enhancements include the use of advanced techniques for obstacle detection and selective sampling. Additionally, factors such as the actual vehicle size and surrounding obstacles are considered during the expansion phase. The enhanced algorithm was rigorously evaluated through extensive simulations conducted in three distinct autonomous driving scenarios. The results demonstrate significant improvements over RRT, RRT*, and A-RRT* across several indicators: computational cost is reduced by up to 78%, planning time by 64% to 78%, and trajectory cost is minimized by more than 97%. In addition, path smoothness is significantly improved, with sharp turns and unplanned detours reduced. This research contributes to advancing autonomous vehicle technology by providing a versatile and reliable solution to local path-planning challenges.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    An Improved RRT Algorithm for Efficient Local Path Planning in Autonomous Vehicles

    Abdouni, Jawad / Jarou, Tarik / Waga, Abderrahim et al. | Springer Verlag | 2025


    Local Path Planning for Autonomous Vehicles: Crash Mitigation

    Wang, Hong / Huang, Yanjun / Khajepour, Amir et al. | IEEE | 2018


    LOCAL PATH PLANNING FOR AUTONOMOUS VEHICLES: CRASH MITIGATION

    Wang, Hong / Huang, Yanjun / Khajepour, Amir et al. | British Library Conference Proceedings | 2018


    Hybrid Energy-Efficient Local Path Planning for Autonomous Vehicles in Dynamic Environments

    Tarhini, Fadel / Talj, Reine / Doumiati, Moustapha | IEEE | 2024