Improved Rapidly Exploring Random Tree with Bacterial Mutation and Node Deletion for Offline Path Planning of Mobile Robot
The path-planning algorithm aims to find the optimal path between the starting and goal points without collision. One of the most popular algorithms is the optimized Rapidly exploring Random Tree (RRT*). The strength of RRT* algorithm is the collision-free path. It is the main reason why RRT-based a...
Main Authors: | Aphilak Lonklang, János Botzheim |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-05-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/11/9/1459 |
Similar Items
-
A survey of path planning of industrial robots based on rapidly exploring random trees
by: Sha Luo, et al.
Published: (2023-11-01) -
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
by: Heru Suwoyo, et al.
Published: (2023-01-01) -
Toward Optimization of AGV Path Planning: An RRT<sup>*</sup>-ACO Algorithm
by: Wenjuan Wang, et al.
Published: (2024-01-01) -
Sampling-Based Path Planning Algorithm for a Plug & Produce Environment
by: Sudha Ramasamy, et al.
Published: (2023-11-01) -
Memorized Rapidly Exploring Random Tree Optimization (MRRTO): An Enhanced Algorithm for Robot Path Planning
by: Muhsen Dena Kadhim, et al.
Published: (2024-03-01)