Path planning is one of the hotspots in the research of automotive engineering. Aiming at the issue of robot path planning with the goal of finding a collision-free optimal motion path in an environment with barriers, this study proposes an adaptive parallel arithmetic optimization algorithm (APAOA) with a novel parallel communication strategy. Comparisons with other popular algorithms on 18 benchmark functions are committed. Experimental results show that the proposed algorithm performs better in terms of solution accuracy and convergence speed, and the proposed strategy can prevent the algorithm from falling into a local optimal solution. Finally, we apply APAOA to solve the problem of robot path planning.


    Access

    Download


    Export, share and cite



    Title :

    An Adaptive Parallel Arithmetic Optimization Algorithm for Robot Path Planning


    Contributors:
    Ruo-Bin Wang (author) / Wei-Feng Wang (author) / Lin Xu (author) / Jeng-Shyang Pan (author) / Shu-Chuan Chu (author)


    Publication date :

    2021




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Optimizing Robot Path Planning with the Particle Swarm Optimization Algorithm

    Falah Jaber Kshash / Ahmed Yahia Yaseen / Salam Saadoon Kals | BASE | 2023

    Free access

    Arithmetic-Trigonometric Optimization Algorithm

    Panneer Selvam, Arun Mozhi Devan / Hussin, Fawnizu Azmadi / Ibrahim, Rosdiazli et al. | Springer Verlag | 2022


    Adaptive Path Planning for Mobile Robot Obstacle Avoidance

    Rong-Jong Wai / Chia-Ming Liu | BASE | 2011

    Free access

    A Path-Planning Algorithm for Automatic Parallel Parking

    Lv, Zhenji / Zhao, Linhui / Liu, Zhiyuan | IEEE | 2013