An Optimal Any-Angle Pathfinding Algorithm
Any-angle pathfinding is a common problem from robotics and computer games: it requires finding a Euclidean shortest path between a pair of points in a grid map. Prior research has focused on approximate online solutions. A number of exact methods exist b
|Collections||ANU Research Publications|
|Source:||International Conference on Automated Planning & Scheduling|
|01_Harabor_An_Optimal_Any-Angle_2013.pdf||486.31 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.