在軌運(yùn)行衛(wèi)星的智能規(guī)劃調(diào)度算法

在軌衛(wèi)星的智能規(guī)劃可以歸結(jié)為資源受限的實(shí)時(shí)規(guī)劃和調(diào)度問(wèn)題，由于此類問(wèn)題的規(guī)
模大，實(shí)時(shí)性要求強(qiáng)，通常的解法很難滿足應(yīng)用要求。本文針對(duì)該問(wèn)題的特點(diǎn)，建立了問(wèn)題的數(shù)學(xué)模型，包括知識(shí)表示、目標(biāo)函數(shù)等。提出了三種啟發(fā)式的規(guī)劃算法，并對(duì)算法特點(diǎn)進(jìn)行了比較分析，具體應(yīng)用時(shí)，可以根據(jù)問(wèn)題的不同特點(diǎn)選用相應(yīng)的算法，從快速性和準(zhǔn)確性兩方面適應(yīng)系統(tǒng)要求。最后本文通過(guò)一個(gè)算例，從統(tǒng)計(jì)特性角度分析了三種算法，驗(yàn)證了算法的正確性。
關(guān)鍵詞: 智能規(guī)劃；啟發(fā)式算法；資源約束；實(shí)時(shí)性
【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