In this chapter the authors present an algorithm to solve the Dynamic Military Unit Path Finding Problem (DMUPFP) which is based on Stentz’s well-known D* algorithm to solve dynamic path finding problems. The Military Unit Path Finding Problem (MUPFP) is the problem of finding a path from a starting point to a destination where a military unit has to move, or be moved, safely whilst avoiding threats and obstacles and minimising path cost in some digital representation of the actual terrain.
Reference:
Leenen, L, Terlunen, A and Le Roux, H. A constraint programming solution for the military unit path finding problem. Mobile Intelligent Autonomous Systems: Recent Advances. Taylor & Francis Group, Boca Raton, USA, pp. 225-240
Leenen, L., Terlunen, A., & Le Roux, H. (2012). A constraint programming solution for the military unit path finding problem., Workflow;5844 Taylor & Francis Group. http://hdl.handle.net/10204/6074
Leenen, L, A Terlunen, and H Le Roux. "A constraint programming solution for the military unit path finding problem" In WORKFLOW;5844, n.p.: Taylor & Francis Group. 2012. http://hdl.handle.net/10204/6074.
Leenen L, Terlunen A, Le Roux H. A constraint programming solution for the military unit path finding problem.. Workflow;5844. [place unknown]: Taylor & Francis Group; 2012. [cited yyyy month dd]. http://hdl.handle.net/10204/6074.
