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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

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


    Contributors:
    H. T. Tan (author)

    Publication date :

    2012


    Size :

    72 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English





    Vigilant

    Smyth, E. | Engineering Index Backfile | 1961



    Dynamic routing of transit vehicles

    ULLRICH OLIVER / RISHE NAPHTALI / LUCKERATH DANIEL | European Patent Office | 2017

    Free access

    DYNAMIC ROUTING OF TRANSIT VEHICLES

    ULLRICH OLIVER / RISHE NAPHTALI / LUCKERATH DANIEL | European Patent Office | 2017

    Free access