Location of Repository

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

By Peter Yap, Neil Burch, Rob Holte and Jonathan Schaeffer

Abstract

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*.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.308.1046
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://webdocs.cs.ualberta.ca/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.