检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科技大学C~4ISR技术重点实验室,湖南长沙410073 [2]装备论证研究中心,北京100101
出 处:《系统工程与电子技术》2008年第9期1712-1716,共5页Systems Engineering and Electronics
基 金:装备预研重点项目基金资助课题(6140538)
摘 要:针对作战任务和作战资源的匹配问题,提出了一种匹配模型及其求解算法。首先分析了作战任务和资源的属性,建立了匹配问题的约束满足模型。基于改进的多优先级动态列表规划算法提出了一种匹配模型的求解算法,并结合实例进行了分析验证。结果表明,算法中引入任务与资源选择优先权参数,可以有效消解优先权冲突,增加匹配的灵活性。To solve the problem of matching between operational tasks and resources, a match model and its solving algorithm are presented. First, the property of operational tasks and the attribute of operational resources are pointed out and analyzed, and then the model of the matching problem is set up. At the same time, the solving algorithm for the model is put forward based on the multiPRI list dynamic scheduling (MPLDS), which introduces the priority parameter of operational tasks and resources. Finally, the model and algorithm are validated by an example, and the conclusion shows that the algorithm can decrease the conflict of priority and increases the agility of the matching result.
关 键 词:任务资源匹配 约束满足模型 改进的多优先级动态列表规划算法 冲突消解
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249