Path Planning for Coal Mining Masonry Robots Combined With Trajectory Optimization

IF 3.6 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Access Pub Date : 2025-02-04 DOI:10.1109/ACCESS.2025.3539023
Xingyi Qian;Yan Wang
{"title":"Path Planning for Coal Mining Masonry Robots Combined With Trajectory Optimization","authors":"Xingyi Qian;Yan Wang","doi":"10.1109/ACCESS.2025.3539023","DOIUrl":null,"url":null,"abstract":"In underground coal mining, the efficiency of masonry robots is hindered by complex environmental conditions and pose constraints. This study proposes a novel path planning algorithm combining an improved Rapidly-exploring Random Tree (RRT) with Particle Swarm Optimization (PSO), followed by trajectory optimization under mechanical constraints to identify the time-optimal path. The improved RRT incorporates dynamic sampling regions and tree reorganization to reduce redundancy and enhance efficiency. A dynamic step length strategy is also introduced to address obstacle avoidance in complex underground environments, ensuring robotic arm safety. The modified PSO algorithm is then used for path planning and trajectory optimization, incorporating obstacle avoidance and pose constraints. Simulation results show that the integrated algorithm significantly reduces path length, sampling points, and search time compared to traditional RRT, RRT*, and informed RRT*. Additionally, trajectory optimization with PSO, considering joint posture constraints, reduces operation time by approximately 13% compared to ant colony optimization. This research provides key technical insights for improving the efficiency and safety of masonry robots in coal mining.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"24197-24206"},"PeriodicalIF":3.6000,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10872922","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10872922/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In underground coal mining, the efficiency of masonry robots is hindered by complex environmental conditions and pose constraints. This study proposes a novel path planning algorithm combining an improved Rapidly-exploring Random Tree (RRT) with Particle Swarm Optimization (PSO), followed by trajectory optimization under mechanical constraints to identify the time-optimal path. The improved RRT incorporates dynamic sampling regions and tree reorganization to reduce redundancy and enhance efficiency. A dynamic step length strategy is also introduced to address obstacle avoidance in complex underground environments, ensuring robotic arm safety. The modified PSO algorithm is then used for path planning and trajectory optimization, incorporating obstacle avoidance and pose constraints. Simulation results show that the integrated algorithm significantly reduces path length, sampling points, and search time compared to traditional RRT, RRT*, and informed RRT*. Additionally, trajectory optimization with PSO, considering joint posture constraints, reduces operation time by approximately 13% compared to ant colony optimization. This research provides key technical insights for improving the efficiency and safety of masonry robots in coal mining.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合轨迹优化的采煤砌体机器人路径规划
在煤矿井下开采中,砌体机器人的工作效率受到复杂环境条件的制约。本文提出了一种新的路径规划算法,将改进的快速探索随机树(RRT)算法与粒子群算法(PSO)相结合,通过力学约束下的轨迹优化来识别时间最优路径。改进后的RRT采用动态采样区域和树重组来减少冗余,提高效率。引入动态步长策略,解决复杂地下环境下的避障问题,保证机械臂的安全。将改进后的粒子群算法引入避障和姿态约束,进行路径规划和轨迹优化。仿真结果表明,与传统RRT、RRT*和通知RRT*相比,该算法显著减少了路径长度、采样点和搜索时间。此外,与蚁群优化相比,考虑关节姿态约束的PSO轨迹优化减少了约13%的操作时间。该研究为提高砌体机器人在煤矿开采中的效率和安全性提供了关键的技术见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Access
IEEE Access COMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍: IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest. IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on: Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals. Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering. Development of new or improved fabrication or manufacturing techniques. Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.
期刊最新文献
From Simulation to Clinical Translation: A Deep Learning Framework for Pancreatic Tumor Segmentation With GUI Integration Integrating Machine Learning and Image-Based Damage Quantification to Predict Self-Healing Performance of Asphalt Mixtures Edge-Deployable Neural Network Framework for Real-Time Antenna Performance Prediction in Wearable Telemedicine Systems Graph Neural Network-Based Composition Recommendation for Solid Oxide Fuel Cells Using Full-Cycle Data From Topology to Geometry: A Neural Ricci Flow Framework for Predicting Flash Crashes and Contagion
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1