Study of a chassis path planning algorithm for a forest harvester

IF 2.1 3区 农林科学 Q2 FORESTRY
Zhuoxian Tan, Jinhao Liu, Biao Sun, Haoxian Qin, Yuewei Ma
{"title":"Study of a chassis path planning algorithm for a forest harvester","authors":"Zhuoxian Tan, Jinhao Liu, Biao Sun, Haoxian Qin, Yuewei Ma","doi":"10.1080/14942119.2023.2183462","DOIUrl":null,"url":null,"abstract":"ABSTRACT In this study, a global path planning method is proposed for the motion of the chassis of a forest harvester to satisfy the requirements of obstacle avoidance when the harvester is working in the forest. First, a distributed plane map is generated in accordance with the characteristics of forest environment. Subsequently, a Ms_BiRRT algorithm is proposed based on the principle of the random search tree algorithm for multi-stage target-guided global path planning, and the path is further optimized. The effectiveness of the Ms_BiRRT algorithm proposed in this study is examined through experimental simulation. Three types of map environments are designed based on the characteristics of the forest environment. The average planning time of the proposed algorithm is extended by 90.69% and 47.37%, the path length is shortened by 10.40% and 8.23%, the total number of nodes is reduced by 81.52% and 54.65%, and the node utilization rate increases from 18.47% and 44.12% to 85.46%, respectively, compared with classical RRT algorithm and two-way RRT algorithm. The path planning algorithm proposed in this study is capable of quickly reaching the target point in different environments, improving the convergence speed of the algorithm, and increasing the efficiency and stability of the forest harvester in the working process based on the initial path guidance and target guidance methods.","PeriodicalId":55998,"journal":{"name":"International Journal of Forest Engineering","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Forest Engineering","FirstCategoryId":"97","ListUrlMain":"https://doi.org/10.1080/14942119.2023.2183462","RegionNum":3,"RegionCategory":"农林科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"FORESTRY","Score":null,"Total":0}
引用次数: 0

Abstract

ABSTRACT In this study, a global path planning method is proposed for the motion of the chassis of a forest harvester to satisfy the requirements of obstacle avoidance when the harvester is working in the forest. First, a distributed plane map is generated in accordance with the characteristics of forest environment. Subsequently, a Ms_BiRRT algorithm is proposed based on the principle of the random search tree algorithm for multi-stage target-guided global path planning, and the path is further optimized. The effectiveness of the Ms_BiRRT algorithm proposed in this study is examined through experimental simulation. Three types of map environments are designed based on the characteristics of the forest environment. The average planning time of the proposed algorithm is extended by 90.69% and 47.37%, the path length is shortened by 10.40% and 8.23%, the total number of nodes is reduced by 81.52% and 54.65%, and the node utilization rate increases from 18.47% and 44.12% to 85.46%, respectively, compared with classical RRT algorithm and two-way RRT algorithm. The path planning algorithm proposed in this study is capable of quickly reaching the target point in different environments, improving the convergence speed of the algorithm, and increasing the efficiency and stability of the forest harvester in the working process based on the initial path guidance and target guidance methods.
森林收获机底盘路径规划算法研究
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.70
自引率
21.10%
发文量
33
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信