2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Recent advances in Rapidly-exploring random tree: A review

      review-article
      Heliyon
      Elsevier
      Rapidly-exploring random tree, Branching strategy improvement, Sampling strategy improvement, Post-processing, Model driven, Robot

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Path planning is an crucial research area in robotics. Compared to other path planning algorithms, the Rapidly-exploring Random Tree (RRT) algorithm possesses both search and random sampling properties, and thus has more potential to generate high-quality paths that can balance the global optimum and local optimum. This paper reviews the research on RRT-based improved algorithms from 2021 to 2023, including theoretical improvements and application implementations. At the theoretical level, branching strategy improvement, sampling strategy improvement, post-processing improvement, and model-driven RRT are highlighted, at the application level, application scenarios of RRT under welding robots, assembly robots, search and rescue robots, surgical robots, free-floating space robots, and inspection robots are detailed, and finally, many challenges faced by RRT at both the theoretical and application levels are summarized. This review suggests that although RRT-based improved algorithms has advantages in large-scale scenarios, real-time performance, and uncertain environments, and some strategies that are difficult to be quantitatively described can be designed based on model-driven RRT, RRT-based improved algorithms still suffer from the problems of difficult to design the hyper-parameters and weak generalization, and in the practical application level, the reliability and accuracy of the hardware such as controllers, actuators, sensors, communication, power supply and data acquisition efficiency all pose challenges to the long-term stability of RRT in large-scale unstructured scenarios. As a part of autonomous robots, the upper limit of RRT path planning performance also depends on the robot localization and scene modeling performance, and there are still architectural and strategic choices in multi-robot collaboration, in addition to the ethics and morality that has to be faced. To address the above issues, I believe that multi-type robot collaboration, human-robot collaboration, real-time path planning, self-tuning of hyper-parameters, task- or application-scene oriented algorithms and hardware design, and path planning in highly dynamic environments are future trends.

          Related collections

          Most cited references227

          • Record: found
          • Abstract: not found
          • Article: not found

          Randomized Kinodynamic Planning

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Sampling-based algorithms for optimal motion planning

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              RRT-connect: An efficient approach to single-query path planning

                Bookmark

                Author and article information

                Contributors
                Journal
                Heliyon
                Heliyon
                Heliyon
                Elsevier
                2405-8440
                07 June 2024
                15 June 2024
                07 June 2024
                : 10
                : 11
                : e32451
                Affiliations
                [1]School of Information Technology, Jiangsu Open University, Nanjing, 210000, China
                Article
                S2405-8440(24)08482-2 e32451
                10.1016/j.heliyon.2024.e32451
                11219357
                38961991
                7939dbfd-7b0c-4ee1-9f42-4d5db0f04188
                © 2024 The Author. Published by Elsevier Ltd.

                This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

                History
                : 5 February 2024
                : 15 May 2024
                : 4 June 2024
                Categories
                Review Article

                rapidly-exploring random tree,branching strategy improvement,sampling strategy improvement,post-processing,model driven,robot

                Comments

                Comment on this article