Abstract
Mobile robots often have to discover a path of collision-free towards a specific goal point in their environment. We are trying to resolve the mobile robot problem iteratively by means of numerical technique. It is built on a method of potential field that count on the use of Laplace’s equation in the mobile robot’s configuration space to constrain/which reduces the generation of a potential function over regions. This paper proposed an iterative approach in solving robot path finding problem known as Accelerated Over-Relaxation (AOR). The experiment shows that these suggested approach can establish a smooth pat between the starting and goal points by engaging with a finite-difference technique. The simulation results also show that a more rapidly solution with smoother path than the previous work is achieved via this numerical approach.
Sign-in/Register to access full text options 
Free) 
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
