Improved A * algorithm for robot path planning in unknown environment

Abstract

A* algorithm was a heuristic state space search method under the known environment originally. In this paper, the A* algorithm is improved and optimized by introducing a variable of visits number so that it can work in unknown environment. Besides, the path planning process is simulated by the improved A* algorithm realized in the Visual C ++ 6.0 development environment. The feasibility and effectiveness of the proposed algorithm is shown by the experimental results.