Updating Distance Maps When Objects Move

Terrance E. Boult, Wendell H. Chun, William J. Wolfe
1987 Mobile Robots II  
\BSTRACT [sing a discrete distance transform one can quicicly build a map of the distance from a goal to every point in a digital map. [sing this map, one can easily solve the shortest path problem irom any point by simply following the gra.d..ient of the distance map. This technique can be used in any number of dimensions and can incorporate obstacles of arbitrary shape (represented in the digital map) including pseudo-obstacles caused by unattainable configurations of a robotic system. This
more » ... otic system. This paper further extends the usefulness of the digital distance transform technique by providing an efficient means for dealing with objects which undergo motion. In particular, an algorithm is presented that allows one to update only those portions of the distance map that will potentially change as an object moves. The technique is based on an analysis of the distance transform as a problem in wave propagation. The regions that must be checked for possible update when an object moves are those that are in its "shadow~, or in the shadow of objects that are partially in the shadow of the moving object. The technique can handle multiple goals, and multiple objects moving and interacting in an arbitrary fashion. The algorithm is demonstrated on a number of synthetic two dimensional examples.
doi:10.1117/12.968252 fatcat:memlmzqu2fcx5fzp2n3cun7ooq