DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/6074

Title: A constraint programming solution for the military unit path finding problem
Authors: Leenen, L
Terlunen, A
Le Roux, H
Keywords: Dynamic Military Unit Path Finding Problem
DMUPFP
D* algorithm
Algorithms
Military Unit Path Finding Problem
MUPFP
Military units
Path costs
Issue Date: 2012
Publisher: Taylor & Francis Group
Citation: 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
Series/Report no.: Workflow;5844
Abstract: 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.
Description: Copyright: 2012 Taylor and Francis. This is an ABSTRACT ONLY.
URI: http://hdl.handle.net/10204/6074
ISBN: 978-1-4398-6300-8
978-1-4398-6301-5
Appears in Collections:Command control and information warfare
Advanced mathematical modelling and simulation
Mobile intelligent autonomous systems
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Leenen_2012.pdf177.71 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback