Mobile robots need a powerful and flexible navigation system in order to move around autonomously in an incompletely known and changing environment. In this paper we present a computational metaphor for path generation which is gleaned from fluid dynamics. It is powerful because it can find optimal paths in a maze of arbitrary complexity and it is flexible because it readily adapts to any change in the topology of the maze. Moreover, it can be proven that the path generator does not suffer from local minima, a defect which hampers some of the other metaphor based methods. We show that the fluid dynamics metaphor also provides ample possibilities to solve more complicated navigation problems including navigation through weighted regions. The paper discusses the natural parallelism of the metaphor and its implementation on the DAP computer, which is an SIMD machine.
[1]
David W. Payton,et al.
Internalized plans: A representation for action resources
,
1990,
Robotics Auton. Syst..
[2]
Luc Steels.
Steps towards Common Sense
,
1988,
ECAI.
[3]
K. Didier,et al.
A flexible path generator for a mobile robot
,
1991,
Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.
[4]
Ronald C. Arkin,et al.
Motor schema based navigation for a mobile robot: An approach to programming by behavior
,
1987,
Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[5]
Oussama Khatib,et al.
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
,
1986
.