Task Allocation for Wide Area Search Munitions

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 program for optimal resource allocation. Periodically re-solving this optimization problem results in coordinated action by the search munitions. The network optimization modes 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 2002
Accession Number
ADA405762

Entities

People

  • Corey J. Schumacher
  • Phillip R. Chandler
  • Steven R. Rasmussen

Organizations

  • Air Force Research Laboratory

Tags

Communities of Interest

  • Air Platforms
  • Sensors
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Aircrafts
  • Battle Damage Assessment
  • Battles
  • Classification
  • Control Systems
  • Damage
  • Damage Assessment
  • Governments
  • Linear Programming
  • Military Research
  • Munitions
  • Optimization
  • Simulations
  • Target Recognition
  • United States

Fields of Study

  • Computer science

Readers

  • Control Systems Engineering.
  • Sensor Fusion and Tracking Systems.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.