Maze path planning of mobile robots by gradient map rendering and gradient follow Online publication date: Thu, 19-Nov-2020
by Arockia Selvakumar Arockia Doss; Arka Das; K.L. Pavan; D. Dinakaran
International Journal of Advanced Mechatronic Systems (IJAMECHS), Vol. 8, No. 2/3, 2020
Abstract: Path planning for a human being is very easy to reach a desired location in a room, by avoiding obstacles on the way, by generating a mental map and uses this map to find the optimal path. This is a difficult task in case of a robot. In order to make the robot adapt, the system is fed with different obstacle arrangement in the same room and allow the robot to finalise the optimal path avoiding the obstacles. To achieve, the gradient map rendering algorithm is proposed with successful simulation results in MATLAB. The new map produced has given a gradient again using the same algorithm. After the rendering process is completed, the robot climbs up or down the gradient using the maximum or minimum local gradient technique respectively, to find its way to the destination cell. Gradient surface plots are obtained for a variety of mazes to give a visualisation of how the gradient is being formed. Results are obtained after maze simulation successfully shows the most optimised path in any kind of maze.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Mechatronic Systems (IJAMECHS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook