A novel GPS denied routing problem for UAVs is described, where two UAVs cooperatively navigate through an array of non-communicating Unattended Ground Sensors (UGS). Contact with UGS is strictly maintained, which allows the UGS act as beacons for relative navigation eliminating the need for dead reckoning. This problem is referred to as the Communication Constrained UAV Routing Problem (CCURP). To solve the CCURP, shortest paths between targets are computed by means of a graph transformation. Given the shortest paths between targets, two solution methods are presented. The first is a 15 over 2-approximation algorithm. The second method poses the CCURP as an one-in-a-set Traveling Salesman Problem (TSP), which can then be solved using known methods by transforming the problem into a regular asymmetric TSP. Computational results corroborating the performance bounds in this article are also presented.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Routing of two Unmanned Aerial Vehicles with communication constraints




    Publication date :

    2014-05-01


    Size :

    938880 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    2012-2455 Dynamic Allocation of Unmanned Aerial Vehicles with Communication Constraints

    Sabo, C. / Cohen, K. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2012


    Visibility-constrained routing of unmanned aerial vehicles

    Buck, Keith R. / Gassner, Richard R. / Poore, Aubrey B. et al. | SPIE | 1999


    Routing and Scheduling of Unmanned Aerial Vehicles Subject to Cyclic Production Flow Constraints

    Bocewicz, G. / Nielsen, P. / Banaszak, Z. et al. | Springer Verlag | 2019


    Constraints for unmanned aerial vehicles formation flight path

    Chen, Gao / Ziyang, Zhen / Huajun, Gong et al. | IEEE | 2014