The computation of shortest paths as a basic task in robotics can be accomp
lished by graph-searching algorithms, Attempts have been made to accelerate
a part of these algorithms-the computation of potential vectors-using fine
-grained parallel hardware. As shown in this paper, the complexity of digit
al path-planning circuits can be enormously reduced, if distances are encod
ed by hardware time delays.