Language:

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

Tan, Huang Teng ;Air Force Inst Of Tech Wright-Patterson Afb Oh School Of Engineering And Management (Corporate Author)

Link to full text

Citations Cited by

Title:
The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles
Author/Creator: Tan, Huang Teng
Air Force Inst Of Tech Wright-Patterson Afb Oh School Of Engineering And Management (Corporate Author)
Language: English
Subjects: Operations Research ; Cybernetics ; Land and Riverine Navigation and Guidance ; Ground Vehicles ; Routing ; Optimization ; Robots ; Security ; Theses ; Unmanned ; Covering Tour Problem ; Unmanned Systems
Description: 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. The original document contains color images.

Links

Back to results list