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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An efficient obstacle avoidance scheme in mobile robot path planning using polynomial neural networks


    Contributors:
    Ahmed, F. (author) / Chen, C.L.P. (author)


    Publication date :

    1993-01-01


    Size :

    241970 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Adaptive Path Planning for Mobile Robot Obstacle Avoidance

    Rong-Jong Wai / Chia-Ming Liu | BASE | 2011

    Free access

    Global Path Planning with Obstacle Avoidance for Omnidirectional Mobile Robot Using Overhead Camera

    Ziaei, Z. / Oftadeh, R. / Mattila, J. et al. | British Library Conference Proceedings | 2014


    Obstacle avoidance using neural networks

    DeMuth, G. / Springsteen, S. | Tema Archive | 1990


    Optimal Path Planning Obstacle Avoidance of Robot Manipulator System using Bézier Curve

    A. AL-Qassar, Arif / N. Abdulnabi, Ali | BASE | 2018

    Free access

    An Optimal Obstacle Avoidance Path Planning Algorithm for the Excalibur Robot

    Banerjee, V. K. / Earl, C. S. / Looke, T. D. et al. | British Library Conference Proceedings | 1991