Cooperative Dynamic Weapon-target Assignment Algorithm of Multiple Missiles Based on Networks

target by itself, the capture probability will be less than
the probability in the case when the missile can detect the
target by itself, because of the delay and dropout of the
Cooperative Dynamic Weapon-target Assignment Algorithm of Multiple Missiles Based on Networks
Chen Peng, Xing Liu, Xiaomin Mu, Yang Du, Sentang Wu
School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China E-mail: penson@
data package in communication process. We simplify the
capture probability in the two cases respectively and
obtain the following expression:
­ p detect the target by the missile itself
This work is supported by Chinese ‘‘Eleventh Five Years Plan’’ national defense basic research item.
can be evaluated by the tactics geometry relationship between the missiles and the targets. The relationship includes the angle, distance, velocity, etc, between the missiles and the targets. The non-parameter method is adopted widely in practice because it is convenient to compute in real time. In this paper, we adopt the non-parameter method to build the mathematic model based on the relative angle, distance, velocity between the missiles and the targets. The capture probability of the missile to the target and the match relationship between the type of seeker and the radiation type of the target are also considered in the mathematic model.
each other by the networks. We can assume that there is a
super seeker which has a larger detection range in the
formation. However, if the missile can not detect the
S c
=
® sc ¯p
nc
obtain
the
target
information
by
the
(1) networks
Where, pnc is a stochastic variable which value depends
on the state of the networks and pnc < psc .
2 MATHEMATIC MO来自EL OF DWTAThe methods adopted generally to build the mathematic model of DWTA are parameter method and non-parameter method[7]. In the parameter method, the character distributions of the targets are required and the dominance value of the missiles to the targets can be evaluated by using Bayes method. In the non-parameter method, the dominance value of the missiles to the targets
978-1-4244-2723-9/09/$25.00 c 2009 IEEE
126
ηT
velocity is VT ; the distance between the missile and the target is r ; LOS is the line of sight between the missile and the target, the angle between V and LOS is η ;
2.2 Angle Dominance Function
Assume that the relative movement relationship between the missile and the target is shown in the figure 1. Where, M is the missile, its velocity is V ; T is the target, its
Key Words: dynamic weapon-target assignment; cooperative; tabu search; auction
1 INTRODUCTION∗
The cooperative guidance and attack of the multi-missiles formation are studied widely in recent years. The proper DWTA result is important for the cooperative attack to the group of targets. By the proper DWTA, the damage probability of the target group can be improved greatly and the repeat attack and miss attack to the targets can be avoided. DWTA is a nondeterministic polynomial problem which can be resolved by Hungary algorithm, exhaustion algorithm as well as its improved algorithm, simulated annealing algorithm, genetic algorithm and tabu search algorithm[1-6]. However, if the number of weapons or targets are large, it is difficult to solve these type of problems in the desired real time because the computation cost is considerable. To resolve this problem, we present a simple and effective algorithm which takes a little time to obtain the initial suboptimum solution. Then, if time allows, this initial suboptimum solution can be amended by searching the better solution based on the improved algorithm. This paper is organized as follows. In Section II, the mathematical model of DWTA problem is built. The one-round auction algorithm and its improved algorithm based on tabu search algorithm are presented in Section III. Section IV presents the simulation tests and related results. Section V gives some conclusions.
Abstract: To find a proper assignment of weapons to targets with the objective of maximizing the damage of the target group, the cooperative dynamic weapon-target assignment (CDWTA) problem of multi-missiles formation is studied. By using the information shared by networks, the dominance matrix is modeled based on the relationship between the missiles and targets. Then, to obtain the dynamic weapon-target assignment (DWTA) result of the individual missile in the desired time, the simple and effective auction algorithm around a circle and its improved algorithm based on tabu search (TS) are presented. Finally, the DWTA results of all missiles in the formation are considered by sharing the information, and the CDWTA result of the missiles formation can be obtained under the majority rule. The simulation results show the effectiveness of the proposed approach.