Skip to Main Content
The Earth observation satellites scheduling problem (SMS) involves scheduling tasks to be performed by a satellite, where new task requests can arrive at any time, non-deterministically, and must be scheduled in real-time. This paper describes a new satellite mission scheduling algorithm based on constraint satisfaction problem (CPP). We describe the dynamic scheduling problem as a dynamic weighted maximal CSP in which constraints can be changed dynamically. It is usually undesirable to drastically modify the previous schedule in the re-scheduling process. This paper presents a new satellite mission scheduling problem based on constraint satisfaction problem (SMSCSP). The simulation results show that the proposed approach is effective and efficient in applications to the real problems.
Computer Science and Software Engineering, 2008 International Conference on (Volume:4 )
Date of Conference: 12-14 Dec. 2008