Distributed Reconfiguration Planning Optimization Method of Large-Scale Structure for Modular Satellites

Lei Chen, Mingying Huo, Xiyan Zhao, Xiaoyu Shang, Li Yao, Dianliang Yang, Zichen Fan, Naiming Qi
{"title":"Distributed Reconfiguration Planning Optimization Method of Large-Scale Structure for Modular Satellites","authors":"Lei Chen,&nbsp;Mingying Huo,&nbsp;Xiyan Zhao,&nbsp;Xiaoyu Shang,&nbsp;Li Yao,&nbsp;Dianliang Yang,&nbsp;Zichen Fan,&nbsp;Naiming Qi","doi":"10.1007/s42423-025-00193-3","DOIUrl":null,"url":null,"abstract":"<div><p>The concept of spacecraft modularization has gradually attracted attention. Due to the problems of low efficiency and high transfer consumption in the current large-scale reconfiguration research of space modular self-reconfigurable satellites (SMSRS) in orbit, we propose a distributed self-reconfigurable motion planning optimization method. Firstly, the real-time minimum map and the corresponding undirected connected graph are established based on the connection condition and the limited observation constraint condition. Then, using the Dijkstra search algorithm, we create the real-time minimum map and the connected graph, leading to a new local optimal reconfiguration path algorithm that combines minimum map and shortest path planning, which significantly cuts down on the total calculations and the number of steps needed for reconfiguration in large-scale planning. Simulation results show that the new method is better than the traditional centralized graph-based method in the on-orbit reconfiguration mission of random configuration with 10–500 module scale, about 11.2% transfer steps and 35.7% reconfiguration planning time were saved.</p></div>","PeriodicalId":100039,"journal":{"name":"Advances in Astronautics Science and Technology","volume":"8 4","pages":"351 - 359"},"PeriodicalIF":0.0000,"publicationDate":"2025-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Astronautics Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s42423-025-00193-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The concept of spacecraft modularization has gradually attracted attention. Due to the problems of low efficiency and high transfer consumption in the current large-scale reconfiguration research of space modular self-reconfigurable satellites (SMSRS) in orbit, we propose a distributed self-reconfigurable motion planning optimization method. Firstly, the real-time minimum map and the corresponding undirected connected graph are established based on the connection condition and the limited observation constraint condition. Then, using the Dijkstra search algorithm, we create the real-time minimum map and the connected graph, leading to a new local optimal reconfiguration path algorithm that combines minimum map and shortest path planning, which significantly cuts down on the total calculations and the number of steps needed for reconfiguration in large-scale planning. Simulation results show that the new method is better than the traditional centralized graph-based method in the on-orbit reconfiguration mission of random configuration with 10–500 module scale, about 11.2% transfer steps and 35.7% reconfiguration planning time were saved.

Abstract Image

模块化卫星大结构分布式重构规划优化方法
航天器模块化的概念逐渐受到重视。针对当前空间模块化自重构卫星在轨大规模重构研究中存在的效率低、传输消耗大的问题,提出了一种分布式自重构运动规划优化方法。首先,基于连通条件和有限观测约束条件,建立实时最小映射和相应的无向连通图;然后,利用Dijkstra搜索算法,建立实时最小映射和连通图,得到了一种结合最小映射和最短路径规划的局部最优重构路径算法,大大减少了大规模规划中重构所需的总计算量和步数。仿真结果表明,在10 ~ 500个模块规模的随机构型在轨重构任务中,该方法优于传统的集中式图方法,可节省11.2%的转移步骤和35.7%的重构规划时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.20
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书