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

Valuing Persistent ISR Resources

AFCEA-GMU C4I Center Symposium, Challenges in C4I, George Mason University, Fairfax, VA., May 25This paper describes how to optimize PISR resources to maximize VIRT

Scheduling for Space Tracking and Heterogeneous Sensor Environments

This dissertation draws on the fields of heuristic and meta-heuristic algorithm development, resource allocation problems, and scheduling to address key Air Force problems. The world runs on many schedules. People depend upon them and expect these schedules to be accurate. A process is needed where schedules can be dynamically adjusted to allow tasks to be completed efficiently. For example, the Space Surveillance Network relies on a schedule to track objects in space. The schedule must use sensor resources to track as many high-priority satellites as possible to obtain orbit paths and to warn of collision paths. Any collisions that occurred between satellites and other orbiting material could be catastrophic. To address this critical problem domain, this dissertation introduces both a single objective evolutionary tasker algorithm and a multi-objective evolutionary algorithm approach. The aim of both methods is to produce space object tracking schedules to ensure that higher priority objects are appropriately assessed for potential problems. Simulations show that these evolutionary algorithm techniques effectively create schedules to assure that higher priority space objects are tracked. These algorithms have application to a range of dynamic scheduling domains including space object tracking, disaster search and rescue, and heterogeneous sensor scheduling

Planning Coverage of Points of Interest via Multiple Imaging Surveillance Assets: A Multi-Model Approach

For the United States to maintain information superiority, it is necessary to have a means of allocating intelligence-gathering assets to collect information on particular points of interest. In today\u27s geopolitical environment, however, the number of points of interest is growing rapidly, whereas the number of available assets is not. To aid in maintaining information superiority, this research explores the use of a Multi-Modal Goal Programming Resource Constrained Project Scheduling approach for allocating imaging surveillance assets (land, air, sea, and space) to a set of points of interest for a given time period. The multiple objectives of this formulation are to minimize the number of points of interest not covered at any time during the required period, minimize the deviation from the minimum image resolution of each point of interest, and minimize the time between successive imaging assets imaging each point of interest

Optimization of Airfield Parking and Fuel Asset Dispersal to Maximize Survivability and Mission Capability Level

While the US focus for the majority of the past two decades has been on combatting insurgency and promoting stability in Southwest Asia, strategic focus is beginning to shift toward concerns of conflict with a near-peer state. Such conflict brings with it the risk of ballistic missile attack on air bases. With 26 conflicts worldwide in the past 100 years including attacks on air bases, new doctrine and modeling capacity are needed to enable the Department of Defense to continue use of vulnerable bases during conflict involving ballistic missiles. Several models have been developed to date for Air Force strategic planning use, but these models have limited use on a tactical level or for civil engineer use. This thesis presents the development of a novel model capable of identifying base layout characteristics for aprons and fuel depots to maximize dispersal and minimize impact on sortie generation times during normal operations. This model is implemented using multi-objective genetic algorithms to identify solutions that provide optimal tradeoffs between competing objectives and is assessed using an application example. These capabilities are expected to assist military engineers in the layout of parking plans and fuel depots that ensure maximum resilience while providing minimal impact to the user while enabling continued sortie generation in a contested region

Optimal Mission Planning of Autonomous Mobile Agents for Applications in Microgrids, Sensor Networks, and Military Reconnaissance

As technology advances, the use of collaborative autonomous mobile systems for various applications will become evermore prevalent. One interesting application of these multi-agent systems is for autonomous mobile microgrids. These systems will play an increasingly important role in applications such as military special operations for mobile ad-hoc power infrastructures and for intelligence, surveillance, and reconnaissance missions. In performing these operations with these autonomous energy assets, there is a crucial need to optimize their functionality according to their specific application and mission. Challenges arise in determining mission characteristics such as how each resource should operate, when, where, and for how long. This thesis explores solutions in determining optimal mission plans around the applications of autonomous mobile microgrids and resource scheduling with UGVs and UAVs. Optimal network connections, energy asset locations, and cabling trajectories are determined in the mobile microgrid application. The resource scheduling applications investigate the use of a UGV to recharge wireless sensors in a wireless sensor network. Optimal recharging of mobile distributed UAVs performing reconnaissance missions is also explored. With genetic algorithm solution approaches, the results show the proposed methods can provide reasonable a-priori mission plans, considering the applied constraints and objective functions in each application. The contributions of this thesis are: (1) The development and analysis of solution methodologies and mission simulators for a-priori mission plan development and testing, for applications in organizing and scheduling power delivery with mobile energy assets. Applying these methods results in (2) the development and analysis of reasonable a-priori mission plans for autonomous mobile microgrids/assets, in various scenarios. This work could be extended to include a more diverse set of heterogeneous agents and incorporate dynamic loads to provide power to

Sensor Resource Management: Intelligent Multi-objective Modularized Optimization Methodology and Models

The importance of the optimal Sensor Resource Management (SRM) problem is growing. The number of Radar, EO/IR, Overhead Persistent InfraRed (OPIR), and other sensors with best capabilities, is limited in the stressing tasking environment relative to sensing needs. Sensor assets differ significantly in number, location, and capability over time. To determine on which object a sensor should collect measurements during the next observation period k, the known algorithms favor the object with the expected measurements that would result in the largest gain in relative information. We propose a new tasking paradigm OPTIMA for sensors that goes beyond information gain. It includes Sensor Resource Analyzer, and the Sensor Tasking Algorithm (Tasker). The Tasker maintains timing constraints, resolution, and geometric differences between sensors, relative to the tasking requirements on track quality and the measurements of object characterization quality. The Tasker does this using the computational intelligence approach of multi-objective optimization, which involves evolutionary methods

A Comprehensive Insight into Game Theory in relevance to Cyber Security

The progressively ubiquitous connectivity in the present information systems pose newer challenges tosecurity. The conventional security mechanisms have come a long way in securing the well-definedobjectives of confidentiality, integrity, authenticity and availability. Nevertheless, with the growth in thesystem complexities and attack sophistication, providing security via traditional means can beunaffordable. A novel theoretical perspective and an innovative approach are thus required forunderstanding security from decision-making and strategic viewpoint. One of the analytical tools whichmay assist the researchers in designing security protocols for computer networks is game theory. Thegame-theoretic concept finds extensive applications in security at different levels, including thecyberspace and is generally categorized under security games. It can be utilized as a robust mathematicaltool for modelling and analyzing contemporary security issues. Game theory offers a natural frameworkfor capturing the defensive as well as adversarial interactions between the defenders and the attackers.Furthermore, defenders can attain a deep understanding of the potential attack threats and the strategiesof attackers by equilibrium evaluation of the security games. In this paper, the concept of game theoryhas been presented, followed by game-theoretic applications in cybersecurity including cryptography.Different types of games, particularly those focused on securing the cyberspace, have been analysed andvaried game-theoretic methodologies including mechanism design theories have been outlined foroffering a modern foundation of the science of cybersecurity

Robust UAV Mission Planning

Unmanned Areal Vehicles (UAVs) can provide significant contributions to information gathering in military missions. UAVs can be used to capture both full motion video and still imagery of specific target locations within the area of interest. In order to improve the effectiveness of a reconnaissance mission, it is important to visit the largest number of interesting target locations possible, taking into consideration operational constraints related to fuel usage between target locations, weather conditions and endurance of the UAV. We model this planning problem as the well-known orienteering problem, which is a generalization of the traveling salesman problem. Given the uncertainty in the military operational environment, robust planning solutions are required. As such, our model takes into account uncertainty in the fuel usage between targets (for instance due to weather conditions) as well as uncertainty in the importance of visiting specific target locations. We report results using different uncertainty sets that specify the degree of uncertainty against which any feasible solution will be protected. We also compare the probability that a solution is feasible for the robust solution on one hand and the solution found with average fuel usage and expected value of information on the other. In doing so, we show how the sustainability of a UAV mission can be significantly improved