We consider a Persistent Intelligence, Surveillance and Reconnaissance (PISR) routing problem, which includes collecting data from a set of specified task locations and delivering that data to a control station. Each task is assigned a refresh rate based on its priority, where higher priority tasks require higher refresh rates. The UAV team's objective is to minimize the maximum of the delivery times of all the tasks' data to the control station, while simultaneously, satisfying each task's revisit period constraint. The centralized path planning problem for this PISR routing problem is formulated using mixed integer linear programming and solved using a branch-and-cut algorithm. Heuristics are presented to find suboptimal feasible solutions that require much less computation time. The algorithms are tested on several instances and their performance is compared with respect to the optimal cost and computation time.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Multi-UAV routing for persistent intelligence surveillance & reconnaissance missions




    Erscheinungsdatum :

    01.06.2017


    Format / Umfang :

    268025 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Routing Problems for Reconnaissance Patrolling Missions

    Rajan, Sudarshan / Sundar, Kaarthik / Gautam, Natarajan | IEEE | 2019



    Control of formations of UAVs for surveillance and reconnaissance missions

    Kopfstedt, T. / Mukai, M. / Fujita, M. et al. | Tema Archiv | 2008


    Active Learning in Persistent Surveillance UAV Missions

    Redding, Joshua / Bethke, Brett / Bertuccelli, Luca et al. | AIAA | 2009


    Active Learning in Persistent Surveillance UAV Missions

    Redding, J. / Bethke, B. / Bertuccelli, L. et al. | British Library Conference Proceedings | 2009