Online Graph Pruning for Pathfinding on Grid Maps
Pathfinding in uniform-cost grid environments is a problem commonly found in application areas such as robotics and video games. The state-of-the-art is dominated by hierarchical pathfinding algorithms which are fast and have small memory overheads but usually return suboptimal paths. In this paper we present a novel search strategy, specific to grids, which is fast, optimal and requires no memory overhead. Our algorithm can be described as a macro operator which identifies and selectively...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of AAAI 2011|
|01_Harabor_Online_Graph_Pruning_for_2011.pdf||249.61 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.