On the expected complexity of random path planning

This paper gives an account of the convergence property of potential field based path planning algorithms that use random motions to escape local minima. Their probabilistic convergence is proved and we provide a finite estimate of the convergence time. The proof is based on the study of Markov chains and diffusion processes.