Time-Dependent Cooperative Assignment

Abstract

The problem of assigning multiple agents to time- dependent cooperative tasks is addressed using a Mixed- Integer Linear Program. A time-dependent cooperative task is a task requiring multiple agents to perform separate subtasks simultaneously or within some predetermined margin where agent availability to perform a subtask is limited to specific intervals in time. By separating the underlying calculation of agent availability and cost from the mechanism of assignment, a method to solve complex cooperative assignment problems can be formulated. A cooperative UAV target tracking/target prosecution scenario is presented to illustrate the assignment method.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 2005
Accession Number
ADA445144

Entities

People

  • Corey J. Schumacher
  • Derek B. Kingston

Organizations

  • Brigham Young University

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Sensors
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Aircrafts
  • Algorithms
  • Availability
  • Computations
  • Cooperation
  • Doppler Radar
  • Genetic Algorithms
  • Line Of Sight
  • Linear Programming
  • Military Research
  • Motion Planning
  • Moving Targets
  • Optimization
  • Simulations
  • Targets

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Regression Analysis.