Path planners based on the wave expansion neural network

In the potential field approach to path planning, the development of the artificial potential field (APF) is a computationally intensive operation. The realization that the APFs can be developed by parallel distributed techniques has prompted interest in using neural networks for developing APFs. This paper describes a neural network called the wave expansion neural network (WENN) and shows that it is capable of developing a variety of APFs that are useful for path planning. The discretized environment including information about the target configuration (position and orientations) and the obstacles are applied to the WENN as input. Activity is then propagated in the form of waves throughout the WENN neural field and at equilibrium, the resulting neural activity distribution forms the desired APF. We analyze the computational complexity of the WENN based APF generation and compare it with conventional development of APFs. We also describe different path planners which use these APFs to plan paths for moving objects with two and three degrees of freedom.

[1]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[2]  Bruce Randall Donald,et al.  Simplified Voronoi diagrams , 1987, SCG '87.

[3]  Andranik Mirzaian Channel routing in VLSI , 1984, STOC '84.

[4]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[5]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[6]  Yoram Koren,et al.  Real-time obstacle avoidance for fact mobile robots , 1989, IEEE Trans. Syst. Man Cybern..

[7]  Narendra Ahuja,et al.  Path Planning Using Potential Field Representation , 1988, Defense, Security, and Sensing.

[8]  Mohamad H. Hassoun,et al.  Locally interconnected layered neural network for path optimization , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[9]  Michael Lemmon,et al.  2-Degree-of-freedom Robot Path Planning using Cooperative Neural Fields , 1991, Neural Computation.

[10]  Sukhan Lee,et al.  Neural computation for collision-free path planning , 1991, J. Intell. Manuf..

[11]  Michael Lemmon,et al.  Real-Time Optimal Path Planning Using a Distributed Computing Paradigm , 1991, 1991 American Control Conference.

[12]  Pradeep K. Khosla,et al.  Real-time obstacle avoidance using harmonic potential functions , 1991, IEEE Trans. Robotics Autom..

[13]  B. Donald Motion Planning with Six Degrees of Freedom , 1984 .

[14]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

[15]  Richard P. Lippmann,et al.  An introduction to computing with neural nets , 1987 .

[16]  B. V. K. Vijaya Kumar,et al.  The wave expansion neural network , 1997, Neurocomputing.

[17]  Ashraf A. Kassim,et al.  Potential fields and neural networks , 1998 .

[18]  Elon Rimon A navigation function for a simple rigid body , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[19]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.

[20]  B.V.K.V. Kumar,et al.  A neural network architecture for path planning , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.

[21]  Erwin Prassler,et al.  Parallel distributed robot navigation in the presence of obstacles , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[22]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[23]  Narendra Ahuja,et al.  Path planning using a potential field representation , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[24]  Der-Tsai Lee Proximity and reachability in the plane. , 1978 .

[25]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[26]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[27]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[28]  Daniel E. Koditschek,et al.  The construction of analytic diffeomorphisms for exact robot navigation on star worlds , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[29]  Charles E. Thorpe,et al.  Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.

[30]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[31]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

[32]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.

[33]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[34]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.