Finding the lowest-cost path through a graph of states is central to many problems, including route planning for a mobile robot. If arc costs change during the traverse, then the remainder of the path may need to br replannrd. Such is the case for a sensor-equipped mobile robot with incomplete or inaccurate information about its environment. As the robot acquires additional information via its ...