基于改进 RRT(RRT-H)算法的 4-DOF 武器臂避障路径规划

4区 工程技术 Q1 Mathematics Mathematical Problems in Engineering Pub Date : 2024-02-22 DOI:10.1155/2024/3866834
Kaifan Zou, Xiaorong Guan, Zhong Li, Huibin Li, Changlong Jiang, Zihui Zhu
{"title":"基于改进 RRT(RRT-H)算法的 4-DOF 武器臂避障路径规划","authors":"Kaifan Zou, Xiaorong Guan, Zhong Li, Huibin Li, Changlong Jiang, Zihui Zhu","doi":"10.1155/2024/3866834","DOIUrl":null,"url":null,"abstract":"To improve soldiers’ combat capability, weapon arms have a good development prospect. However, due to special work scenarios and tasks, new requirements are exerted on. Based on the fast-expanding random tree algorithm (RRT), path algorithm optimization (RRT-H) is proposed for the path planning of weapon arms. Overall path optimization is achieved by reducing the local path length with a closer path point planning to the obstacle. In a complex environment, the RRT-H algorithm can avoid local traps by guiding the new path extension direction and exploring multiple different paths in the map. The superiority of this algorithm is verified with 2D plane obstacle avoidance and pathfinding simulation experiments. Compared to <span><svg height=\"10.2828pt\" style=\"vertical-align:-0.1802998pt\" version=\"1.1\" viewbox=\"-0.0498162 -10.1025 30.0188 10.2828\" width=\"30.0188pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g><g transform=\"matrix(.013,0,0,-0.013,8.073,0)\"><use xlink:href=\"#g190-83\"></use></g><g transform=\"matrix(.013,0,0,-0.013,15.728,0)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,23.84,-5.741)\"></path></g></svg>,</span> <svg height=\"10.2828pt\" style=\"vertical-align:-0.1802998pt\" version=\"1.1\" viewbox=\"-0.0498162 -10.1025 30.0188 10.2828\" width=\"30.0188pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"><use xlink:href=\"#g190-83\"></use></g><g transform=\"matrix(.013,0,0,-0.013,8.073,0)\"><use xlink:href=\"#g190-83\"></use></g><g transform=\"matrix(.013,0,0,-0.013,15.728,0)\"><use xlink:href=\"#g190-85\"></use></g><g transform=\"matrix(.0091,0,0,-0.0091,23.84,-5.741)\"><use xlink:href=\"#g50-43\"></use></g></svg> smart, and information <span><svg height=\"10.2828pt\" style=\"vertical-align:-0.1802998pt\" version=\"1.1\" viewbox=\"-0.0498162 -10.1025 30.0188 10.2828\" width=\"30.0188pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"><use xlink:href=\"#g190-83\"></use></g><g transform=\"matrix(.013,0,0,-0.013,8.073,0)\"><use xlink:href=\"#g190-83\"></use></g><g transform=\"matrix(.013,0,0,-0.013,15.728,0)\"><use xlink:href=\"#g190-85\"></use></g><g transform=\"matrix(.0091,0,0,-0.0091,23.84,-5.741)\"><use xlink:href=\"#g50-43\"></use></g></svg>,</span> the RRT-H can obtain high-quality calculation results in a shorter time. After setting degrees of freedom (DOF) as that of variables, the algorithm is applied to the 4-DOF weapon arm, which confirms an effective reduction to the 4-DOF weapon arm’s motion costs.","PeriodicalId":18319,"journal":{"name":"Mathematical Problems in Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Obstacle Avoidance Path Planning of a 4-DOF Weapon Arm Based on Improved RRT (RRT-H) Algorithm\",\"authors\":\"Kaifan Zou, Xiaorong Guan, Zhong Li, Huibin Li, Changlong Jiang, Zihui Zhu\",\"doi\":\"10.1155/2024/3866834\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve soldiers’ combat capability, weapon arms have a good development prospect. However, due to special work scenarios and tasks, new requirements are exerted on. Based on the fast-expanding random tree algorithm (RRT), path algorithm optimization (RRT-H) is proposed for the path planning of weapon arms. Overall path optimization is achieved by reducing the local path length with a closer path point planning to the obstacle. In a complex environment, the RRT-H algorithm can avoid local traps by guiding the new path extension direction and exploring multiple different paths in the map. The superiority of this algorithm is verified with 2D plane obstacle avoidance and pathfinding simulation experiments. Compared to <span><svg height=\\\"10.2828pt\\\" style=\\\"vertical-align:-0.1802998pt\\\" version=\\\"1.1\\\" viewbox=\\\"-0.0498162 -10.1025 30.0188 10.2828\\\" width=\\\"30.0188pt\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\" xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\"><g transform=\\\"matrix(.013,0,0,-0.013,0,0)\\\"></path></g><g transform=\\\"matrix(.013,0,0,-0.013,8.073,0)\\\"><use xlink:href=\\\"#g190-83\\\"></use></g><g transform=\\\"matrix(.013,0,0,-0.013,15.728,0)\\\"></path></g><g transform=\\\"matrix(.0091,0,0,-0.0091,23.84,-5.741)\\\"></path></g></svg>,</span> <svg height=\\\"10.2828pt\\\" style=\\\"vertical-align:-0.1802998pt\\\" version=\\\"1.1\\\" viewbox=\\\"-0.0498162 -10.1025 30.0188 10.2828\\\" width=\\\"30.0188pt\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\" xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\"><g transform=\\\"matrix(.013,0,0,-0.013,0,0)\\\"><use xlink:href=\\\"#g190-83\\\"></use></g><g transform=\\\"matrix(.013,0,0,-0.013,8.073,0)\\\"><use xlink:href=\\\"#g190-83\\\"></use></g><g transform=\\\"matrix(.013,0,0,-0.013,15.728,0)\\\"><use xlink:href=\\\"#g190-85\\\"></use></g><g transform=\\\"matrix(.0091,0,0,-0.0091,23.84,-5.741)\\\"><use xlink:href=\\\"#g50-43\\\"></use></g></svg> smart, and information <span><svg height=\\\"10.2828pt\\\" style=\\\"vertical-align:-0.1802998pt\\\" version=\\\"1.1\\\" viewbox=\\\"-0.0498162 -10.1025 30.0188 10.2828\\\" width=\\\"30.0188pt\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\" xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\"><g transform=\\\"matrix(.013,0,0,-0.013,0,0)\\\"><use xlink:href=\\\"#g190-83\\\"></use></g><g transform=\\\"matrix(.013,0,0,-0.013,8.073,0)\\\"><use xlink:href=\\\"#g190-83\\\"></use></g><g transform=\\\"matrix(.013,0,0,-0.013,15.728,0)\\\"><use xlink:href=\\\"#g190-85\\\"></use></g><g transform=\\\"matrix(.0091,0,0,-0.0091,23.84,-5.741)\\\"><use xlink:href=\\\"#g50-43\\\"></use></g></svg>,</span> the RRT-H can obtain high-quality calculation results in a shorter time. After setting degrees of freedom (DOF) as that of variables, the algorithm is applied to the 4-DOF weapon arm, which confirms an effective reduction to the 4-DOF weapon arm’s motion costs.\",\"PeriodicalId\":18319,\"journal\":{\"name\":\"Mathematical Problems in Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Problems in Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1155/2024/3866834\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Problems in Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1155/2024/3866834","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

为了提高士兵的作战能力,武器装备有着良好的发展前景。然而,由于特殊的工作场景和任务,对武器装备提出了新的要求。在快速扩展随机树算法(RRT)的基础上,针对武器装备的路径规划提出了路径算法优化(RRT-H)。通过减少局部路径长度,使路径点规划更接近障碍物,从而实现整体路径优化。在复杂环境中,RRT-H 算法可以通过引导新的路径延伸方向和探索地图中的多条不同路径来避免局部陷阱。二维平面避障和寻路模拟实验验证了该算法的优越性。与、智能和信息相比,RRT-H 可以在更短的时间内获得高质量的计算结果。在将自由度(DOF)设置为变量后,将该算法应用于 4-DOF 武器臂,证实有效降低了 4-DOF 武器臂的运动成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Obstacle Avoidance Path Planning of a 4-DOF Weapon Arm Based on Improved RRT (RRT-H) Algorithm
To improve soldiers’ combat capability, weapon arms have a good development prospect. However, due to special work scenarios and tasks, new requirements are exerted on. Based on the fast-expanding random tree algorithm (RRT), path algorithm optimization (RRT-H) is proposed for the path planning of weapon arms. Overall path optimization is achieved by reducing the local path length with a closer path point planning to the obstacle. In a complex environment, the RRT-H algorithm can avoid local traps by guiding the new path extension direction and exploring multiple different paths in the map. The superiority of this algorithm is verified with 2D plane obstacle avoidance and pathfinding simulation experiments. Compared to , smart, and information , the RRT-H can obtain high-quality calculation results in a shorter time. After setting degrees of freedom (DOF) as that of variables, the algorithm is applied to the 4-DOF weapon arm, which confirms an effective reduction to the 4-DOF weapon arm’s motion costs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematical Problems in Engineering
Mathematical Problems in Engineering 工程技术-工程:综合
CiteScore
4.00
自引率
0.00%
发文量
2853
审稿时长
4.2 months
期刊介绍: Mathematical Problems in Engineering is a broad-based journal which publishes articles of interest in all engineering disciplines. Mathematical Problems in Engineering publishes results of rigorous engineering research carried out using mathematical tools. Contributions containing formulations or results related to applications are also encouraged. The primary aim of Mathematical Problems in Engineering is rapid publication and dissemination of important mathematical work which has relevance to engineering. All areas of engineering are within the scope of the journal. In particular, aerospace engineering, bioengineering, chemical engineering, computer engineering, electrical engineering, industrial engineering and manufacturing systems, and mechanical engineering are of interest. Mathematical work of interest includes, but is not limited to, ordinary and partial differential equations, stochastic processes, calculus of variations, and nonlinear analysis.
期刊最新文献
Flower Recognition Algorithm Based on Nonlinear Regression of Pixel Value On Spectral Radius and Energy of a Graph with Self-Loops Influence of Structural Parameters of Gearbox Seal System of Electrical Multiple Units on Seal Performance Implementation of Bioelectrical Impedance Measuring Instrument Based on Embedded System Analyzing Lower Limb Dynamics in Human Gait Using Average Value-Based Technique
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1