Application of Polynomial Neural Networks (PNN) in mobile robot path planning with an obstacle avoidance scheme is proposed. Given an environment and a desired goal location (position and orientation), PNN's are built from some selected starting locations to reach this goal. These PNNs comprise the memory of our model. An efficient associative retrieval technique is then applied to make the robot follow a minimal cost polynomial path. In the movement, when it faces an obstacle, the robot uses a contour finding algorithm to get away from the obstacle. The major advantage of using the PNNs is its interpolating capability with a moderate size of data space. Also no preprocessing of the range data is necessary.<>
An efficient obstacle avoidance scheme in mobile robot path planning using polynomial neural networks
1993-01-01
241970 byte
Conference paper
Electronic Resource
English
Global Path Planning with Obstacle Avoidance for Omnidirectional Mobile Robot Using Overhead Camera
British Library Conference Proceedings | 2014
|Obstacle avoidance using neural networks
Tema Archive | 1990
|Optimal Path Planning Obstacle Avoidance of Robot Manipulator System using Bézier Curve
BASE | 2018
|An Optimal Obstacle Avoidance Path Planning Algorithm for the Excalibur Robot
British Library Conference Proceedings | 1991
|