Scheduling of Earth observing satellites using distributed constraint optimization

Abstract Earth observation satellites (EOS) are satellites equipped with optical sensors that orbit the Earth to take photographs of particular areas at the request of users. With the development of space technology, the number of satellites has increased continuously. Yet still, the number of satellites cannot meet the explosive growth of applications. Thus, scheduling solutions are required to satisfy requests and obtain high observation efficiency. While the literature on multi-satellite scheduling is rich, most solutions are centralized algorithms. However, due to their cost, EOS systems are often co-funded by several agents (e.g., countries, companies, or research institutes). Central solutions require that these agents share their requests for observations with others. To date, there has yet to be a solution for EOS scheduling that protects the private information of the interested parties. In this study, we model the EOS scheduling problem as a distributed constraint optimization problem (DCOP). This modeling enables the generation of timetables for the satellites in a distributed manner without a priori sharing users’ private information with some central authority. For solving the resulting DCOP, we use and compare the results of two different local search algorithms—Distributed Stochastic Algorithm and Maximum Gain Message—which are known to produce efficient solutions in a timely manner. The modeling and solving of the resulting DCOP constitute our new solution method, which we term Distributed Satellite Timetable Solver ( DSTS ). Experimental evaluation reveals that the DSTS method provides solutions of higher quality than a commonly used centralized greedy algorithm and is comparable to an additional centralized algorithm that we propose.