An optimal routing policy for unmanned aerial vehicles (analytical and cross‐entropy simulation approach)

An optimal routing policy for unmanned aerial vehicles (analytical and cross‐entropy simulation approach)

0.00 Avg rating0 Votes
Article ID: iaor20119383
Volume: 189
Issue: 1
Start Page Number: 215
End Page Number: 253
Publication Date: Sep 2011
Journal: Annals of Operations Research
Authors: ,
Keywords: military & defence
Abstract:

We consider a real‐world problem of military intelligence unit equipped with identical unmanned aerial vehicles producing real‐time imagery and responsible for heterogeneous regions (with requests of real‐time jobs) required to be under nonstop surveillance. Under certain assumptions these real‐time systems can be treated as queueing networks. The use of the system involving unmanned aerial vehicles relies on the principle of availability, namely on its ability to process the maximal portion of real‐time tasks. We show that even very large number of vehicles does not guarantee the maximal system availability without proper choice of routing probabilities. We compute analytically (for exponentially distributed service and maintenance times) and via simulation using Cross‐Entropy method (for generally distributed service times) optimal routing probabilities which maximize system availability.

Reviews

Required fields are marked *. Your email address will not be published.