[go: up one dir, main page]

Skip to main content
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Abbreviations

CE:

Cross Entropy

CMC:

Crude Monte Carlo

RTS:

Real-Time System

UAV:

Unmanned Aerial Vehicle

N :

Number of identical UAVs/servers

r :

Number of heterogeneous regions/channels

r k :

Number of real-time tasks/jobs in k-th region at any instant (r k ≥1)

λ :

The maintenance rate (exponential distribution)

μ k :

The service rate (exponential distribution) in the k-th region/channel

p k :

Routing probability of a server to the k-th region/channel

p * k :

Optimal routing probability of a server to the k-th region/channel

λ k =λp k :

 

ρ k =λ k /μ k :

 

\(\frac{\rho _{u}}{r_{u}}=\max\mathrm{max}\,_{k=\overline{1,r}}\frac{\rho _{k}}{r_{k}}\) :

 

\(\overline{n}=(n_{1},n_{2},\ldots,n_{r})\) :

State of RTS with r channels, where n k is a number of fixed servers assigned to the k-th channel ( \(k=\overline{1,r})\)

\(p_{\overline{n}}=p_{n_{1},n_{2},\ldots,n_{r}}\) :

Steady-state probability of state (n 1,n 2,…,n r )

\(\mathit{Av}_{N}(\bar{n},\rho_{1},\ldots,\rho_{r})\) :

System availability in state \(\bar{n}\) for RTS with N servers and r channels

Av N (ρ1,…,ρ r ):

Average system availability for RTS with N servers and r channels

Av(ρ1,…,ρ r ):

Limiting value (when N→∞) of Av N (ρ 1,…,ρ r )

Av(ρ *1 ,…,ρ * r ):

Optimal value of Av(ρ 1,…,ρ r )

References

  • de Boer, P.-T. (2000). Analysis and efficient simulation of queueing models of telecommunication systems. Ph.D. Thesis, University of Twente.

  • de Boer, P.-T. (2005). Rare event simulation of non-Markovian queueing networks using a state-dependent change of measure determined cross-entropy. Annals of Operations Research, 134, 69–100.

    Article  Google Scholar 

  • de Boer, P.-T., & Nicola, V. F. (2002). Adaptive state-dependent importance sampling simulation of Markovian queueing networks. European Transactions on Telecommunications, 13(4), 303–315.

    Article  Google Scholar 

  • Burden, R. L., & Faires, J. D. (2005). Numerical analysis (8th ed.). Thomson Brooks/Cole.

  • Chepuri, K., & Homem-de-Mello, T. (2005). Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Annals of Operations Research, 134, 153–181.

    Article  Google Scholar 

  • Flint, M., Fernandez, E., & Polycarpou, M. (2003). Models of cooperative autonomous UAV search problem. Military Operations Research, 8(4), 13–32.

    Google Scholar 

  • Gross, D., & Harris, C. M. (1998). Fundamentals of queueing theory (3rd ed.). New York: Wiley.

    Google Scholar 

  • Harder, R. W., Hill, R. R., & Moore, J. T. (2004). A JavaTM universal vehicle router for routing unmanned aerial vehicles. International Transactions in Operational Research, 11(3), 259–275.

    Article  Google Scholar 

  • Ianovsky, E. (2006). Analysis and optimization of real-time systems. Ph.D. Thesis, Ben-Gurion University of the Negev, Beer-Sheva, Israel.

  • Ianovsky, E., & Kreimer, J. (2001). Optimization of real-time multiserver system with two different channels. Communications in Dependability and Quality Management, 8(1), 16–23.

    Google Scholar 

  • Ianovsky, E., & Kreimer, J. (2003). Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities. Mathematics and Computers in Simulation, 63(6), 615–627.

    Article  Google Scholar 

  • Kinney, G.W., Hill, R. R., & Moore, J. T. (2005). Devising a quick-running heuristic for an unmanned aerial vehicle (UAV) routing system. Journal of the Operational Research Society, 56(7), 776–786.

    Article  Google Scholar 

  • Kreimer, J. (2002a). Effectiveness analysis of real-time data acquisition and processing multichannel systems. IEEE Transactions on Reliability, 51(1), 91–99.

    Article  Google Scholar 

  • Kreimer, J. (2002b). Real-time system with homogeneous servers and nonidentical channels in steady state. Computers and Operations Research, 29(11), 1465–1473.

    Article  Google Scholar 

  • Kreimer, J., & Mehrez, A. (1993). An optimal operation policy for real-time n-server stand-by system involving preventive maintenance. European Journal of Operational Research, 69, 50–54.

    Article  Google Scholar 

  • Kreimer, J., & Mehrez, A. (1994). Optimal real-time data acquisition and processing by a multiserver stand-by system. Operations Research, 42(1), 24–30.

    Article  Google Scholar 

  • Kreimer, J., & Mehrez, A. (1998). Computation of availability of a real-time system using queueing theory methodology. Journal of the Operational Research Society, 49, 1095–1100.

    Google Scholar 

  • Lian, Z. T., & Deshmukh, A. (2006). Performance prediction of an unmanned airborne vehicle multi-agent system. European Journal of Operational Research, 172(2), 680–695.

    Article  Google Scholar 

  • Lin, G. Y., Luby, R. E. Jr., & Wang, K.-Y. (2004). New model for military operations. ORMS Today, 31(6), 26–31.

    Google Scholar 

  • O’Rourke, K. P., Carlton, W. B., Bailey, T. G., & Hill, R. R. (2001). Dynamic routing of unmanned aerial vehicles using reactive tabu search. Military Operations Research, 6(1), 5–30.

    Google Scholar 

  • Rubinstein, R. Y. (1999). The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability, 2, 127–190.

    Article  Google Scholar 

  • Ross, S. M. (2002). Simulation (3rd ed.). New York: Academic Press.

    Google Scholar 

  • Rubinstein, R. Y., & Kroese, D. P. (2004). The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning. Berlin: Springer.

    Google Scholar 

  • Rubinstein, R. Y., & Kroese, D. P. (2008). Simulation and the Monte Carlo method (2nd ed.). New York: Wiley.

    Google Scholar 

  • Smith, M. A. J., Dekker, R., Kos, J., & Hontelez, J. A. M. (2001). The availability of unmanned air vehicles: a post-case study. Journal of the Operational Research Society, 52(2), 161–168.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joseph Kreimer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ianovsky, E., Kreimer, J. An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach). Ann Oper Res 189, 215–253 (2011). https://doi.org/10.1007/s10479-009-0609-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-009-0609-1

Keywords

Navigation