跳到主要导航 跳到搜索 跳到主要内容

An Improved Dynamic Step Size RRT Algorithm in Complex Environments

  • Beijing Institute of Technology

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

Rapidly exploring Random Tree(RRT) is an efficient path planning algorithm based on random sampling, which plays an important role in the robot field and autonomous driving field. However, due to the randomness of sampling, its results are usually not optimal. This paper proposes a dynamic step size RRT algorithm, which mainly improves the traditional RRT as follows. First, combined with the Artificial Potential Field(APF), the target makes heuristic guidance for the sampling process. And then, the step size is adaptively changed according to the density of obstacles. After that, a one-shot heuristic strategy is used to speed up the search process. Finally, a bi-directional pruning strategy is adopted to reduce the path length by merging points. The simulation results show that the improved RRT algorithm can find the target faster and better.

源语言英语
主期刊名Proceedings of the 33rd Chinese Control and Decision Conference, CCDC 2021
出版商Institute of Electrical and Electronics Engineers Inc.
页3835-3840
页数6
ISBN(电子版)9781665440899
DOI
出版状态已出版 - 2021
活动33rd Chinese Control and Decision Conference, CCDC 2021 - Kunming, 中国
期限: 22 5月 2021 → 24 5月 2021

丛书

姓名Proceedings of the 33rd Chinese Control and Decision Conference, CCDC 2021

会议

会议33rd Chinese Control and Decision Conference, CCDC 2021
国家/地区中国
市Kunming
时期22/05/21 → 24/05/21

学术指纹

探究 'An Improved Dynamic Step Size RRT Algorithm in Complex Environments' 的科研主题。它们共同构成独一无二的学术指纹。

引用此