IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v200y2025ics0191261525001614.html
   My bibliography  Save this article

Routing a fleet of unmanned aerial vehicles: A trajectory optimisation-based framework

Author

Listed:
  • Coutinho, Walton P.
  • Fliege, Jörg
  • Battarra, Maria
  • Subramanian, Anand

Abstract

We consider an aerial survey operation in which a fleet of unmanned aerial vehicles (UAVs) is required to visit several locations and then land in one of the available landing sites while optimising some performance criteria, subject to operational constraints and flight dynamics. We aim to minimise the maximum flight time of the UAVs. To efficiently solve this problem, we propose an algorithmic framework consisting of: (i) a nonlinear programming formulation of trajectory optimisation that accurately reflects the underlying flight dynamics and operational constraints; (ii) two sequential trajectory optimisation heuristics, designed to cope with the challenging task of finding feasible flight trajectories for a given route; and (iii) a routing metaheuristic combining iterated local search and a set-partitioning-based integer programming formulation. The proposed framework is tested on randomly generated instances with up to 50 waypoints, showing its efficacy.

Suggested Citation

  • Coutinho, Walton P. & Fliege, Jörg & Battarra, Maria & Subramanian, Anand, 2025. "Routing a fleet of unmanned aerial vehicles: A trajectory optimisation-based framework," Transportation Research Part B: Methodological, Elsevier, vol. 200(C).
    • Handle: RePEc:eee:transb:v:200:y:2025:i:c:s0191261525001614
    DOI: 10.1016/j.trb.2025.103312
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261525001614
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2025.103312?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:200:y:2025:i:c:s0191261525001614. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.