Skip navigation
Skip navigation

An Optimal Any-Angle Pathfinding Algorithm

Harabor, Daniel; Grastien, Alban


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

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
Source: International Conference on Automated Planning & Scheduling


File Description SizeFormat Image
01_Harabor_An_Optimal_Any-Angle_2013.pdf486.31 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator