Task Allocation for Wide Area Search Munitions with Variable Path Length

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 iteratively and only updating the assigned task with the shortest estimated time of arrival (ETA) in each iteration. Periodically re-solving the overall optimization problem as new targets are discovered results in coordinated action by the search munitions. Variable path lengths are used to improve overall performance and prevent infeasibility. Simulation results are presented for a swarm of eight vehicles searching an area containing multiple potential targets.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 2003
Accession Number
ADA414427

Entities

People

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

Organizations

  • Air Force Research Laboratory

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Aircrafts
  • Algorithms
  • Battle Damage Assessment
  • Classification
  • Control Systems
  • Damage Assessment
  • Linear Programming
  • Mechanical Engineering
  • Military Research
  • Motion Planning
  • Munitions
  • Optimization
  • Simulations
  • Target Recognition
  • Turbojet Engines

Fields of Study

  • Computer science

Readers

  • Munitions and Ordnance Engineering
  • Operations Research
  • Sensor Fusion and Tracking Systems.