Field D* Pathfinding in Weighted Simplicial Complexes
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 search algorithms, such as Dijkstra’s shortest path and A*, can be us...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://pubs.cs.uct.ac.za/archive/00000924/ |