Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (7): 1738-1742.

Previous Articles     Next Articles

Satellite orbit task merging problem and its dynamic programming algorithm

BAI Bao-cun, HE Ren-jie, LI Ju-fang, CHEN Ying-wu   

  1. Coll. of Information Systems and Management, National Univ. of Defense Technology, Changsha 410073, China
  • Received:2008-03-13 Revised:2008-08-27 Online:2009-07-20 Published:2010-01-03

Abstract: Some of remote sensing satellites have rigid constraints in slew activities,which limit the satellite observing activities.When multiple targets locate in the same swath,they can be combined into one task and observed together.Satellite orbit task merging problem(SOTMP) is proposed,the combined task features angle-dependent effects and sequence characteristics,so the problem can be partitioned into multi-phase according to the maximum slew times.The dynamic programming algorithm is developed to find the global optimal solution.Experiment results show that the effectiveness of the proposed approach.

CLC Number: 

[an error occurred while processing this directive]