Abstract
A novel model of organized neural network is shown to be very effective for path planning and obstacle avoidance in an unknown map which is represented by topologically ordered neurons. With the limited information of neighbor position and distance of the target position, robot will autonomously provide a proper path with free-collision and no redundant exploring in the process of exploring. The computer simulation will illustrate the performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Simon, X.Y., Max, M.: Neural Network Approaches to Dynamic Collision-Free Trajectory Generation. IEEE Trans. on Syst., Man, and Cybern 31(3) (2001)
Hu, S., Wang, J.: Global Stability of a Class of Continuous-Time Recurrent Neural Networks. IEEE Trans. on Circuits and Systems-I: Fundamental Theory and Applications 49(9) (2002)
Cohen, M.A., Grossberg, S.: Absolute stability of global pattern formation and parallel memory storage by competitive neural networks. IEEE Trans. on Systems, Man, and Cybernetics (1983)
Grossberg, S.: Nonlinear neural networks: principles, mechanisms, and architectures. Neural Networks (1988)
Glasius, R., et al.: Neural network dynamics for path planning and obstacle avoidance. Neural Networks 8(1), 125–133 (1995)
Ong, C.J., Gillert, E.G.: Robot path planning with penetration growth distance. J. Robot. Syst. 15(2), 57–74 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bin, N., Xiong, C., Liming, Z., Wendong, X. (2004). Recurrent Neural Network for Robot Path Planning. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-30501-9_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24013-6
Online ISBN: 978-3-540-30501-9
eBook Packages: Computer ScienceComputer Science (R0)