Robot pathfinding with obstacle avoidance capabilities in a static indoor environment via TOR iterative method using harmonic potentials

Abstract

Mobile robots are always in a state where they have to find a collision-free path in their environment from start to the target point. This study tries to solve the problem of mobile robot iteratively by using a numerical technique. It is based on potential field technique that was modelled using the Laplace’s equation to restrain the creation of a potential functions across regions in the mobile robot’s configuration space. The gradient formed by the potential field is then used to generate a path for the robot to advance through. The present paper proposes a Two-Parameter Over-Relaxation (TOR) iterative method that is used to solve Laplace’s equation for obtaining the potential field that is then utilized for finding path of the robot, thus solving the robot pathfinding problem. The experiment indicates that it is capable of producing a smooth path between the starting and target points through the use of a finite-difference technique. Furthermore, the simulation results show that this numerical approach executes quicker and provides a smoother trail than to the previous works, that includes Successive Over-Relaxation (SOR) and Accelerated Over-Relaxation (AOR) methods.

Path discovering in maze area using mobile robot

“…A robot designed to traverse unknown confined spaces, such as underground tunnels, caves, and pipes, would depend on a limited number of sensors because the robot must be light and small. Typically the robot would sense using small, low power consumption, infrared, cliff, and ultrasonic sensors, as a small, lightweight robot will have a small power source [9], [10]. Maze-solving is the act of discovering away in the maze.…”