基于混合蜜獾算法的航天器交会和接近动态路径规划

IF 3.7 3区 计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS
Cheng Huang, Tao Wang, Shuaikang Wang, Jiazhong Xu
{"title":"基于混合蜜獾算法的航天器交会和接近动态路径规划","authors":"Cheng Huang,&nbsp;Tao Wang,&nbsp;Shuaikang Wang,&nbsp;Jiazhong Xu","doi":"10.1016/j.jfranklin.2024.107398","DOIUrl":null,"url":null,"abstract":"<div><div>In order to solve the 3D path planning of the close-range guidance phase of spacecraft in space rendezvous and approaching, and improve its optimization performance in dynamic environments, a 3D dynamic path planning method based on hybrid honey badger algorithm and cubic spline interpolation is proposed. Firstly, a hybrid honey badger algorithm is presented for dynamic path planning: the chaotic reverse learning is used to initialize the population, so as to improve the global search ability; the transfer operators are introduced in the mode transition stage to balance exploration and exploitation capabilities; the sine and cosine operators are integrated during the stage of location update to improve the quality of the optimal solution; an adaptive disturbance coefficient is introduced into the mining mode to accelerate the convergence. Secondly, the cubic spline interpolation algorithm is combined to optimize the path curve and reduce the turning angle of the curve. Finally, the comparative simulation experiments verify that the proposed method can plan a smooth path without collision. The planned path length is relatively shortest, the path turning angle and the algorithm running time are relatively smallest.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 1","pages":"Article 107398"},"PeriodicalIF":3.7000,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic path planning for spacecraft rendezvous and approach based on hybrid honey badger algorithm\",\"authors\":\"Cheng Huang,&nbsp;Tao Wang,&nbsp;Shuaikang Wang,&nbsp;Jiazhong Xu\",\"doi\":\"10.1016/j.jfranklin.2024.107398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In order to solve the 3D path planning of the close-range guidance phase of spacecraft in space rendezvous and approaching, and improve its optimization performance in dynamic environments, a 3D dynamic path planning method based on hybrid honey badger algorithm and cubic spline interpolation is proposed. Firstly, a hybrid honey badger algorithm is presented for dynamic path planning: the chaotic reverse learning is used to initialize the population, so as to improve the global search ability; the transfer operators are introduced in the mode transition stage to balance exploration and exploitation capabilities; the sine and cosine operators are integrated during the stage of location update to improve the quality of the optimal solution; an adaptive disturbance coefficient is introduced into the mining mode to accelerate the convergence. Secondly, the cubic spline interpolation algorithm is combined to optimize the path curve and reduce the turning angle of the curve. Finally, the comparative simulation experiments verify that the proposed method can plan a smooth path without collision. The planned path length is relatively shortest, the path turning angle and the algorithm running time are relatively smallest.</div></div>\",\"PeriodicalId\":17283,\"journal\":{\"name\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"volume\":\"362 1\",\"pages\":\"Article 107398\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2024-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0016003224008196\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Franklin Institute-engineering and Applied Mathematics","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0016003224008196","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

为了解决空间交会与接近中航天器近程制导阶段的三维路径规划问题,提高其在动态环境下的优化性能,提出了一种基于混合蜜獾算法和三次样条插值的三维动态路径规划方法。首先,提出了一种用于动态路径规划的混合蜜獾算法:利用混沌反向学习初始化种群,以提高全局搜索能力;在模式转换阶段引入转移算子,以平衡探索和开发能力;在位置更新阶段集成正弦和余弦算子,以提高最优解的质量;在采矿模式中引入自适应干扰系数,以加速收敛。其次,结合三次样条插值算法优化路径曲线,减小曲线转弯角度。最后,对比仿真实验验证了所提出的方法可以规划出一条无碰撞的平滑路径。规划的路径长度相对最短,路径转弯角度和算法运行时间相对最小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic path planning for spacecraft rendezvous and approach based on hybrid honey badger algorithm
In order to solve the 3D path planning of the close-range guidance phase of spacecraft in space rendezvous and approaching, and improve its optimization performance in dynamic environments, a 3D dynamic path planning method based on hybrid honey badger algorithm and cubic spline interpolation is proposed. Firstly, a hybrid honey badger algorithm is presented for dynamic path planning: the chaotic reverse learning is used to initialize the population, so as to improve the global search ability; the transfer operators are introduced in the mode transition stage to balance exploration and exploitation capabilities; the sine and cosine operators are integrated during the stage of location update to improve the quality of the optimal solution; an adaptive disturbance coefficient is introduced into the mining mode to accelerate the convergence. Secondly, the cubic spline interpolation algorithm is combined to optimize the path curve and reduce the turning angle of the curve. Finally, the comparative simulation experiments verify that the proposed method can plan a smooth path without collision. The planned path length is relatively shortest, the path turning angle and the algorithm running time are relatively smallest.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.30
自引率
14.60%
发文量
586
审稿时长
6.9 months
期刊介绍: The Journal of The Franklin Institute has an established reputation for publishing high-quality papers in the field of engineering and applied mathematics. Its current focus is on control systems, complex networks and dynamic systems, signal processing and communications and their applications. All submitted papers are peer-reviewed. The Journal will publish original research papers and research review papers of substance. Papers and special focus issues are judged upon possible lasting value, which has been and continues to be the strength of the Journal of The Franklin Institute.
×
引用
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学术官方微信