Multi Satellites Scheduling Problem for Area Target based on Grid
This paper transfer the area target scheduling problem into maximal coverage problem based on summaring the traditional sovling problem.A MIP model is build based on problem characters; simulated anneanling problem is used to solve the problem.Four neighborhood and tow differentiation mechanisms are designed to fit the study problem,such as offset neighborhood.The relationship between coverage and overlap and division angle is analysised by test data,and algorithm validation and effective is test based on example data.
Earth Observation Satellite Area Target scheduling problem Simulated Annealing Algorithm
GAO Peng TAN Yuejin
National University of Defense Technology Management Science and Engering Scheool Changsha, Hunan, China, 410073
国际会议
三亚
英文
1873-1877
2013-06-22(万方平台首次上网日期,不代表论文的发表时间)