基于约束满足的多星对区域目标观测活动协同

Using Constraint Satisfaction to Cooperate Satellites' Activities for the Mission of Area Target Observation

多星对区域目标观测活动的协同问题是卫星任务规划与调度领域的新问题。讨论了采用多星协同模式观测区域目标的必要性,描述了协同问题的研究内容。基于约束满足理论,建立了多星协同问题的约束优化问题模型,提出了一种禁忌算法与约束传播相结合的求解机制。最后,以仿真算例验证了模型与算法的正确性和优化性能。

The problem of how to cooperate the activities of satellites for the mission of observing area target is a new problem which is arises in the field of satellites＇ planning and scheduling recently. This paper introduced the necessity of using multiple satellites to observe target in cooperation mode, and described the problem of scheduling. Based on the idea of constraint satisfaction, this paper constructed constraint optimization problem （COP） model, and proposed a mechanism of scheduling mixed tabu search algorithm and constraint propagation. The result of simulation experiment demonstrates the feasibility and optimality of the proposed model and algorithm.