We formulate the mission planning problem for a meet of unmanned aerial vehicles (UAVs) as a mixed-integer nonlinear programming problem (MINLP). The problem asks for a selection of targets from a list to the UAVs, and trajectories that visit the chosen targets. To be feasible, a trajectory must pass each target at a desired maximal distance and within a certain time window, obstacles or regions of high risk must be avoided, and the fuel limitations must be obeyed. An optimal trajectory maximizes the sum of values of all targets that can be visited, and as a secondary goal, conducts the mission in the shortest possible time. In order to obtain numerical solutions to this model, we approximate the MINLP by a mixed-integer linear program (MILP), and apply a state-of-the-art solver (GUROBI) to the latter on a set of test instances.


    Access

    Download


    Export, share and cite



    Title :

    Mission planning for unmanned aerial vehicles


    Contributors:

    Publication date :

    2019


    Size :

    6047 KB


    Remarks:

    Cottbus Mathematical Preprints, 6, 2019




    Type of media :

    Miscellaneous


    Type of material :

    Electronic Resource


    Language :

    English





    Mission planning for unmanned aerial vehicles

    Hu, Chunhua / Fan, Yong / Jiang, Zhihong et al. | Tema Archive | 2006


    Mission planning for unmanned aerial vehicles

    Fügenschuh, Armin / Müllenstedt, Daniel / Schmidt, Johannnes et al. | TIBKAT | 2019

    Free access

    On-board multi-objective mission planning for Unmanned Aerial Vehicles

    Wu, Paul Pao-Yen / Campbell, Duncan / Merz, Torsten | IEEE | 2009


    On-board multi-objective mission planning for unmanned aerial vehicles

    Wu, P.P.Y. / Campbell, D. / Merz, T. | Tema Archive | 2009