Abstract
This paper introduces the concept of a resistive grid for solving the path planning problem for a mobile robot in real time. The robot’s environment is mapped onto a grid of hexagonal or rectangular cells of uniform resistance except that obstacles are represented by regions of infinite resistance. If current is injected at the nodes corresponding to the robot’s present position and its goal, the path of maximum current will give a guaranteed path to the goal. The method is particularly amenable to implementation in VLSI. A test chip using novel amorphous silicon technology has been fabricated.
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
Horn, B.K.P. “Determining lightness from an image” Computational Graphics & Image Processing, 3, 277–299, 1974.
Hutchinson, J., Koch, C., Luo, J. and Mead, C.A. “Computing motion using analog and binary resistive networks” IEEE Computers,21, 52–63, 1988.
Mead, C.A. and Mahowald, M.A. “A silicon model of early visual processing” Neural Networks,1, 91–97, 1988.
Rose, M.J., Hajto, J., LeComber, P.G., Gage, S.M., Choi, W.K., Snell, A.J., Owen, A.E. “Amorphous Silicon Analogue Memory Devices” J Non-Cryst. Sol., 115, 168–170, 1989.
Tarassenko, L. and Blake, A. “Analogue computation of collision-free paths” OUEL Report 1858/90, Oxford University Engineering Department, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tarassenko, L., Marshall, G., Gomez-Castaneda, F., Murray, A. (1991). Parallel Analogue Computation for Real-Time Path Planning. In: Delgado-Frias, J.G., Moore, W.R. (eds) VLSI for Artificial Intelligence and Neural Networks. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3752-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3752-6_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6671-3
Online ISBN: 978-1-4615-3752-6
eBook Packages: Springer Book Archive