Application of the Improved Rapidly Exploring Random Tree Algorithm to an Insect-like Mobile Robot in a Narrow Environment

Author:

Wang Lina12ORCID,Yang Xin1,Chen Zeling1,Wang Binrui1

Affiliation:

1. College of Mechanical and Electrical Engineering, China Jiliang University, Hangzhou 310018, China

2. Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province, China Jiliang University, Hangzhou 310018, China

Abstract

When intelligent mobile robots perform global path planning in complex and narrow environments, several issues often arise, including low search efficiency, node redundancy, non-smooth paths, and high costs. This paper proposes an improved path planning algorithm based on the rapidly exploring random tree (RRT) approach. Firstly, the target bias sampling method is employed to screen and eliminate redundant sampling points. Secondly, the adaptive step size strategy is introduced to address the limitations of the traditional RRT algorithm. The mobile robot is then modeled and analyzed to ensure that the path adheres to angle and collision constraints during movement. Finally, the initial path is pruned, and the path is smoothed using a cubic B-spline curve, resulting in a smoother path with reduced costs. The evaluation metrics employed include search time, path length, and the number of sampling nodes. To evaluate the effectiveness of the proposed algorithm, simulations of the RRT algorithm, RRT-connect algorithm, RRT* algorithm, and the improved RRT algorithm are conducted in various environments. The results demonstrate that the improved RRT algorithm reduces the generated path length by 25.32% compared to the RRT algorithm, 26.42% compared to the RRT-connect algorithm, and 4.99% compared to the RRT* algorithm. Moreover, the improved RRT algorithm significantly improves the demand for reducing path costs. The planning time of the improved RRT algorithm is reduced by 64.96% compared to that of the RRT algorithm, 40.83% compared to that of the RRT-connect algorithm, and 27.34% compared to that of the RRT* algorithm, leading to improved speed. These findings indicate that the proposed method exhibits a notable improvement in the three crucial evaluation metrics: sampling time, number of nodes, and path length. Additionally, the algorithm performed well after undergoing physical verification with an insect-like mobile robot in a real environment featuring narrow elevator entrances.

Funder

National Natural Science Foundation of China

National Key Technologies Research & Development of China

Key Research and Development Project of Zhejiang Province

Publisher

MDPI AG

Subject

Molecular Medicine,Biomedical Engineering,Biochemistry,Biomaterials,Bioengineering,Biotechnology

Reference31 articles.

1. Review of robot path planning algorithms;Wang;J. Guilin Univ. Technol.,2022

2. Path planning of scenic spots based on improved A* algorithm;Wang;Sci. Rep.,2022

3. Improved Dijkstra algorithm for mobile robot path planning and obstacle avoidance;Alshammrei;Cmc-Comput. Mater. Contin.,2022

4. A jump point search improved ant colony hybrid optimization algorithm for path planning of mobile robot;Chen;Int. J. Adv. Robot. Syst.,2022

5. An effective path planning of intelligent mobile robot using improved genetic algorithm;Chen;Wirel. Commun. Mob. Comput.,2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3