Improved A-star algorithm for robot path planning in static environment

Abstract A-star algorithm is a kind of simple path planning without solving the calculus, which has high application. However, compared with other algorithms, it occupies large memory space. To solve this problem, paper proposes three new concepts such as bidirectional search, guide line and list key points. optimized rasterize on indoor environment modeling method, finally through MATLAB simulation experiments prove that feasible experimental results show improved in target different under two kinds experiment are able to reduce footprint by more than 60%.