Numerical technique for robot path planning using four Point-EG iterative method

Path planning is an important issue as it allows a robot to get from start point to goal point. In this work, we attempt to solve robot path planning problem iteratively using numerical technique. It is based on the use of Laplace´s Equation to compute potential function in the configuration space of a mobile robot. This paper proposed a block iterative method known as 4 Point-EG for solving robot path planning problem. By employing a finite-difference technique, the experiment shows that it able to generate smooth path between the start and goal points. Furthermore, the simulation results show that 4 Point-EG performs faster than the previous method in generating path for mobile robot motion.