摘要
基于启发式搜索和禁忌搜索技术 ,提出一种用于解决有限资源、不同重要性要求的任务路径规划问题的有效算法 ,通过对不同重要程度的任务进行分层调度 ,得到较为满意的决策结果。该算法具有搜索空间小、求解速度快的优点。
A method is presented based on heuristics and tabu search algorithms, which can solve scheduling problem of mission path planning with different priority and limit resource. Satisfying result can acquire by dividing the missions in different layers according to their priority and scheduling in these layers. The scheduling algorithm has the advantage of small searching space and high solving speed. The simulation results show the efficiency of the algorithm.
出处
《控制与决策》
EI
CSCD
北大核心
2002年第B11期773-776,共4页
Control and Decision
基金
航空基金科研项目 (98E5 10 0 9)
