A new efficient algorithm for optimal assignment of smart weapons to targets

Bogdanowicz, Zbigniew R.

doi:10.1016/j.camwa.2009.07.082

Cited by 39 publications

(22 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [1] and [5] the effect of advanced sensors has been studied in army amendment systems and their communication way has been introduced. In [6] and [7] the authors have studied the optimal allocation of intelligent amendments to targets for full coverage of targets. These amendments could be unmanned buoyant, mine or airplane with communicative capability.…”

Section: Intelligent Sensors and Amendmentsmentioning

confidence: 99%

Distributed explosion management of marine mines for destroying mobile targets in intelligent mines ad-hoc network using adaptive fuzzy logic

Lonbar¹,

Pashazadeh

2013

2013 13th Iranian Conference on Fuzzy Systems (IFSC)

View full text Add to dashboard Cite

A distributed algorithm to manage explosion of localized marine mines with aim of creating specified destruction on mobile targets by explosion of minimum required mines is presented in this article. At first, the problem of selecting a minimum number of marine mines is mapped to a dual predictor leaky bucket-tub problem with considering speed of targets. Then, a greedy algorithm based on adaptive fuzzy logic is presented for selecting minimum number of mines to ensure creation of specified damage on targets. The proposed algorithm is simulated in MATLAB software and the results of analysis and their comparisons are presented for proposed algorithms.

show abstract

Section: Intelligent Sensors and Amendmentsmentioning

confidence: 99%

Distributed explosion management of marine mines for destroying mobile targets in intelligent mines ad-hoc network using adaptive fuzzy logic

Lonbar¹,

Pashazadeh

2013

2013 13th Iranian Conference on Fuzzy Systems (IFSC)

View full text Add to dashboard Cite

show abstract

“…Kwon et al, [11] considered a new weapon-target allocation problem with the objective of minimizing the overall cost of weapons and also presented a branch and price algorithm as a solution approach. Bogdanowicz [12] proposed an efficient algorithm to optimally assign smart sensors and weapons to targets, this algorithm is derived from the well-known auction algorithm. In a recent thesis [13], the author considered air-to-ground missiles in WTA and built many interesting models to handle the scenarios.…”

Section: Introductionmentioning

confidence: 99%

An optimal assignment of multi-type weapons to single-target

et al. 2015

2015 IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

View full text Add to dashboard Cite

The weapon target assignment (WTA) problem is to find a proper assignment of weapons to the enemy's targets with the objective of minimizing the total expected survival value of the targets. The problem can be formulated as a nonlinear integer programming problem, and is proven to be NP-hard. In this paper, we focus on the case where the defense has multi-type weapons and the offense (the enemy) has only one target. We first formulate this problem as a nonlinear integer programming model. Then we demonstrate that this model can be equivalently transformed as a linear integer problem. Thus the optimal solution can be easily obtained via solving this linear integer problem. Finally, we illustrate this problem and its solving method via a concrete example.

show abstract

“…Currently, an efficient polynomial time algorithm for the MCF problem was proposed by Orlin [12] and Vygen [13]. Some theoretical results and algorithms are given in [14][15][16][17][18] for solving the MCF problem or its variants.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Algorithm for Solving Minimum Cost Flow Problem with Complementarity Slack Conditions

Zhao

Liu

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper presents an algorithm for solving a minimum cost flow (MCF) problem with a dual approach. The algorithm holds the complementary slackness at each iteration and finds an augmenting path by updating node potential iteratively. Then, flow can be augmented at the original network. In contrast to other popular algorithms, the presented algorithm does not find a residual network, nor find a shortest path. Furthermore, our algorithm holds information of node potential at each iteration, and we update node potential within finite iterations for expanding the admissible network. The validity of our algorithm is given. Numerical experiments show that our algorithm is an efficient algorithm for the MCF problem, especially for the network with a small interval of cost of per unit flow.

show abstract

A new efficient algorithm for optimal assignment of smart weapons to targets

Cited by 39 publications

References 4 publications

Distributed explosion management of marine mines for destroying mobile targets in intelligent mines ad-hoc network using adaptive fuzzy logic

Distributed explosion management of marine mines for destroying mobile targets in intelligent mines ad-hoc network using adaptive fuzzy logic

An optimal assignment of multi-type weapons to single-target

An Efficient Algorithm for Solving Minimum Cost Flow Problem with Complementarity Slack Conditions

Contact Info

Product

Resources

About