1. This project is an improved A* algorithm for path planning,three improvements to the conventional A* algorithm, including expansion distance, bidirectional search, and smoothing, are introduced, analyzed and implemented in an improved proposed method. 2. The source code includes three files. astar.cpp, grid_path.cpp, planner_core.cpp. 3. The detailed test process is in the "test procedures.docx" file.