An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

Abstract

Unmanned aerial vehicles (UAVs), increasingly vital to the success of military operations, operate in a complex and dynamic environment, sometimes in concert with manned aircraft. We present an extensible modeling framework for the solution to the dynamic resource management (DRM) problem, where airborne resources must be reassigned to time-sensitive tasks in response to changes in battlespace conditions. The DRM problem is characterized by diverse tasks with time windows, heterogeneous resources with fuel-and payload-capacity limitations, and multiple competing objectives. We propose an integer linear programing formulation for this problem, where mathematical feasibility is guaranteed. Although motivated by airborne military operations, the proposed general modeling framework is applicable to a wide array of settings, such as disaster relief operations. Additionally, land-or water-based operations may be modeled within this framework, as well as any combination of manned and unmanned vehicles.

Optimal task allocation in multi-human multi-robot interaction

“…Case 2: if ix * i > 1 then the agent allocates information based on the utility of each team a | x i =x * i . The team with the highest utility is allocated first, then the team with the second-highest utility, and so on until ix * i = 1, which will maximize the utility a in (18). Alternatively, as the magnitude ofx * i is proportional to the utility,x * i can be used in allocation.…”

“…Substituting the leader-level optimal solution in (17) into (18), the agent-level objective function can be re-written as…”

“…In [6], a nonlinear programing problem given precedence constraints is developed to assign UAVs. In [18], rerouting of UAVs in a complex dynamic task allocation was considered in response to changes in battle-space conditions.…”

A real-time network approach for including obstacles and flight dynamics in UAV route planning

“…12 This model is easily modified to include our method as data for their optimization models. 49 The model includes the same three previously mentioned assumptions. The same reasons hold as to why our methods would improve the accuracy of the flight time calculations associated with this model and others used to solve the same problem.…”

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

“…

This article is a sequel to a recent article that appeared in this journal, "An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations" [17], in which an integer programming formulation to the problem of rescheduling in-flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch-and-bound procedure to solve the dynamic resource management problem in a timely fashion, as in-flight assets must be quickly re-tasked to respond to the changing environment.

…”