Task allocation for wide area search munitions via network flow optimization

Abstract

This paper addresses the problem of task allocation for wide area search munitions. The munitions are required to search for, classify, attack, and perform battle damage assessment on, 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 programming problem for optimal resource allocation. Periodically re-solving this optimization problem results in coordinated action by the search munitions. Simulation results are presented for a swarm of eight vehicles searching an area containing five potential targets. Simulation results indicate the task allocation methodology presented in this paper results in an efficient use of available resources.