Abstract

With the wide application of Bioinspired Neural Network in the field of robot path planning, the environmental scale of robot path planning is getting larger, and the environmental resolution requirements are getting higher. However, with the increase of the environment size and resolution requirement, the neuronal activity value calculation cost and the time cost of the Bioinspired Neural Network will increase sharply. Aiming at this problem, this paper proposes an improved Bioinspired Neural Network path planning method based on Scaling Terrain. Using a Multi-Scale Map method and Dijkstra algorithm, the optimal path of a Coarse Scale Map is calculated. The optimal path obtained from the Coarse Scale Map is used to guide the neural network planning weights of the Fine Scale Map from the same terrain. Thus, the optimal path of the Fine Scale Map can be calculated by the improved BNN algorithm. Introducing this Multi-Scale Map Method into the Bioinspired Neural Network can greatly reduce the time cost of the Bioinspired Neural Network path planning algorithm and reduce the mathematical complexity. Simulation results in some computer integrated virtual environments further demonstrate the superiority of this method and the experimental results are encouraging.

Highlights

  • Inspired by Hodgkin and Huxley’s membrane model and Grossberg’s shunting model, Simon X

  • Selecting the Fine Scale Map Sm of the Set S; 4: Reading the start point positon sp and end point position ep of path planning; 5: Using the Dijkstra algorithm to calculate the 3D optimal path cop based on the selecting Coarse Scale Map Sk in the Step 2

  • A Coarse Scale Map which can reprensent the basic geomorphic features of this complex enviroment is selected from the Multi-Scale 3D Map Set

Read more

Summary

INTRODUCTION

Inspired by Hodgkin and Huxley’s membrane model and Grossberg’s shunting model, Simon X. M. Luo et al.: Multi-Scale Map Method Based on Bioinspired Neural Network Algorithm for Robot Path Planning online and real-time path planning in complex dynamic environment. Selecting the Fine Scale Map Sm of the Set S; 4: Reading the start point positon sp and end point position ep of path planning; 5: Using the Dijkstra algorithm to calculate the 3D optimal path cop based on the selecting Coarse Scale Map Sk in the Step 2.

It can be seen from the
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.