Task allocation for wide area search munitions

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 program for optimal resource allocation. Periodically re-solving this optimization problem results in coordinated action by the search munitions. The network optimization model can be initialized such that multiple vehicles can be assigned to service a single target. Memory of previous task assignments is included in the task benefit calculations to reduce churning due to frequent reassignments. Simulation results are presented for a swarm of eight vehicles searching an area containing three potential targets. All targets are quickly classified, attacked, and verified as destroyed.