IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v74y2011i3p343-360.html
   My bibliography  Save this article

Trajectory planning for unmanned aerial vehicles: a network optimization approach

Author

Listed:
  • Luitpold Babel

Abstract

This paper presents a new approach for trajectory planning of air vehicles. It considers scenarios with risk areas and forbidden zones and takes into account the maneuverability of the air vehicle. It is flexible as to allow different kinds of objective functions such as minimizing risk, flight path length or flight time, and allows to implement constraints on fuel consumption or other resources. Additionally, it can incorporate waypoints to be passed by the air vehicle with or without specified overflight directions. The method includes planning of one-way and return trips. The underlying model is based on a discretization of the airspace into a non-regular network. Every path in the network corresponds to a flyable trajectory which means that the trajectory is within the performance limits of the air vehicle. The generation of the network is done non-deterministically. One of the main benefits of the model is that one can make use of standard network optimization techniques. Copyright Springer-Verlag 2011

Suggested Citation

  • Luitpold Babel, 2011. "Trajectory planning for unmanned aerial vehicles: a network optimization approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 343-360, December.
    • Handle: RePEc:spr:mathme:v:74:y:2011:i:3:p:343-360
    DOI: 10.1007/s00186-011-0366-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-011-0366-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-011-0366-1?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 search for a different version of it.

    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:spr:mathme:v:74:y:2011:i:3:p:343-360. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.