Abstract
The authors investigate a path planning approach that consists of concurrently building and searching a graph connecting the local minima of a numerical potential field defined over the robot's configuration space. They describe techniques for constructing 'good' potentials and efficient methods for dealing with the local minima of these functions. These techniques have been implemented in fast planners that can deal with single and/or multiple robot systems with few and/or many degrees of freedom. Some experimental results with these planners are described.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
