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...
详细信息
ISBN:
(纸本)9789881563972
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 geneticalgorithm 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.
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...
详细信息
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 geneticalgorithm 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.
暂无评论