Leenen, LVorster, JLe Roux, WH2010-08-242010-08-242010-04Leenen, L,Vorster, J, and Le Roux, WH. 2010. Constraint-based solver for the Military unit path finding problem. 2010 Spring Simulation Multiconference SpringSim10, Orlando, Florida, USA, 11-15 April 2010, pp 8978-161738-2079http://hdl.handle.net/10204/42002010 Spring Simulation Multiconference SpringSim10, Orlando, Florida, USA, 11-15 April 2010The authors describe the first phase development of a path finding simulation in a military environment. This concept demonstrator can be used for mission planning by constructing what if scenarios to investigate trade-offs such as location of deployment and mode of transport. 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 costs in a digital representation of the real terrain. Although significant research has been done on path finding, the success of a particular technique relies on the environment and existing constraints. The MUPFP is ideal for a constraint-based approach because it requires flexibility in modelling. The authors formulate the MUPFP as a constraint satisfaction problem and a constraint-based extension of the search algorithm. The concept demonstrator uses a provided map, for example taken from Google Earth, on which various obstacles and threats can be manually marked. Our constraint based approach to path finding allows for flexibility and ease of modelling. It has the advantage of modelling new environments or additional constraints with ease, and it produces near optimal solutions if solving is halted prematurely.enMilitary unit path finding problemRural urban military operationsAutonomous systemsScenario planningGoogle earthSpring Simulation Multiconference 2010Conference PresentationLeenen, L., Vorster, J., & Le Roux, W. (2010). Constraint-based solver for the Military unit path finding problem. http://hdl.handle.net/10204/4200Leenen, L, J Vorster, and WH Le Roux. "Constraint-based solver for the Military unit path finding problem." (2010): http://hdl.handle.net/10204/4200Leenen L, Vorster J, Le Roux W, Constraint-based solver for the Military unit path finding problem; 2010. http://hdl.handle.net/10204/4200 .TY - Conference Presentation AU - Leenen, L AU - Vorster, J AU - Le Roux, WH AB - The authors describe the first phase development of a path finding simulation in a military environment. This concept demonstrator can be used for mission planning by constructing what if scenarios to investigate trade-offs such as location of deployment and mode of transport. 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 costs in a digital representation of the real terrain. Although significant research has been done on path finding, the success of a particular technique relies on the environment and existing constraints. The MUPFP is ideal for a constraint-based approach because it requires flexibility in modelling. The authors formulate the MUPFP as a constraint satisfaction problem and a constraint-based extension of the search algorithm. The concept demonstrator uses a provided map, for example taken from Google Earth, on which various obstacles and threats can be manually marked. Our constraint based approach to path finding allows for flexibility and ease of modelling. It has the advantage of modelling new environments or additional constraints with ease, and it produces near optimal solutions if solving is halted prematurely. DA - 2010-04 DB - ResearchSpace DP - CSIR KW - Military unit path finding problem KW - Rural urban military operations KW - Autonomous systems KW - Scenario planning KW - Google earth KW - Spring Simulation Multiconference 2010 LK - https://researchspace.csir.co.za PY - 2010 SM - 978-161738-2079 T1 - Constraint-based solver for the Military unit path finding problem TI - Constraint-based solver for the Military unit path finding problem UR - http://hdl.handle.net/10204/4200 ER -