Task Allocation for Wide Area Search Munitions via Iterative Network Flow

Abstract

The public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, DISTRIBUTION/AVAILABILITY STATEMENTApproved for public release; distribution is unlimited. SUPPLEMENTARY NOTESPresented at the AIAA Guidance Navigation and Control Conference, Monterey, CA, August 5-8, 2002. This material is declared a work of the U.S. Government and is not subject to copyright protection in the United States. ABSTRACT (Maximum 200 Words)This paper addresses the problem of task allocation for wide area search munitions. The munitions are required to search for, classify, attack, and verify the destruction of potential targets. It is assumed that target field information is communicated between all elements of the swarm. A network flow optimization model is used to develop a linear program for optimal resource allocation. This method can be used to generate a tour of several assignments to be performed consecutively, by running the assignment iteratively and only updating the assigned task with the shortest ETA in each iteration. Periodically re-solving the overall optimization problem results in coordinated action by the search munitions. Simulation results are presented for a swarm of eight vehicles searching an area containing three potential targets. All targets are quickly serviced without using up an excessive amount of potential search time. AbstractThis paper addresses the problem of task allocation for wide area search munitions. The munitions are required to search for, classify, attack, and verify the destruction of potential targets. It is assumed that target field information is communicated between all elements of the swarm. A network flow optimization model is used to develop a linear program for optimal resource allocation. This method can be used to generate a "tour" of several assignments to be performed consecutively, by running the assignment iteratively and only updating the assigned task with the shortest ETA in each iteration. Periodically re-solving the overall optimization problem results in coordinated action by the search munitions. Simulation results are presented for a swarm of eight vehicles searching an area containing three potential targets. All targets are quickly serviced without using up an excessive amount of potential search time.

Tour Planning for an Unmanned Air Vehicle Under Wind Conditions

“…Finally, one needs to search the cost table for the directed graph to find a state transition sequence of minimum cost that starts with the initial state and covers all the targets. Several publications 1,2,9 in the literature have addressed the search problem and that is not the topic under investigation in this paper. As our interest is in demonstrating the effect of wind on the task assignment problem, we consider two examples with 3 targets each and the direct graph search was done manually with some effort.…”

“…[1][2][3] This new paradigm for control has been implemented in the MultiUAV simulation platform by the Air Force Research Laboratory.…”

“…Lebesgue measurable function, and satisfies (2). In this paper, we will focus on the special case W (x, t) = W (t).…”

Cooperative Control Simulation Validation Using Applied Probability Theory

“…Additionally, Dunkel and Gozaydin have improved the decision process to control the actions of the group rather than the individual. Furthermore, the decision methodology was based upon a mathematically rigorous approach, [9], which eliminated the need for pre-optimized decision rules tuned for specific scenarios. Using this formulation, Dunkel and Gozaydin demonstrated that while cooperative attack alone does not always improve mission effectiveness, cooperative classification used in conjunction with cooperative attack does improve overall group efficiency.…”

“…The following cooperative team process [11] is intended to contrast the differences to the non-cooperative case. [3], [9], [14], [16], [13] has explored the affects these three items can have on cooperative control. Item 3 is of special interest for successfully employing cooperative teams to perform tasks.…”