A Two-Step Optimisation Method for Dynamic Weapon Target Assignment Problem

International audienceno abstrac

Approximate Dynamic Programming for Military Resource Allocation

This research considers the optimal allocation of weapons to a collection of targets with the objective of maximizing the value of destroyed targets. The weapon-target assignment (WTA) problem is a classic non-linear combinatorial optimization problem with an extensive history in operations research literature. The dynamic weapon target assignment (DWTA) problem aims to assign weapons optimally over time using the information gained to improve the outcome of their engagements. This research investigates various formulations of the DWTA problem and develops algorithms for their solution. Finally, an embedded optimization problem is introduced in which optimization of the multi-stage DWTA is used to determine optimal weaponeering of aircraft. Approximate dynamic programming is applied to the various formulations of the WTA problem. Like many in the field of combinatorial optimization, the DWTA problem suffers from the curses of dimensionality and exact solutions are often computationally intractability. As such, approximations are developed which exploit the special structure of the problem and allow for efficient convergence to high-quality local optima. Finally, a genetic algorithm solution framework is developed to test the embedded optimization problem for aircraft weaponeering

Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints

This article investigates the task planning problem where one vehicle needs to visit a set of target locations while respecting the precedence constraints that specify the sequence orders to visit the targets. The objective is to minimize the vehicle’s total travel distance to visit all the targets while satisfying all the precedence constraints. We show that the optimization problem is NP-hard, and consequently, to measure the proximity of a suboptimal solution from the optimal, a lower bound on the optimal solution is constructed based on the graph theory. Then, inspired by the existing topological sorting techniques, a new topological sorting strategy is proposed; in addition, facilitated by the sorting, we propose several heuristic algorithms to solve the task planning problem. The numerical experiments show that the designed algorithms can quickly lead to satisfying solutions and have better performance in comparison with popular genetic algorithms

An Algorithm for Exchanging Target Asset Pairs using the Kidney Exchange Model

Since chemical, biological, radiological, nuclear, and high yield explosive (CBRNE) attacks can cause catastrophic damage, it is important to detect and eliminate the means of attack at the origin. In surveillance operations, efficient allocation of friendly intelligence assets and enemy targets is critical for continuous and reliablemonitoring. In this research, we investigate a mathematical model for exchanging target–asset pairs when there are sudden changes in various operational environments. For this task, we refer to the kidney exchange model as a benchmark. In particular, the methods for constructing and solving the target–asset exchange problem in near realtime are presented. Additionally, we introduce the methodology and results for obtaining a feasible solution of the weapon target assignment problem using the exchange model. Our method can facilitate decisions in reconnaissance operations, especially when countless targets and assets are intricately intertwined in future battlefield scenarios

Real-Time Heuristics and Metaheuristics for Static and Dynamic Weapon Target Assignments

The problem of targeting and engaging individual missiles (targets) with an arsenal of interceptors (weapons) is known as the weapon target assignment problem. This problem has been well-researched since the seminal work in 1958. There are two distinct categories of the weapon target assignment problem: static and dynamic. The static weapon target assignment problem considers a single instance in which a known number of incoming missiles is to be engaged with a finite number of interceptors. By contrast, the dynamic weapon target assignment problem considers either follow on engagement(s) should the first engagement(s) fail, a subsequent salvo of incoming missiles, or both. This research seeks to define and solve a realistic dynamic model. First, assignment heuristics and metaheuristics are developed to provide rapid near-optimal solutions to the static weapon target assignment. Next, a technique capable of determining how many of each interceptor type to reserve for a second salvo by means of approximate dynamic programming is developed. Lastly, a model that realistically considers erratic flight paths of incoming missiles and determines assignments and firing sequences of interceptors within a simulation to minimize the number of hits to a protected asset is developed. Additionally, the first contemporary survey of the weapon target assignment problem since 1985 is presented. Collectively, this work extends the research of missile defense into practical application more so than currently is found within the literature

Minimization of Collateral Damage in Airdrops and Airstrikes

Collateral damage presents a significant risk during air drops and airstrikes, risking citizens\u27 lives and property, straining the relationship between the United States Air Force and host nations. This dissertation presents a methodology to determine the optimal location for making supply airdrops in order to minimize collateral damage while maintaining a high likelihood of successful recovery. A series of non-linear optimization algorithms is presented along with their relative success in finding the optimal location in the airdrop problem. Additionally, we present a quick algorithm for accurately creating the Pareto frontier in the multi-objective airstrike problem. We demonstrate the effect of differing guidelines, damage functions, and weapon employment selection which significantly alter the location of the optimal aimpoint in this targeting problem. Finally, we have provided a framework for making policy decisions in fast-moving troops-in-contact situations where observers are unsure of the nature of possible enemy forces in both finite horizon and infinite horizon problems. Through the recursive technique of solving this Markov decision process we have demonstrated the effect of improved intelligence and differing weights for waiting and incorrect decisions in the face of uncertain situations

Designing Medical Treatment Protocols To Improve Healthcare Supply Chain Management

The primary goal of this research is to determine the strategic system integration opportunities for a segmented healthcare system with cost minimization and efficacy maximization objectives. This research is inspired in part by the Defense Logistics Agency, which is trying to assess the impact of integrating treatment selection processes across service clinicians. Specifically, physician bias, patient volumes, leveraging economies of scale or costing structures, and complex treatment efficacy calculations are considered by mathematically modeling three forms of integration. Multiple objective optimization problems are used to define efficient frontiers based on cost and treatment efficacy. A novel comparative analysis method is applied to measure improvements in efficient frontiers and a customized genetic algorithm solution is applied for the more complex treatment selection problem. Results indicate that more integrated treatment selection protocols lead to decreases in cost alongside increases in efficacy. Complex healthcare systems or systems with higher variability in performance factors are found to have the greatest opportunity for performance improvement

Optimization of Air Defense System Deployment Against Reconnaissance Drone Swarms

Due to their advantages in flexibility, scalability, survivability, and cost-effectiveness, drone swarms have been increasingly used for reconnaissance tasks and have posed great challenges to their opponents on modern battlefields. This paper studies an optimization problem for deploying air defense systems against reconnaissance drone swarms. Given a set of available air defense systems, the problem determines the location of each air defense system in a predetermined region, such that the cost for enemy drones to pass through the region would be maximized. The cost is calculated based on a counterpart drone path planning problem. To solve this adversarial problem, we first propose an exact iterative search algorithm for small-size problem instances, and then propose an evolutionary framework that uses a specific encoding-decoding scheme for large-size problem instances. We implement the evolutionary framework with six popular evolutionary algorithms. Computational experiments on a set of different test instances validate the effectiveness of our approach for defending against reconnaissance drone swarms

AFIT UAV Swarm Mission Planning and Simulation System

The purpose of this research is to design and implement a comprehensive mission planning system for swarms of autonomous aerial vehicles. The system integrates several problem domains including path planning, vehicle routing, and swarm behavior. The developed system consists of a parallel, multi-objective evolutionary algorithm-based path planner, a genetic algorithm-based vehicle router, and a parallel UAV swarm simulator. Each of the system\u27s three primary components are developed on AFIT\u27s Beowulf parallel computer clusters. Novel aspects of this research include: integrating terrain following technology into a swarm model as a means of detection avoidance, combining practical problems of path planning and routing into a comprehensive mission planning strategy, and the development of a swarm behavior model with path following capabilities

Agent-based Modeling Methodology for Analyzing Weapons Systems

Getting as much information as possible to make decisions about acquisition of new weapons systems, through analysis of the weapons systems\u27 benefits and costs, yields better decisions. This study has twin goals. The first is to demonstrate a sound methodology to yield the most information about benefits of a particular weapon system. Second, to provide some baseline analysis of the benefits of a new type of missile, the Small Advanced Capability Missile (SACM) concept, in an unclassified general sense that will help improve further, more detailed, classified investigations into the benefits of this missile. In a simplified, unclassified scenario, we show that the SACM provides several advantages and we demonstrate a basis for further investigation into which tactics should be used in conjunction with the SACM. Furthermore, we discuss how each of the chosen factors influence the air combat scenario. Ultimately, we establish the usefulness of a designed experimental approach to analysis of agent-based simulation models and how agent-based models yield a great amount of information about the complex interactions of different actors on the battlefield