Open AccessA Mobile Robot Path Planning Scheme for Dynamic Environments
Author(s) -
Kene Li,
Qiaoliang Mo,
Zhen Zeng,
Bei Liu
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/758/1/012026
Subject(s) - motion planning , obstacle avoidance , scheme (mathematics) , mobile robot , obstacle , computer science , path length , variable (mathematics) , path (computing) , energy (signal processing) , robot , collision , artificial neural network , collision avoidance , real time computing , simulation , mathematical optimization , artificial intelligence , mathematics , computer network , mathematical analysis , statistics , computer security , political science , law
This paper proposes a four-direction search method for obstacle avoidance of mobile robots, and the collision energy of obstacles is modeled based on the neural network. For comparison and discussion purposes, the different invariant step lengths are tested in the static environment. To take the advantages of the large and small step lengths effectively, a variable step length method is adopted to improve the performance, such as less iteration number and lower total energy. The variable step length method is also applied to the dynamic environment to explore the real-time performance for path planning. Simulation results demonstrate the effectiveness and practicability of the presented scheme.