对地观测DSS任务分配问题的CSP模型与算法  

CSP Model and Algorithm on Task Allocation for Earth Observation DSS

作　　者：高黎[1] 李志猛[2] 

机构地区：[1]后勤工程学院后勤信息工程系,重庆401311 [2]国防科学技术大学信息系统与管理学院,长沙410073

出　　处：《空间科学学报》2012年第2期251-256,共6页Chinese Journal of Space Science

基　　金：国家自然科学基金项目资助(70871118)

摘　　要：任务分配是对地观测分布式卫星系统(Distributed Satellites System,DSS)自主协作运行过程中的一个重要环节.针对任务分配中的约束满足问题(Constraint Satisfaction Problem,CSP),以DSS完成任务总耗能最少为原则,构建了任务分配问题的CSP模型,并引入MAS理论中的合同网协议,给出模型的求解算法,通过仿真算例对模型和算法进行了验证.With the vigorous development of small satellite technology, there is an increasing desire to use multiple, highly autonomous, earth observation small satellites working together to complete more complicated earth observation missions through autonomous collaboration. Distributed Satel- lites System （DSS） composed by several small satellites is envisioned in the near future because of its capability of higher performance, lower cost, better fault tolerance, reconfigurability and upgrad- ability. Considering the characteristics of autonomous operation cooperatively for DSS in future, the task allocation becomes a very important process in the operation. In the paper, with the principle of lowest general energy-consumption for completing observation task, a model for Constraint Satis- faction Problem （CSP） on task allocation was put forward by analyzing the features of observation task for DSS. Based on it, citing contract net protocol in MAS theory, an algorithm was presented to solve the model and an example of the earth observation satellites was given to validate the model and algorithm at last.

关 键 词：分布式卫星系统 对地观测 任务分配 约束满足 

分 类 号：V57[航空宇航科学与技术—航空宇航推进理论与工程]