Routing Cooperating Vehicles to Perform Precedence-Linked Tasks

Abstract

The problem of scheduling cooperating vehicles is a generalization of the classical vehicle routing problem where certain tasks are linked by precedence constraints and vehicles have varying constrained resources. We describe a type of roll-out algorithm that finds an approximate solution to the problem in real-time and demonstrate the results of the computational experiments.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2005
Accession Number
ADA444908

Entities

People

  • Andrew Vakhutinsky
  • Cynara Wu

Organizations

  • BAE Systems

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Air Force Facilities
  • Air Force Research Laboratories
  • Aircrafts
  • Algorithms
  • Contracts
  • Control Systems
  • Department Of Defense
  • Government Procurement
  • Governments
  • Information Systems
  • Instructions
  • Military Research
  • New England
  • Scheduling (Production)
  • Vehicles

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Robotics and Automation.