International Journal of Information Technology | |
Optimal Peer-to-Peer On-Orbit Refueling Mission Planning with Complex Constraints | |
Jing Yu ; Hongyang Liu ; Dong Hao | |
关键词: Mission planning; orbital rendezvous; on-orbit refueling; space mission.; | |
DOI : 10.1999/1307-6892/10009778 | |
学科分类:计算机应用 | |
来源: World Academy of Science, Engineering and Technology (W A S E T) | |
【 摘 要 】
On-Orbit Refueling is of great significance in extending space crafts' lifetime. The problem of minimum-fuel, time-fixed, Peer-to-Peer On-Orbit Refueling mission planning is addressed here with the particular aim of assigning fuel-insufficient satellites to the fuel-sufficient satellites and optimizing each rendezvous trajectory. Constraints including perturbation, communication link, sun illumination, hold points for different rendezvous phases, and sensor switching are considered. A planning model has established as well as a two-level solution method. The upper level deals with target assignment based on fuel equilibrium criterion, while the lower level solves constrained trajectory optimization using special maneuver strategies. Simulations show that the developed method could effectively resolve the Peer-to-Peer On-Orbit Refueling mission planning problem and deal with complex constraints.
【 授权许可】
Unknown
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201910288747609ZK.pdf | 360KB | download |