Ultra-fast Optimal Pathfinding without Runtime Search
Description
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 |
---|---|
Date published: | 2011 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/37158 |
Source: | Ultra-fast Optimal Pathfinding without Runtime Search |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
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.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator