Improved A* Algorithm for Path Planning Based on CubeSats In-Orbit Electromagnetic Transfer System

IF 2.1 3区 工程技术 Q2 ENGINEERING, AEROSPACE Aerospace Pub Date : 2024-05-15 DOI:10.3390/aerospace11050394
Duo Xu, Honghao Yue, Yong Zhao, Fei Yang, Jun Wu, Xueting Pan, Tao Tang, Yuhao Zhang
{"title":"Improved A* Algorithm for Path Planning Based on CubeSats In-Orbit Electromagnetic Transfer System","authors":"Duo Xu, Honghao Yue, Yong Zhao, Fei Yang, Jun Wu, Xueting Pan, Tao Tang, Yuhao Zhang","doi":"10.3390/aerospace11050394","DOIUrl":null,"url":null,"abstract":"For future large-scale CubeSat applications in orbit, the deployer must accommodate a greater number of CubeSats and facilitate cluster releases. This paper introduces an improved A* algorithm tailored for CubeSat in-orbit transfer path planning. Unlike the traditional A* algorithm, this enhanced version incorporates a path coordination strategy to manage congestion caused by the simultaneous transfer of many CubeSats, ensuring they reach their designated release positions smoothly and thus significantly boosting the efficiency of CubeSat transfers. Additionally, the algorithm develops a cost model for attitude disturbances on the electromagnetic conveying platform and crafts an improved cost function. It strategically balances the reduction in attitude disturbances caused by CubeSat transfers with the efficiency of these transfers. The primary goal is to minimize platform disturbances while optimizing the number of steps CubeSats need to reach their intended positions. The effectiveness of this algorithm is demonstrated through detailed case studies, which confirm that during the CubeSat transfer process, the platform’s attitude remains stable, and the transfer efficiency is well-managed, achieving efficient path planning for the in-orbit transfer of numerous CubeSats.","PeriodicalId":48525,"journal":{"name":"Aerospace","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aerospace","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.3390/aerospace11050394","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, AEROSPACE","Score":null,"Total":0}
引用次数: 0

Abstract

For future large-scale CubeSat applications in orbit, the deployer must accommodate a greater number of CubeSats and facilitate cluster releases. This paper introduces an improved A* algorithm tailored for CubeSat in-orbit transfer path planning. Unlike the traditional A* algorithm, this enhanced version incorporates a path coordination strategy to manage congestion caused by the simultaneous transfer of many CubeSats, ensuring they reach their designated release positions smoothly and thus significantly boosting the efficiency of CubeSat transfers. Additionally, the algorithm develops a cost model for attitude disturbances on the electromagnetic conveying platform and crafts an improved cost function. It strategically balances the reduction in attitude disturbances caused by CubeSat transfers with the efficiency of these transfers. The primary goal is to minimize platform disturbances while optimizing the number of steps CubeSats need to reach their intended positions. The effectiveness of this algorithm is demonstrated through detailed case studies, which confirm that during the CubeSat transfer process, the platform’s attitude remains stable, and the transfer efficiency is well-managed, achieving efficient path planning for the in-orbit transfer of numerous CubeSats.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于立方体卫星在轨电磁传输系统的改进型 A* 路径规划算法
对于未来在轨的大规模立方体卫星应用,部署器必须能够容纳更多的立方体卫星,并为集群释放提供便利。本文介绍了一种为立方体卫星在轨转移路径规划量身定制的改进型 A* 算法。与传统的A*算法不同,该增强版算法纳入了路径协调策略,以管理多颗立方体卫星同时转移所造成的拥堵,确保它们顺利到达指定的释放位置,从而显著提高立方体卫星转移的效率。此外,该算法还开发了电磁传送平台姿态干扰成本模型,并制作了改进的成本函数。该算法在减少立方体卫星转移造成的姿态干扰和提高转移效率之间实现了战略性平衡。其主要目标是最大限度地减少平台干扰,同时优化立方体卫星到达预定位置所需的步数。详细的案例研究证明了该算法的有效性,证实在立方体卫星转移过程中,平台姿态保持稳定,转移效率得到良好管理,实现了众多立方体卫星在轨转移的高效路径规划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Aerospace
Aerospace ENGINEERING, AEROSPACE-
CiteScore
3.40
自引率
23.10%
发文量
661
审稿时长
6 weeks
期刊介绍: Aerospace is a multidisciplinary science inviting submissions on, but not limited to, the following subject areas: aerodynamics computational fluid dynamics fluid-structure interaction flight mechanics plasmas research instrumentation test facilities environment material science structural analysis thermophysics and heat transfer thermal-structure interaction aeroacoustics optics electromagnetism and radar propulsion power generation and conversion fuels and propellants combustion multidisciplinary design optimization software engineering data analysis signal and image processing artificial intelligence aerospace vehicles'' operation, control and maintenance risk and reliability human factors human-automation interaction airline operations and management air traffic management airport design meteorology space exploration multi-physics interaction.
期刊最新文献
On the Exploration of Temporal Fusion Transformers for Anomaly Detection with Multivariate Aviation Time-Series Data Assessment of Flyby Methods as Applied to Close Encounters among Asteroids A Multi-Objective Dynamic Mission-Scheduling Algorithm Considering Perturbations for Earth Observation Satellites Numerical Study on Far-Field Noise Characteristic Generated by Wall-Mounted Swept Finite-Span Airfoil within Transonic Flow Number of Blades’ Influence on the Performance of Rotor with Equal Solidity in Open and Shrouded Configurations: Experimental Analysis
×
引用
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