摘要
针对作战任务和作战资源的匹配问题,提出了一种匹配模型及其求解算法。首先分析了作战任务和资源的属性,建立了匹配问题的约束满足模型。基于改进的多优先级动态列表规划算法提出了一种匹配模型的求解算法,并结合实例进行了分析验证。结果表明,算法中引入任务与资源选择优先权参数,可以有效消解优先权冲突,增加匹配的灵活性。
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.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2008年第9期1712-1716,共5页
Systems Engineering and Electronics
基金
装备预研重点项目基金资助课题(6140538)
关键词
任务资源匹配
约束满足模型
改进的多优先级动态列表规划算法
冲突消解
match between operational task and resource task
CSP model
improved multiPRI list dynamic scheduling
confliction elimination