节点文献

多兵种联合作战战役任务计划方法研究

Research on Algorithm of Task Planning in Joint Campaign

【作者】 鲁音隆

【导师】 戴长华;

【作者基本信息】 国防科学技术大学 , 管理科学与工程, 2004, 硕士

【摘要】 由于多兵种联合作战战役任务计划的高度不确定性、复杂性以及时间紧迫性等特点,使联合作战任务计划成为作战指挥不可缺少的过程。在当前多兵种联合作战过程中,利用计算机进行联合作战任务计划的辅助生成,是提高指挥员的谋略水平与提高指挥能力,促进决策更加科学化和军事理论研究发展的重要手段。但应用于任务计划的算法还比较零乱,不成体系,更谈不上标准,这也不同程度地降低了作战指挥人员决策的高效性。本文以登岛作战为案例,首先在作战使命下达后,对总使命进行了任务分解,使之成为可具体执行的子任务。然后,对各子任务进行平台资源分配,而这一过程中要解决的关键问题是在平台资源发生冲突的情况下,如何进行任务调度,才能减少冲突、提高任务的分配和执行效率,目前常用来解决这一问题的算法是MDLS算法,本文对此算法进行了详细的描述和研究,指出了其中的不足之处,并从不同角度对MDLS算法进行了改进研究。同时,初步实现了算法运行的模拟系统。

【Abstract】 Because of the uncertainty, complexity and time pressure of the task planning in joint campaign, task planning in joint campaign has been indispensable to campaign command. During the joint campaign, using computer to help making the plan of the mission is necessary. It is the important means to enhance the competence of the compere in ruse and command, to promote the decision-making more scientific and to accelerate the development of the martial theory. But the algorithm of task planning is comparatively disorderly and is to say nothing of standard. This reduces the efficiency of decision-making of the campaign compere. This paper takes an example of the campaign of island landing, decomposes the mission into the subtasks which can be performed immediately after the mission is being delivered. Then, the key problem to be solved in platform resource assigning in joint campaign is how to attemper the subtasks can reduce the platform resource conflicts and increase the efficiency in assigning and performing the subtasks. Currently, MDLS algorithm is usually used to solve the problem. This paper introduces the MDLS algorithm in detail, also points out its deficiency and improves the algorithm in different point of view. The simulating system to run the algorithm has been realized.

  • 【分类号】E827
  • 【被引频次】14
  • 【下载频次】867
节点文献中: 

本文链接的文献网络图示:

本文的引文网络