TY - GEN
T1 - Satellite mission planning for moving targets observation via data driven approach
AU - Wen, Xin
AU - Liu, Mingmin
AU - Hu, Qinglei
N1 - Publisher Copyright:
© 2019 Technical Committee on Control Theory, Chinese Association of Automation.
PY - 2019/7
Y1 - 2019/7
N2 - Satellite mission planning is an important premise for earth observation. Traditional satellite mission planning is mainly aimed at fixed ground targets, which cannot meet the increasingly complex mission requirements. This paper considers the moving target observation, and puts forward a method of satellite mission planning via data driven approach. This method forecasts the future track and position information of the moving target through a modified Long Short-Term Memory (M-LSTM) networks algorithm, and proposes a Constraint Satisfaction Genetic Algorithm (CSGA) to plan the missions of moving target observation based on the results of M-LSTM algorithm. In view of the complexity of the constraint and task conflict in the moving target observation, CSGA embeds the constraints into the genetic algorithm through conditional forms, and a conflict resolution operator is designed in CSGA to resolve task conflicts. Simulation results demonstrate the efficiency of the LSTM-CSGA method to solve the mission planning and get a higher observation accuracy.
AB - Satellite mission planning is an important premise for earth observation. Traditional satellite mission planning is mainly aimed at fixed ground targets, which cannot meet the increasingly complex mission requirements. This paper considers the moving target observation, and puts forward a method of satellite mission planning via data driven approach. This method forecasts the future track and position information of the moving target through a modified Long Short-Term Memory (M-LSTM) networks algorithm, and proposes a Constraint Satisfaction Genetic Algorithm (CSGA) to plan the missions of moving target observation based on the results of M-LSTM algorithm. In view of the complexity of the constraint and task conflict in the moving target observation, CSGA embeds the constraints into the genetic algorithm through conditional forms, and a conflict resolution operator is designed in CSGA to resolve task conflicts. Simulation results demonstrate the efficiency of the LSTM-CSGA method to solve the mission planning and get a higher observation accuracy.
KW - Constraint Satisfaction Genetic Algorithm
KW - Long Short-Term Memory networks
KW - Mission planning
KW - Moving target observation
UR - https://www.scopus.com/pages/publications/85074426338
U2 - 10.23919/ChiCC.2019.8865487
DO - 10.23919/ChiCC.2019.8865487
M3 - 会议稿件
AN - SCOPUS:85074426338
T3 - Chinese Control Conference, CCC
SP - 2130
EP - 2135
BT - Proceedings of the 38th Chinese Control Conference, CCC 2019
A2 - Fu, Minyue
A2 - Sun, Jian
PB - IEEE Computer Society
T2 - 38th Chinese Control Conference, CCC 2019
Y2 - 27 July 2019 through 30 July 2019
ER -