By Topic

An Efficient Rule-Based Constructive Heuristic to Solve Dynamic Weapon-Target Assignment Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Bin Xin ; Sch. of Autom., Beijing Inst. of Technol., Beijing, China ; Jie Chen ; Zhihong Peng ; Lihua Dou
more authors

In this paper, we propose an efficient rule-based heuristic to solve asset-based dynamic weapon-target assignment (DWTA) problems. The main idea of the proposed heuristic is to utilize the domain knowledge of DWTA problems to directly achieve weapon assignment, without large number of function evaluations. We update the saturation states of constraints in the assignment process to guarantee the feasibility of generated solutions. For the purpose of testing the performance of the proposed heuristic, we build a general Monte Carlo simulation-based DWTA framework. For comparison, we also employ a Monte Carlo method (MCM) to make DWTA decisions in different defense scenarios. From simulations with DWTA instances under different scales, the heuristic has obvious advantages over the MCM with regard to solution quality and computation time. The proposed method can solve large-scale DWTA problems (e.g., those including 100 weapons, 100 targets, and four defense stages) within only a few seconds.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:41 ,  Issue: 3 )