ResearchSpace
→
Browsing by Subject

Browsing by Subject "Military Unit Path Finding Problem"

Now showing items 1-2 of 2

A constraint programming solution for the military unit path finding problem

Author: Leenen, L ; Terlunen, A ; Le Roux, H Date: 2012 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 ... Read more
A focussed dynamic path finding algorithm with constraints

Author: Leenen, L ; Terlunen, A Date: Nov 2013 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 ... Read more

Now showing items 1-2 of 2

Browse

All of ResearchSpace

Quick Links

Legislation and compliance

General Enquiries

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

Physical Address
Meiring Naudé Road
Brummeria
Pretoria
South Africa

Postal Address
PO Box 395
Pretoria 0001
South Africa

Social Connect

Resources on this site are free to download and reuse according to associated licensing provision. Please read the terms and conditions of usage of each resource.

Browsing by Subject "Military Unit Path Finding Problem"

Browsing by Subject "Military Unit Path Finding Problem"

Browse

All of ResearchSpace

Quick Links

Legislation and compliance

General Enquiries

Social Connect