This paper investigates the UAV mission planning problem in which one needs to find the optimal plan/schedule to carry out various tasks of different time windows at various locations using a fleet of fixed-winged heterogeneous UAVs. For this realistic and complex UAV mission planning problem, a two-step approach is proposed to solve it: flying path planning and task scheduling. The solution method includes a graph-based search algorithm to solve path planning problem and a MILP-based algorithm to solve task scheduling problem. To test the effectiveness and efficiency of the developed algorithms, experiments were designed and carried out. It shows that the developed algorithms can solve the defined UAV mission planning problem effectively.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Mission planning for heterogeneous tasks with heterogeneous UAVs


    Contributors:
    Wang, J. J. (author) / Zhang, Y. F. (author) / Geng, L. (author) / Fuh, J. Y. H. (author) / Teo, S. H. (author)


    Publication date :

    2014-12-01


    Size :

    408386 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Mission Planning for Heterogeneous UAVs in Obstacle-Dense Environment

    Yu, Xinyong / Wang, Lei / Gao, Xiaohua et al. | Springer Verlag | 2023



    RISE: Rolling-Inspired Scheduling for Emergency Tasks by Heterogeneous UAVs

    Bowen Fei / Daqian Liu / Weidong Bao et al. | DOAJ | 2022

    Free access

    Mission Planning for UAVs

    Sharp, R. | British Library Conference Proceedings | 2003