Search
Now showing items 1-1 of 1
Field D* pathfinding in weighted simplicial complexes
(2013)
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 ...