A fast dynamic algorithm for area target scheduling of remote satellite

This paper analysis advantages and disadvantages of traditional methods for area target scheduling of remote satellite, a dynamic algorithm for area target scheduling of remote satellites is proposed. This problem is simplified by splitting area into strips, fast area coverage and overlap is proposed by counting grid in complex polygon. Finally, the algorithm is test availability and validity by different data with different satellite and different area target.