In order to solve the problems related to the ground tracks of satellites for Earth observation with multiple orbital maneuvering capabilities, multi-detection targets, and multi-detector coordination, a fast calculation method of the ground tracks of satellites based on characteristic parameter fitting is proposed. An optimization model is established based on the database about the splicing method of the ground tracks of satellites. Firstly, the characteristic parameters describing the ground tracks of satellites are analyzed and refined, and polynomials are used to fit these characteristic parameters to achieve fast calculation. Then, an observation code database is established according to the detection target, and the database is further organized into a trajectory database. Finally, an optimization model based on the trajectory database is established to solve all problems on the ground tracks of satellites. The simulation of a fast full coverage task for a fixed target in CTOC11 (the 11th China Trajectory Optimization Competition) was completed within 19.19 days. The results show that the design method and scheme adopted in this paper can be used for the design of ground tracks of satellites in various near-circular orbits.
HUANG Xiongwei
,
WANG Shuquan
,
ZHANG Yang
,
HE Shengmao
. A trajectory planning based on characteristic parameter fitting for multi-ground targets of the ground tracks of two satellites[J]. Journal of University of Chinese Academy of Sciences, 2024
, 41(5)
: 665
-676
.
DOI: 10.7523/j.ucas.2022.070
[1] 龚威,史硕,陈必武,等.对地观测高光谱激光雷达发展及展望[J].遥感学报, 2021, 25(1):501-513.
[2] Liu X L, Laporte G, Chen Y W, et al. An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time[J]. Computers&Operations Research, 2017, 86:41-53. DOI:10.1016/j.cor.2017.04.006.
[3] Xu R, Chen H P, Liang X L, et al. Priority-based constructive algorithms for scheduling agile earth observation satellites with total priority maximization[J]. Expert Systems With Applications, 2016, 51:195-206. DOI:10.1016/j.eswa.2015.12.039.
[4] Qi J T, Guo J J, Wang M M, et al. A cooperative autonomous scheduling approach for multiple earth observation satellites with intensive missions[J]. IEEE Access, 2021,9:61646-61661. DOI:10.1109/ACCESS.2021.3075059.
[5] Wang S, Zhao L, Cheng J H, et al. Task scheduling and attitude planning for agile earth observation satellite with intensive tasks[J]. Aerospace Science and Technology, 2019, 90:23-33. DOI:10.1016/j.ast.2019.04.007.
[6] Barkaoui M, Berger J. A new hybrid genetic algorithm for the collection scheduling problem for a satellite constellation[J]. Journal of the Operational Research Society, 2020, 71(9):1390-1410. DOI:10.1080/01605682.2019.1609891.
[7] 陈昊,赵斐,白建东.对地观测卫星动态任务调度优化算法研究[J].无线电工程, 2021, 51(9):947-954. DOI:10.3969/j.issn.1003-3106.2021.09.016.
[8] 原斌.对地观测卫星轨道设计及振动控制[D].沈阳:沈阳航空航天大学, 2017.
[9] 付晓锋.空间快速响应任务中的轨道设计问题研究[D].长沙:国防科学技术大学, 2012.
[10] 甘岚,龚胜平.机动卫星星座对多目标成像任务规划[J].清华大学学报(自然科学版), 2021, 61(3):240-247. DOI:10.16511/j.cnki.qhdxxb.2020.26.013.
[11] Zhu K J, Li J F, Baoyin H X. Satellite scheduling considering maximum observation coverage time and minimum orbital transfer fuel cost[J]. Acta Astronautica, 2010, 66(1/2):220-229. DOI:10.1016/j.actaastro.2009.05.029.
[12] Zhang J, Li H Y, Luo Y Z, et al. Effects of in-track maneuver on the ground track of near-circular orbits[J]. Journal of Guidance, Control, and Dynamics, 2014, 37(4):1373-1378. DOI:10.2514/1.G000047.
[13] Zhang G, Cao X B, Mortari D. Analytical approximate solutions to ground track adjustment for responsive space[J]. IEEE Transactions on Aerospace and Electronic Systems, 2016, 52(3):1366-1383. DOI:10.1109/TAES.2016.140644.
[14] Zhang G, Sheng J. Impulsive ground-track adjustment for assigned final orbit[J]. Journal of Spacecraft and Rockets, 2016, 53(4):599-609. DOI:10.2514/1.A33447.
[15] 刘俊丽,高扬.十年一剑刃锋利,苦寒方得梅花香:全国空间轨道设计竞赛发展历程回顾[J].力学与实践, 2019, 41(4):488-497. DOI:10.6052/1000-0879-19-283.
[16] 张海洋.面对快速响应任务的星下点轨迹机动优化问题研究[D].哈尔滨:哈尔滨工业大学, 2019.
[17] 刘林.航天器轨道理论[M].北京:国防工业出版社, 2000.
