Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time
Currently, regardless of the algorithm used, motion planners for dealing with dynamic obstructions need to rely on high-precision sensors and high performance processors. The requirements for hardware increase as the density of dynamic obstructions in an area becomes higher. Additionally, motion pla...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Robotics |
| Online Access: | http://dx.doi.org/10.1155/2024/1592587 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832544099201187840 |
|---|---|
| author | H. S. Zhen W. A. Kang X. Y. Liu Z. L. Wei |
| author_facet | H. S. Zhen W. A. Kang X. Y. Liu Z. L. Wei |
| author_sort | H. S. Zhen |
| collection | DOAJ |
| description | Currently, regardless of the algorithm used, motion planners for dealing with dynamic obstructions need to rely on high-precision sensors and high performance processors. The requirements for hardware increase as the density of dynamic obstructions in an area becomes higher. Additionally, motion planners are more prone to errors in complex environments. The Rapidly-exploring Random Tree (RRT ∗) algorithm only considers static obstructions and cannot effectively avoid densely populated regions of dynamic obstructions. This paper develops an improved RRT ∗ algorithm that is capable of avoiding densely populated regions of dynamic obstructions. In this algorithm, the cost function of the traditional RRT ∗ algorithm is modified based on the density of dynamic obstructions, allowing the planned path to bypass densely populated regions. The algorithm also introduces reasonable penalty terms to penalize segments that pass through densely populated regions, while maintaining asymptotic optimality of the traditional RRT ∗ algorithm. Numerical experiments reveal that the improved RRT ∗ algorithm is able to successfully avoid densely populated regions of dynamic obstructions with minimal time cost and exhibits better robustness during the path search process in comparison to the traditional RRT ∗ algorithm. Thus, the improved RRT ∗ algorithm possesses the ability to adapt to more complex areas for path planning. |
| format | Article |
| id | doaj-art-f85321980767455abac029d076ffc51f |
| institution | Kabale University |
| issn | 1687-9619 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Robotics |
| spelling | doaj-art-f85321980767455abac029d076ffc51f2025-02-03T10:59:59ZengWileyJournal of Robotics1687-96192024-01-01202410.1155/2024/1592587Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel TimeH. S. Zhen0W. A. Kang1X. Y. Liu2Z. L. Wei3The Mechanical and Electrical Engineering CollegeThe Mechanical and Electrical Engineering CollegeThe Mechanical and Electrical Engineering CollegeThe Mechanical and Electrical Engineering CollegeCurrently, regardless of the algorithm used, motion planners for dealing with dynamic obstructions need to rely on high-precision sensors and high performance processors. The requirements for hardware increase as the density of dynamic obstructions in an area becomes higher. Additionally, motion planners are more prone to errors in complex environments. The Rapidly-exploring Random Tree (RRT ∗) algorithm only considers static obstructions and cannot effectively avoid densely populated regions of dynamic obstructions. This paper develops an improved RRT ∗ algorithm that is capable of avoiding densely populated regions of dynamic obstructions. In this algorithm, the cost function of the traditional RRT ∗ algorithm is modified based on the density of dynamic obstructions, allowing the planned path to bypass densely populated regions. The algorithm also introduces reasonable penalty terms to penalize segments that pass through densely populated regions, while maintaining asymptotic optimality of the traditional RRT ∗ algorithm. Numerical experiments reveal that the improved RRT ∗ algorithm is able to successfully avoid densely populated regions of dynamic obstructions with minimal time cost and exhibits better robustness during the path search process in comparison to the traditional RRT ∗ algorithm. Thus, the improved RRT ∗ algorithm possesses the ability to adapt to more complex areas for path planning.http://dx.doi.org/10.1155/2024/1592587 |
| spellingShingle | H. S. Zhen W. A. Kang X. Y. Liu Z. L. Wei Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time Journal of Robotics |
| title | Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time |
| title_full | Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time |
| title_fullStr | Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time |
| title_full_unstemmed | Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time |
| title_short | Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time |
| title_sort | avoiding dense pedestrian regions a new rapidly exploring random tree rrt ∗ algorithm for shortest travel time |
| url | http://dx.doi.org/10.1155/2024/1592587 |
| work_keys_str_mv | AT hszhen avoidingdensepedestrianregionsanewrapidlyexploringrandomtreerrtalgorithmforshortesttraveltime AT wakang avoidingdensepedestrianregionsanewrapidlyexploringrandomtreerrtalgorithmforshortesttraveltime AT xyliu avoidingdensepedestrianregionsanewrapidlyexploringrandomtreerrtalgorithmforshortesttraveltime AT zlwei avoidingdensepedestrianregionsanewrapidlyexploringrandomtreerrtalgorithmforshortesttraveltime |