IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v8y2014i1p9-24.html
   My bibliography  Save this article

Dispatching and loitering policies for unmanned aerial vehicles under dynamically arriving multiple priority targets

Author

Listed:
  • N Bednowitz
  • R Batta
  • R Nagi

Abstract

The dynamic nature and growing size of unmanned aerial vehicle (UAV) systems demands quick methods for effective task allocation, routing and positioning of UAVs in reaction to and in anticipation of arriving targets. The importance of targets, along with the timeliness of completing their tasks determines how effective a system is performing. Through simulation, this paper examines a system with multiple UAVs assigned to respond to fixed-location, multiple-priority targets. Dispatching rules and loitering strategies are implemented to insure rapid service for high-priority targets and effective management of medium-priority levels. The design of a study is discussed, for multiple dispatching rules and loitering strategy combinations under varying conditions of: region size, on-scene service rate, arrival rate, and target priority. The decision policy with the think-ahead and distance-based dispatching rules created the greatest benefit, when implemented with the loitering policy based on arrival location probabilities with continual consideration of busy UAV's future availability.

Suggested Citation

  • N Bednowitz & R Batta & R Nagi, 2014. "Dispatching and loitering policies for unmanned aerial vehicles under dynamically arriving multiple priority targets," Journal of Simulation, Taylor & Francis Journals, vol. 8(1), pages 9-24, February.
  • Handle: RePEc:taf:tjsmxx:v:8:y:2014:i:1:p:9-24
    DOI: 10.1057/jos.2011.22
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/jos.2011.22
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/jos.2011.22?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.

    More about this item

    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:taf:tjsmxx:v:8:y:2014:i:1:p:9-24. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    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.