Abstract
The observation task scheduling of Earth Observation Satellites (EOSs) is a complex combinatorial optimization problem. Current researches mainly deal with this problem on the assumption that one target only need to be observed once. However, with the development of remote sensing data applications, some new observation requests appear, which need EOSs take image to a target periodically. Considering the characteristic of the problem, a constraint satisfaction problem model with two objective functions is established. Furthermore, a satellite periodic continuous observation task scheduling algorithm based on multiobjective evolutionary algorithm is proposed. Finally, some experiments are implemented to validate correctness and practicability of our algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
