Rapidly-exploring Random Tree (RRT) is a prominent algorithm with quite successful results in achieving the optimal solution used to solve robot path planning problems. The RRT algorithm works by creating iteratively progressing random waypoints from the initial waypoint to the goal waypoint. The critical problem in the robot movement is the movement and time costs caused by the excessive number of waypoints required to be able to reach the goal, which is why reducing the number of waypoints created after path planning is an important process in solving the robot path problem. Ramer-Douglas-Peucker (RDP) is an effective algorithm to reduce waypoints. In this study, the Waypoint Simplified and Smoothed RRT Method (WSS-RRT) is proposed which reduces the distance costs between 8.13% and 13.36% by using the RDP algorithm to reduce the path into the same path with fewer waypoints, which is an array of waypoints created by the RRT algorithm.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Simplified and Smoothed Rapidly-Exploring Random Tree Algorithm for Robot Path Planning


    Beteiligte:
    Gültekin, Ayhan (Autor:in) / Diri, Samet (Autor:in) / Becerikli, Yaşar (Autor:in)

    Erscheinungsdatum :

    2023-01-01


    Anmerkungen:

    Tehnički vjesnik ; ISSN 1330-3651 (Print) ; ISSN 1848-6339 (Online) ; Volume 30 ; Issue 3


    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629




    Real-Time Directed Rapidly Exploring Random Tree Path Planning for Air Collision Avoidance

    Lee, Minkyu / Noh, Geemoon / Park, Jihoon et al. | AIAA | 2022


    3D Path Planning of Autonomous Underwater Vehicles Using a Rapidly-exploring Random Trees Algorithm

    Arifi, Ali / Lepagnot, Julien / Bouallegue, Soufiene et al. | IEEE | 2023


    Simultaneous Learning and Planning using Rapidly Exploring Random Tree* and Reinforcement Learning

    Sadhu, Arup Kumar / Shukla, Shubham / Sortee, Sarvesh et al. | IEEE | 2021


    Information-Rich Path Planning with General Constraints using Rapidly-Exploring Random Trees

    Levine, D. / Luders, B. / How, J. et al. | British Library Conference Proceedings | 2010