Multi Satellites Scheduling Problem for Area Target Based on Grid

Abstract

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.

Research on Power Data and Transmission Service Based on Satellite Resource Scheduling Algorithm

“…Besides, due to the increase in the number of nodes and coverage in existing distributed power monitoring, resource optimization scheduling has become very challenging. [7] The current intelligent technology search method is continuously optimized and upgraded on the basis of the original. With the scheduling method as the starting point, the optimized part is to achieve intelligent operation by means of numerical calculation.…”