Research on Path Planning for Satellite Formation Configuration Changes

2022 3rd China International SAR Symposium (CISS) Pub Date : 2022-11-02 DOI:10.1109/CISS57580.2022.9971313

Han Wu, Fei Han

{"title":"Research on Path Planning for Satellite Formation Configuration Changes","authors":"Han Wu, Fei Han","doi":"10.1109/CISS57580.2022.9971313","DOIUrl":null,"url":null,"abstract":"For different observation tasks, synthetic aperture radar(SAR) satellite formation needs to adopt different configurations. In this case, how to realize the path planning is an important research problem for configuration transition. In this paper, a sequential convex programming(SCP) is proposed for the swarm reconfiguration that involve avoiding collisions and minimizing fuel. The quadratic performance index of the control variable represents the optimization index of path planning to ensure the optimal fuel consumption. Then, a linear discrete relative orbital dynamic model under the J2 perturbation is constructed. Regarding the dynamic constraints and the prevention of inter-satellite collisions as basic constraints, the path planning problem of configuration transformation is solved as a discretized convex programming problem. The SCP is introduced to realize iterated optimal planning. This algorithm reduces the computational complexity while developing the high control precision. Through experimental analysis, this method can ensure that there is no collision risk between satellites, and the planning converges to complete configuration reconstruction.","PeriodicalId":331510,"journal":{"name":"2022 3rd China International SAR Symposium (CISS)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 3rd China International SAR Symposium (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS57580.2022.9971313","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

For different observation tasks, synthetic aperture radar(SAR) satellite formation needs to adopt different configurations. In this case, how to realize the path planning is an important research problem for configuration transition. In this paper, a sequential convex programming(SCP) is proposed for the swarm reconfiguration that involve avoiding collisions and minimizing fuel. The quadratic performance index of the control variable represents the optimization index of path planning to ensure the optimal fuel consumption. Then, a linear discrete relative orbital dynamic model under the J2 perturbation is constructed. Regarding the dynamic constraints and the prevention of inter-satellite collisions as basic constraints, the path planning problem of configuration transformation is solved as a discretized convex programming problem. The SCP is introduced to realize iterated optimal planning. This algorithm reduces the computational complexity while developing the high control precision. Through experimental analysis, this method can ensure that there is no collision risk between satellites, and the planning converges to complete configuration reconstruction.

查看原文本刊更多论文

卫星编队构型变化时的路径规划研究

针对不同的观测任务，合成孔径雷达(SAR)卫星编队需要采用不同的配置。在这种情况下，如何实现路径规划是构型转换的一个重要研究问题。本文提出了一种序贯凸规划(SCP)方法，用于避免碰撞和最小化燃料的群体重构。控制变量的二次性能指标表示保证最优油耗的路径规划优化指标。然后，建立了J2摄动下的线性离散相对轨道动力学模型。以动态约束和防止星间碰撞为基本约束，将构型变换的路径规划问题求解为离散化凸规划问题。引入SCP算法实现迭代最优规划。该算法在降低计算复杂度的同时具有较高的控制精度。通过实验分析，该方法可以保证卫星之间不存在碰撞风险，且规划收敛完成构型重构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2022 3rd China International SAR Symposium (CISS)

自引率

0.00%

发文量