Field D* pathfinding in weighted simplicial complexes
Includes abstract. === Includes bibliographical references. === The development of algorithms to efficiently determine an optimal path through a complex environment is a continuing area of research within Computer Science. When such environments can be represented as a graph, established graph searc...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
University of Cape Town
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/11427/6433 |