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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    H. T. Tan (Autor:in)

    Erscheinungsdatum :

    2012


    Format / Umfang :

    72 pages


    Medientyp :

    Report


    Format :

    Keine Angabe


    Sprache :

    Englisch





    Vigilant

    Smyth, E. | Engineering Index Backfile | 1961



    DYNAMIC ROUTING OF TRANSIT VEHICLES

    ULLRICH OLIVER / RISHE NAPHTALI / LUCKERATH DANIEL | Europäisches Patentamt | 2017

    Freier Zugriff

    Dynamic routing of transit vehicles

    ULLRICH OLIVER / RISHE NAPHTALI / LUCKERATH DANIEL | Europäisches Patentamt | 2017

    Freier Zugriff