Block A*: Database-Driven Search with Applications in Any-Angle Path-Planning

We present three new ideas for grid-based path-planning algorithms that improve the search speed and quality of the paths found. First, we introduce a new type of database, the Local Distance Database (LDDB), that contains distances between boundary points of a local neighborhood. Second, an LDDB-based algorithm is introduced, called Block A*, that calculates the optimal path between start and goal locations given the local distances stored in the LDDB. Third, our experimental results for any-angle path planning in a wide variety of test domains, including real game maps, show that Block A* is faster than both A* and the previously best gridbased any-angle search algorithm, Theta*.

Authors

• Peter Yap University of Alberta
• Neil Burch
• Robert Holte
• Jonathan Schaeffer University of Alberta

Keywords

No keywords are indexed for this paper.