分布式卫星系统动态任务协同规划算法研究

Distributed Satellite System Dynamic Task Collaborative Assignment Algorithm

分布式卫星系统的发展给任务规划带来挑战,传统的集中式任务规划方法越来越难以满足卫星数量多、任务动态、任务量大的需求,同时集中式的方法也存在鲁棒性不足的缺点.本文结合实际工程约束和应用需求,针对通信网络受限的条件,设计了一种基于贪婪算法与合同网协作的分布式卫星系统动态任务规划算法,并针对典型应用场景对算法的有效性进行了仿真验证和分析,结果表明该算法的任务完成度及通信需求都明显低于传统合同网算法,具有较高的工程实用价值.

The development of distributed satellite systems brings challenges to mission planning.The traditional centralized mission planning methods are increasingly difficult to meet the needs of large number of satellites,dynamic mission,and large mission volume.At the same time,centralized methods also have the disadvantage of insufficient robustness.Combining actual engineering constraints and application requirements,this paper designs a dynamic mission planning algorithm for distributed satellite systems based on greedy algorithm and contract network for the limited conditions of communication networks,and evaluates the effectiveness of the algorithm for typical application scenarios.The simulation verification and analysis show that the task completion degree and communication requirements of the algorithm are significantly lower than those of the traditional contract network algorithm.