Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm
The Rapidly Exploring Random Tree algorithm, renowned for its randomness, asymptotic properties, and local planning capabilities, is extensively employed in autonomous driving for path planning. Addressing issues such as pronounced randomness, low search efficiency, inefficient utilization of effect...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/6/3370 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850090328098340864 |
|---|---|
| author | Wenliang Zhu Guanming Qiu |
| author_facet | Wenliang Zhu Guanming Qiu |
| author_sort | Wenliang Zhu |
| collection | DOAJ |
| description | The Rapidly Exploring Random Tree algorithm, renowned for its randomness, asymptotic properties, and local planning capabilities, is extensively employed in autonomous driving for path planning. Addressing issues such as pronounced randomness, low search efficiency, inefficient utilization of effective points, suboptimal path smoothness, and potential deviations from the optimal path in the RRT algorithm based on random sampling, we proposed an optimization algorithm that integrates Kalman filtering to eliminate redundant points along the path. Initially, this algorithm addresses the issue of inverse growth in the RRT algorithm’s search tree by implementing a variable steering angle strategy, thereby minimizing oscillations and unnecessary pose adjustments. Secondly, by merging collision detection with Kalman filtering, and by comparing the step sizes between newly generated child nodes and random tree nodes towards the root node, we filtered redundant points from the path, thereby reducing the count of effective points and optimizing the path. Lastly, we utilized a second-order Bezier curve to smoothen the path, eliminating sharp corners and discontinuities, ultimately yielding the optimal path. Across diverse map environments and two distinct dimensional scenarios, we conducted multiple sets of simulation experiments to validate the algorithm’s feasibility. The experimental outcomes demonstrate notable improvements in parameters like average path length, average planning time, average count of effective points, and average sampling points, highlighting the enhanced accuracy and efficiency of the improved algorithm in path planning. |
| format | Article |
| id | doaj-art-96044dea1c07436fbb497cd88bd661dc |
| institution | DOAJ |
| issn | 2076-3417 |
| language | English |
| publishDate | 2025-03-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj-art-96044dea1c07436fbb497cd88bd661dc2025-08-20T02:42:35ZengMDPI AGApplied Sciences2076-34172025-03-01156337010.3390/app15063370Path Planning of Intelligent Mobile Robots with an Improved RRT AlgorithmWenliang Zhu0Guanming Qiu1School of Mechanical Engineering, Jiangsu Ocean University, Cangwu Road No. 59, Lianyungang 222005, ChinaSchool of Mechanical Engineering, Jiangsu Ocean University, Cangwu Road No. 59, Lianyungang 222005, ChinaThe Rapidly Exploring Random Tree algorithm, renowned for its randomness, asymptotic properties, and local planning capabilities, is extensively employed in autonomous driving for path planning. Addressing issues such as pronounced randomness, low search efficiency, inefficient utilization of effective points, suboptimal path smoothness, and potential deviations from the optimal path in the RRT algorithm based on random sampling, we proposed an optimization algorithm that integrates Kalman filtering to eliminate redundant points along the path. Initially, this algorithm addresses the issue of inverse growth in the RRT algorithm’s search tree by implementing a variable steering angle strategy, thereby minimizing oscillations and unnecessary pose adjustments. Secondly, by merging collision detection with Kalman filtering, and by comparing the step sizes between newly generated child nodes and random tree nodes towards the root node, we filtered redundant points from the path, thereby reducing the count of effective points and optimizing the path. Lastly, we utilized a second-order Bezier curve to smoothen the path, eliminating sharp corners and discontinuities, ultimately yielding the optimal path. Across diverse map environments and two distinct dimensional scenarios, we conducted multiple sets of simulation experiments to validate the algorithm’s feasibility. The experimental outcomes demonstrate notable improvements in parameters like average path length, average planning time, average count of effective points, and average sampling points, highlighting the enhanced accuracy and efficiency of the improved algorithm in path planning.https://www.mdpi.com/2076-3417/15/6/3370automatic drivingpath planningRapidly Exploring Random Tree (RRT)Bessel curveKalman filter |
| spellingShingle | Wenliang Zhu Guanming Qiu Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm Applied Sciences automatic driving path planning Rapidly Exploring Random Tree (RRT) Bessel curve Kalman filter |
| title | Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm |
| title_full | Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm |
| title_fullStr | Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm |
| title_full_unstemmed | Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm |
| title_short | Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm |
| title_sort | path planning of intelligent mobile robots with an improved rrt algorithm |
| topic | automatic driving path planning Rapidly Exploring Random Tree (RRT) Bessel curve Kalman filter |
| url | https://www.mdpi.com/2076-3417/15/6/3370 |
| work_keys_str_mv | AT wenliangzhu pathplanningofintelligentmobilerobotswithanimprovedrrtalgorithm AT guanmingqiu pathplanningofintelligentmobilerobotswithanimprovedrrtalgorithm |