在轨运行卫星的智能规划调度算法

在轨卫星的智能规划可以归结为资源受限的实时规划和调度问题，由于此类问题的规
模大，实时性要求强，通常的解法很难满足应用要求。本文针对该问题的特点，建立了问题的数学模型，包括知识表示、目标函数等。提出了三种启发式的规划算法，并对算法特点进行了比较分析，具体应用时，可以根据问题的不同特点选用相应的算法，从快速性和准确性两方面适应系统要求。最后本文通过一个算例，从统计特性角度分析了三种算法，验证了算法的正确性。
关键词: 智能规划；启发式算法；资源约束；实时性
【Abstract】The intelligence scheduling and planning for on-board satellite belongs to scheduling problem under resources constrains. The problem is about large amount of tasks, and have tight real-time deadlines, so the common algorithm is hard to satisfy the requirement. This paper presents three kinds of heuristic algorithms, and make the fully analysis. In application, we can choose the proper algorithm base on the feature of the problem. Finally, Simulation results show the feasibility of the algorithm.
【Key words】intelligence scheduling; heuristic algorithm； resource-constrained； real_time