Modeling the scheduling problem of multi-satellites based on the constraint satisfaction

The satellite scheduling is a main content of the space resource management, and it is also a complex resource allocation problem. The constraint satisfaction problem (CSP) is a good method to it. The constraints on the scheduling problem of multi-satellites are analyzed based on the constraint satisfaction problem firstly, including task constraints, bundled constraints and exclusion constraints. On this basis, modeling is made. An example is given for the earth observation satellites at last.