The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles

Abstract

The routing of unmanned ground vehicles for the surveillance and protection of key installations is modeled as a new variant of the Covering Tour Problem (CTP). The CTP structure provides both the routing and target sensing components of the installation protection problem. Our variant is called the in-transit Vigilant Covering Tour Problem (VCTP) and considers not only the vertex cover but also the additional edge coverage capability of the unmanned ground vehicle while sensing in-transit between vertices. The VCTP is formulated as a Traveling Salesman Problem (TSP) with a dual set covering structure involving vertices and edges. An empirical study compares the performance of the VCTP against the CTP on test problems modified from standard benchmark TSP problems to apply to the VCTP. The VCTP performed generally better with shorter tour lengths but at higher computational cost.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2012
Accession Number
ADA570658

Entities

People

  • Huang Teng Tan

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Biomedical
  • Ground and Sea Platforms
  • Space
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Aircrafts
  • Algorithms
  • Command And Control
  • Computer Programs
  • Evolutionary Algorithms
  • Flow Network
  • Ground Vehicles
  • Health Care
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Unmanned Aerial Vehicles
  • Unmanned Ground Vehicles
  • Unmanned Vehicles

Readers

  • Maritime and Naval Warfare Studies
  • Military Science and Technology Research and Modernization.
  • Operations Research

Technology Areas

  • Autonomy