基于约束满足的卫星地面站资源优化分配问题研究

卫星地面站资源优化分配问题是在给定的时间内,对卫星需要执行的任务分配地面站及执行时间,以便卫星能最大限度地完成任务。该文对该问题建立了CSP模型,并采用ILOGSolver对该模型进行求解。文中最后给出了一个应用实例,并比较了几种不同搜索算法和搜索策略的执行效率。

Apply Constraint Satisfaction to Optimal Allocation of Satellite Ground Station Resource

The satellite ground station resource allocation can be thought as a optimization problem,it maks possible to allocate execute time and station to satellites,so that which can complete tasks required.This paper gives a CSP model of the problem,and solves it with the help of ILOG Solver library.In this paper,the authors also give a application in-stance,and compare the computational results of different searching algorithms and searching strategies.