Task Allocation for Wide Area Search Munitions via Iterative Network Flow

Abstract : 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 interactively 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.