We consider a large scale system consisting of multiple unmanned aerial vehicles (UAVs) performing a search and surveillance task, based on the uncertainty map of an unknown region. The search algorithm is based on the k-shortest path algorithm that maximizes the effectiveness of the search in term of searching through the maximum uncertainty region, given a constraint on the endurance time of the UAV and on the location of the base station from which the UAVs operate. These constraints set apart this class of problems from the usual search and surveillance problems. We compare the performance of this algorithm with a random search and a greedy strategy search, We also implement the algorithm for the case of multiple UAVs searching an unknown region. The cases of delayed and partial information are also considered. Simulation results that demonstrate the efficacy of the technique are also presented.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Search using multiple UAVs with flight time constraints


    Beteiligte:
    Sujit, P.B. (Autor:in) / Ghose, D. (Autor:in)


    Erscheinungsdatum :

    01.04.2004


    Format / Umfang :

    2866227 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Search using multiple UAVs with flight time constraints

    Sujit, P.B. / Ghose, D. | Tema Archiv | 2004



    Flight Formation of Multiple UAVs

    Cai, Guowei / Chen, Ben M. / Lee, Tong Heng | Springer Verlag | 2011


    Time-Cooperative Guidance Law for Multiple UAVs with Angle Constraints

    Yi, Zhang / Guowei, Fang / Xiuxia, Yang et al. | IEEE | 2019