DocumentCode :
2849971
Title :
A fast dynamic algorithm for area target scheduling of remote satellite
Author :
Peng, Gao ; Yuejin, Tan ; Feng, Yao
Author_Institution :
Manage. Sci. & Engering Sch., Nat. Univ. of Defence Technol., Changsha, China
fYear :
2012
fDate :
24-27 June 2012
Firstpage :
71
Lastpage :
73
Abstract :
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.
Keywords :
artificial satellites; remote sensing; statistical analysis; area target scheduling; complex polygon; fast area coverage; fast dynamic algorithm; grid statistical method; remote satellite; Gold; Satellites; Strips; area target scheduling; grid statistical method; heuristically algorithm; remote satellite;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical & Electronics Engineering (EEESYM), 2012 IEEE Symposium on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4673-2363-5
Type :
conf
DOI :
10.1109/EEESym.2012.6258590
Filename :
6258590
Link To Document :
بازگشت