Dynamic rescheduling heuristics for military village search environments (original) (raw)

Abstract

On the modern battlefield cordon and search missions (also known as village searches) are conducted daily. Creating resource allocations that link search teams (e.g. soldiers, robots, unmanned aerial vehicles, military working dogs) to target buildings is difficult and time consuming in the static planning environment and is even more challenging in a time-constrained dynamic environment. Conducting dynamic resource allocation during the execution of a military village search mission is beneficial especially when the time to develop a static plan is limited and hence the quality of the plan is relatively poor. Dynamic heuristics can help improve the static plan because they are able to incorporate current state information that is unavailable prior to mission execution and thus produce more accurate results than static heuristics alone can achieve. There are currently no automated means to create these dynamic resource allocations for military use. Using robustness concepts, this pa...

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (33)

  1. Maxwell P, Maciejewski AA, Siegel HJ, Pfister G, Smith J and Friese R. Robust static planning tool for military village search missions: model and heuristics. J Defense Model Sim 2013; 10(1): 31-47.
  2. Coffman EG (ed.). Computer and Job-Shop Scheduling Theory. New York, NY: John Wiley & Sons, 1976.
  3. Ibarra OH and Kim CE. Heuristic algorithms for scheduling independent tasks on non-identical processors. J ACM 1977; 24(2): 280-289.
  4. Ali S, Maciejewski AA, Siegel HJ and Kim J. Measuring the robustness of a resource allocation. IEEE Trans Parallel Distrib Sys 2004; 15(7): 630-641.
  5. Shestak V, Smith J, Maciejewski AA and Siegel HJ. Stochastic robustness metric and its use for static resource allocations. J Parallel Distrib Comput 2008; 68(8): 1157-1173.
  6. Chekuri C and Khanna S. A polynomial time approximation scheme for the multiple knapsack problem. SIAM J Comput 2006; 35(3): 713-728.
  7. Ahner D, Buss A and Ruck J. Using a low-resolution entity model for shaping initial conditions for high resolution com- bat models. In 2007 Winter Simulation Conference, 2007, pp. 1344-1352.
  8. Aydin M. An Exploratory Analysis of Village Search Operations. Master's Thesis, Naval Postgraduate School, June 2004.
  9. Babilot M. Comparison of a Distributed Operations Force to a Traditional Force in Urban Combat. Master's Thesis, Naval Postgraduate School, September 2005.
  10. Fulton LV, Lasdon LS, McDaniel RR Jr, et al. Two-stage stochastic optimization for the allocation of medical assets in steady-state combat operations. J Defense Model Sim 2010; 7(2): 89-102.
  11. Popken D and Cox L. A simulation-optimization approach to air warfare planning. J Defense Model Sim 2004; 1(3): 127-140.
  12. Desrochers M, Desrosiers J and Solomon M. A new optimi- zation algorithm for the vehicle routing problem with time windows. Operat Res 1992; 40(2): 342-354.
  13. Potvin J. Genetic algorithms for the traveling salesman prob- lem. Ann Operat Res 1996; 63: 339-370.
  14. Papadimitriou G. The Euclidean travelling salesman problem is NP-complete. Theor Comput Sci 1977; 4(3): 237-244.
  15. Tang L, Liu J, Rong A, et al. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. Eur J Operat Res 2000; 124: 267-282.
  16. Sabuncuoglu I and Bayiz M. Job shop scheduling with beam search. Eur J Operat Res 1999; 118: 390-412.
  17. Yu Z, Jinhai L, Gouchang G, et al. An implementation of evolutionary computation for path planning of cooperative mobile robots. In 4th World Congress on Intelligent Control and Automation, June 2002, pp. 1798-1802.
  18. Mavrovouniotis M and Yang S. Ant colony optimization with immigrants schemes in dynamic environments. In Parallel Problem Solving from Nature (PPSN XI) (Lecture Notes in Computer Science, Vol. 6239). Berlin: Springer, 2011, pp. 371-380.
  19. Yang S. Genetic algorithms with memory-and elitism-based immigrants in dynamic environments. Evol Computat 2008; 16(3): 385-416.
  20. Powell W, Bouzaiene-Ayari B, Berger J, et al. The effect of robust decisions on the cost of uncertainty in military airlift operations. ACM Trans Model Comput Sim 2011; 9(4): 39.
  21. Chung T, Kress M and Royset J. Probabilistic search optimi- zation and mission assignment for heterogeneous autono- mous agent. In 2009 IEEE International Conference on Robotics and Automation, May 2009, pp. 939-945.
  22. Kanoh H and Hara K. Hybrid genetic algorithm for dynamic multi-objective route planning with predicted traffic in a real- world road network. In 10th Annual Conference on Genetic and Evolutionary Computation, July 2008, pp. 657-664.
  23. Banks J (ed.). Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice. New York, NY: John Wiley & Sons, 1998.
  24. Braun T, Siegel HJ, Beck N, et al. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 2001; 61(6): 810-837.
  25. Alcaraz J and Maroto C. A robust genetic algorithm for resource allocation in project scheduling. Ann Operat Res 2001; 102: 83-109.
  26. Wang L, Maciejewski AA, Siegel HJ, Roychowdjury VP and Eldrige BD. Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. J Parallel Distrib Comput 1997; 47(1): 8-22.
  27. Blickle T and Thiele L. A Comparison of Selection Schemes Used in Genetic Algorithms. Technical Report TIK-Report Number 11, Version 2, CEN Lab, Swiss Federal Institute of Technology, December 1995.
  28. Zilberstein S. Using anytime algorithms in intelligent sys- tems. AI Mag 1996; 17(3): pp. 73-83.
  29. Ali S, Maciejewski AA and Siegel HJ. Perspectives on robust resource allocation for heterogeneous parallel sys- tems. In Rajasekaran S and Reif J (eds), Handbook of Parallel Computing: Models, Algorithms, and Applications. Boca Raton, FL: Chapman & Hall/CRC Press, 2008, pp. 41- 1-41-30.
  30. Bilbao J, Miguel AH and Kambezidis HD. Air temperature model evaluation in the north Mediterranean belt area. J Appl Meteorol 2002; 41: 872-884.
  31. Bruhn JE, Fry WE and Fick GW. Simulation of daily weather data using theoretical probability distributions. J Appl Meteorol 1980; 19: 1029-1036.
  32. Hill RD, Moate CP and Blacknell D. Estimating building dimensions from synthetic aperture radar image sequences. IET Radar Sonar Nav 2008 2(3): 189-199.
  33. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Operat Res 2004; 31(12): 1985-2002.