Navigation of a free-ranging mobile robot using heuristic local path-planning algorithm

The local path-planning algorithm using a human's heuristic and a laser range finder which has an excellent resolution with respect to angular and distance measurements is presented for real-time navigation of a free-ranging mobile robot. The algorithm utilizes the human's heuristic by which the shortest path from the various pathways to the goal can be found, even though the path may not have been taken before. In this paper, the attractive potentials in each candidate pathway are calculated in terms of the angle between the goal and pathway direction, the pathway width, and the angle between pathway and previous heading direction of the mobile robot. Consequently, the mobile robot chooses the optimal path that has the maximum attractive potential among candidate pathways. The heuristic principles are applied to the path decision of the mobile robot such as forward open way, side open way and no way. Also, the effectiveness of the established path-planning algorithm is examined by computer simulation and experiment in a complex environment.