Survey of the research on dynamic weapon-target assignment problem

Cai, Huaiping; Liu, Jingxu; Chen, Yingwu; Wang, Hao

doi:10.1016/s1004-4132(06)60097-2

Cited by 77 publications

(17 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to illustrate the WS-threat pair assignment schedules in Table 3, consider So-lution 13 10. This solution corresponds to eight WS-threat assignment pairs with an accumulated survival probability of 0.0399 at an assignment cost of R 3 170 000.…”

Section: Numerical Results Obtainedmentioning

confidence: 99%

See 1 more Smart Citation

A tri-objective, dynamic weapon assignment model for surface-based air defence

Lötter

Vuuren

2016

ORiON

View full text Add to dashboard Cite

In a military surface-based air defence environment, a fire control officer typically employs a computerised weapon assignment decision support subsystem to aid him in the assignment of available surface-based weapon systems to engage aerial threats in an attempt to protect defended surface assets -a problem known in the military operations research literature as the weapon assignment problem. In this paper, a tri-objective, dynamic weapon assignment model is proposed by modelling the weapon assignment problem as a multi-objective variation of the celebrated vehicle routing problem with time windows. A multi-objective, evolutionary metaheuristic for solving the vehicle routing problem with time windows is used to solve the model. The workability of this modelling approach is illustrated by solving the model in the context of a simulated, surface-based air defence scenario.

show abstract

Section: Numerical Results Obtainedmentioning

confidence: 99%

“…Although this formulation is generally considered to be a dynamic WAM, Huaiping et al [13] rightly criticised the formulation by pointing out that it merely involves solving a static WAM class problem repeatedly. Hence, it is placed on the boundary between the static and dynamic single-objective model classes in Figure 1.…”

Section: Literature Reviewmentioning

confidence: 99%

A tri-objective, dynamic weapon assignment model for surface-based air defence

Lötter

Vuuren

2016

ORiON

View full text Add to dashboard Cite

show abstract

“…3 (4, 7) and 7 (4,8)) should be in the different cluster (e.g., hills between the targets) in addition to the previous case (Eqn. (2) + Eqn.…”

Section: Resultsmentioning

confidence: 99%

“…The second related study is weapon target assignment (WTA) [7][8][9][10] (also known as target allocation and target problem). The WTA problem seeks to find the optimal allocation of friendly weapons to targets for minimising the expected survival value or maximising the expected damage of targets 10 .…”

Section: Related Studiesmentioning

confidence: 99%

Constrained Target Clustering for Military Targeting Process

2017

Def. Sc. Jl.

View full text Add to dashboard Cite

Constrained target clustering (CTC) is proposed to support the targeting decision-making in the network centric warfare environment. When area targets are detected by sensors, it is required to decide the points at which a missile or bomb is aimed to achieve operational goals. CTC can determine the optimal numbers and positions of aiming points by transforming the targeting problem into clustering-based optimisation problems. The CTC formulations include objective functions and constraints in consideration of area targets, protected objects, target-level background information, lethal radius, and required damage rate. The numerical example shows how to apply the CTC formulation given a sample data set. In order to compare the effects of different constraints, the demonstration explores from an unconstraint problem to constrained problems by adding constraints. The results show that CTC can effectively decide the aiming points with consideration of both targets and capabilities of friendly weapons, and serve as a targeting decision support system in the network centric warfare environment.

show abstract

“…The timeliness of weaponstarget assignment and the quality of scheme directly influence the effect of the combat. Therefore, people have made a lot of algorithms to solve this problem: Firstly, traditional algorithms, including implicit enumeration method, the branch and bound method, cutting plane method, the dynamic programming, etc; Secondly, intelligent algorithms, such as simulated annealing algorithm, neural network algorithm, genetic algorithm, ant colony algorithm, etc; Thirdly, the algorithm which is combined with two kinds of algorithms is used to solve the problem [1].…”

Section: Introductionmentioning

confidence: 99%

ACGA Algorithm of Solving Weapon - Target Assignment Problem

Zhang¹,

Wang²,

Xu³

et al. 2012

OJAppS

View full text Add to dashboard Cite

Abstract-Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integration of genetic algorithm and ant colony algorithm then use ACGA algorithm to solve the Weapon-Target Assignment Problem. Calculations show that: when ACGA algorithm is used to solve Weapon -Target Assignment Problem, it has fast convergence and high accuracy.

show abstract

Survey of the research on dynamic weapon-target assignment problem

Cited by 77 publications

References 8 publications

A tri-objective, dynamic weapon assignment model for surface-based air defence

A tri-objective, dynamic weapon assignment model for surface-based air defence

Constrained Target Clustering for Military Targeting Process

ACGA Algorithm of Solving Weapon - Target Assignment Problem

Contact Info

Product

Resources

About