Ultra-fast Optimal Pathfinding without Runtime Search
Pathfinding is important in many applications, including games, robotics and GPS itinerary planning. In games, most pathfinding methods rely on runtime search. Despite numerous enhancements introduced in recent years, runtime search has the disadvantage t
|Collections||ANU Research Publications|
|Source:||Ultra-fast Optimal Pathfinding without Runtime Search|
|01_Botea_Ultra-fast_Optimal_Pathfinding_2011.pdf||256.24 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.