The local minimum escape using the grid map

Abstract

Our study is concerned with avoiding the local minimum that occurs when the mobile robot is trapped at a concave-shaped obstacle. Mobile robots use VFF (Virtual Force Field) as their autonomous navigation method. This algorithm generates the attractive force from the target and the repulsive force from the obstacle. So using the sum of these forces, the mobile robot moves to the target point. The method to avoid a local minimum has two steps. The first step is that the mobile robot detects being trapped by an obstacle. The second step is that the mobile robot escapes from the trap point. Then the mobile robot can move to the target point. To execute this, our study uses a grid map to represent the robot’s surroundings. The map is constructed by the robot sensor.