Research On Algorithm Of Task Planning In Joint Campaign

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.