GENERAL ENQUIRIES: Tel: + 27 12 841 2911 | Email: callcentre@csir.co.za

Show simple item record

dc.contributor.author Leenen, L
dc.contributor.author Terlunen, A
dc.contributor.author Le Roux, H
dc.date.accessioned 2012-08-30T09:18:44Z
dc.date.available 2012-08-30T09:18:44Z
dc.date.issued 2012
dc.identifier.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 en_US
dc.identifier.isbn 978-1-4398-6300-8
dc.identifier.isbn 978-1-4398-6301-5
dc.identifier.uri http://hdl.handle.net/10204/6074
dc.description Copyright: 2012 Taylor and Francis. This is an ABSTRACT ONLY. en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Taylor & Francis Group en_US
dc.relation.ispartofseries Workflow;5844
dc.subject Dynamic Military Unit Path Finding Problem en_US
dc.subject DMUPFP en_US
dc.subject D* algorithm en_US
dc.subject Algorithms en_US
dc.subject Military Unit Path Finding Problem en_US
dc.subject MUPFP en_US
dc.subject Military units en_US
dc.subject Path costs en_US
dc.title A constraint programming solution for the military unit path finding problem en_US
dc.type Book chapter en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ResearchSpace


Advanced Search

Browse

My Account