Share Email Print

Proceedings Paper

Path planning by potential diffusion networks
Author(s): Wei Shen; Jun Shen; Jean-Paul Lallemand
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In presence of obstacles of arbitrary forms, the existent methods for shortest path planning need to analyze all classes of topologically different paths, which is time-consuming. In the present paper, we propose the potential diffusion network for path planning in presence of obstacles of arbitrary forms which avoids different topological paths analysis. The starting and goal points of a mobile robot are considered as diffusion sources separately. For each diffusing source, we calculate the potential field by use of a diffusing network which converges to a stable state representing the potential field. The sum of the two fields corresponding respectively to the sources at starting and goal points gives the composed potential distribution in the space. The optimal path is shown to be the iso-potential line of the field, which begins from the starting point and terminates at the goal point. Scenes in robotics being in general represented by discrete arrays of voxels, additional processing for discrete space case is presented also. Our method is implemented and tested for complicated scenes of obstacles of arbitrary forms to find the optimal path, the experimental results are satisfactory.

Paper Details

Date Published: 4 May 1993
PDF: 12 pages
Proc. SPIE 1831, Mobile Robots VII, (4 May 1993); doi: 10.1117/12.143790
Show Author Affiliations
Wei Shen, Univ. de Poitiers (France)
Jun Shen, Univ. Bordeaux 3 (France)
Jean-Paul Lallemand, Univ. de Poitiers (France)

Published in SPIE Proceedings Vol. 1831:
Mobile Robots VII
William J. Wolfe; Wendell H. Chun, Editor(s)

© SPIE. Terms of Use
Back to Top