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

Intelligent Autonomous Decision-Making and Cooperative Control Technology of High-Speed Vehicle Swarms

This book is a reprint of the Special Issue “Intelligent Autonomous Decision-Making and Cooperative Control Technology of High-Speed Vehicle Swarms”,which was published in Applied Sciences

Multi-Objective UAV Mission Planning Using Evolutionary Computation

This investigation purports to develop a new model for multiple autonomous aircraft mission routing. Previous research both related and unrelated to this endeavor have used classic combinatoric problems as models for Unmanned Aerial Vehicle (UAV) routing and mission planning. This document presents the concept of the Swarm Routing Problem (SRP) as a new combinatorics problem for use in modeling UAV swarm routing, developed as a variant of the Vehicle Routing Problem with Time Windows (VRPTW). The SRP removes the single vehicle per target restraint and changes the customer satisfaction requirement to one of vehicle on location volume. The impact of these alterations changes the vehicle definitions within the problem model from discrete units to cooperative members within a swarm. This represents a more realistic model for multi-agent routing as a real world mission plan would require the use of all airborne assets across multiple targets, without constraining a single vehicle to a single target. Solutions to the SRP problem model result in route assignments per vehicle that successfully track to all targets, on time, within distance constraints. A complexity analysis and multi-objective formulation of the VRPTW indicates the necessity of a stochastic solution approach leading to the development of a multi-objective evolutionary algorithm. This algorithm design is implemented using C++ and an evolutionary algorithm library called Open Beagle. Benchmark problems applied to the VRPTW show the usefulness of this solution approach. A full problem definition of the SRP as well as a multi-objective formulation parallels that of the VRPTW method. Benchmark problems for the VRPTW are modified in order to create SRP benchmarks. These solutions show the SRP solution is comparable or better than the same VRPTW solutions, while also representing a more realistic UAV swarm routing solution

Improving particle swarm optimization path planning through inclusion of flight mechanics

Military engagements are continuing the movement toward automated and unmanned vehicles for a variety of simple and complex tasks. This allows humans to stay away from dangerous situations and use their skills for more difficult tasks. One important piece of this strategy is the use of automated path planners for unmanned aerial vehicles (UAVs). Current UAV operation requires multiple individuals to control a single plane, tying up important human resources. Often paths are planned by creating waypoints for a vehicle to fly through, with the intention of doing reconnaissance while avoiding as much danger to the plane as possible. Path planners often plan routes without taking into consideration the UAV\u27s ability to perform the maneuvers required to fly the specified waypoints, instead relying upon them to fly as close as possible. This thesis presents a path planner solution incorporating vehicle mechanics to insure feasible flight paths. This path planner uses Particle Swarm Optimization (PSO) and digital pheromones to generate multiple three-dimensional flight paths for the operator to choose from. B-spline curves are generated using universal interpolation with each path waypoint representing a control point. The b-spline curve represents the flight path of the UAV. Each point along the curve is evaluated for fuel efficiency, threat avoidance, reconnaissance, terrain avoidance, and vehicle mechanics. Optimization of the flight path occurs based on operator defined performance characteristics, such as maximum threat avoidance or minimum vehicle dynamics cost. These performance characteristics can be defined for each unique aircraft, allowing the same formulation to be used for any aircraft. The vehicle mechanics conditions considered are pull-out, glide, climb, and steady, level, co-ordinate turns. Calculating the flight mechanics requires knowing the velocity and angle of the plane, calculated using the derivative of the point on the curve. The flight mechanics of the path allows the path planner to determine whether the path exceeds the maximum load factor (G-force), minimum velocity (stall velocity), or the minimum turning radius. Comparing the results between PSO Path Planner with flight mechanics and PSO Path Planner without flight mechanics over five scenarios indicates an increase in the feasibility of the returned paths. Visualizing the flight paths was improved by changing the original waypoint based visualization to a b-spline curve representation. Using b-spline curves allows for an accurate representation of the actual UAV flight path especially when considering turns. Operators no longer must create a mental representation of the flight path to match the waypoints

Optimal Control of an Uninhabited Loyal Wingman

As researchers strive to achieve autonomy in systems, many believe the goal is not that machines should attain full autonomy, but rather to obtain the right level of autonomy for an appropriate man-machine interaction. A common phrase for this interaction is manned-unmanned teaming (MUM-T), a subset of which, for unmanned aerial vehicles, is the concept of the loyal wingman. This work demonstrates the use of optimal control and stochastic estimation techniques as an autonomous near real-time dynamic route planner for the DoD concept of the loyal wingman. First, the optimal control problem is formulated for a static threat environment and a hybrid numerical method is demonstrated. The optimal control problem is transcribed to a nonlinear program using direct orthogonal collocation, and a heuristic particle swarm optimization algorithm is used to supply an initial guess to the gradient-based nonlinear programming solver. Next, a dynamic and measurement update model and Kalman filter estimating tool is used to solve the loyal wingman optimal control problem in the presence of moving, stochastic threats. Finally, an algorithm is written to determine if and when the loyal wingman should dynamically re-plan the trajectory based on a critical distance metric which uses speed and stochastics of the moving threat as well as relative distance and angle of approach of the loyal wingman to the threat. These techniques are demonstrated through simulation for computing the global outer-loop optimal path for a minimum time rendezvous with a manned lead while avoiding static as well as moving, non-deterministic threats, then updating the global outer-loop optimal path based on changes in the threat mission environment. Results demonstrate a methodology for rapidly computing an optimal solution to the loyal wingman optimal control problem

A review of task allocation methods for UAVs

Unmanned aerial vehicles, can offer solutions to a lot of problems, making it crucial to research more and improve the task allocation methods used. In this survey, the main approaches used for task allocation in applications involving UAVs are presented as well as the most common applications of UAVs that require the application of task allocation methods. They are followed by the categories of the task allocation algorithms used, with the main focus being on more recent works. Our analysis of these methods focuses primarily on their complexity, optimality, and scalability. Additionally, the communication schemes commonly utilized are presented, as well as the impact of uncertainty on task allocation of UAVs. Finally, these methods are compared based on the aforementioned criteria, suggesting the most promising approaches