Path Symmetries in Undirected Uniform-Cost Grids
Harabor, Daniel; Botea, Adi; Kilby, Philip
Description
We explore a symmetry-based reformulation technique which can speed up optimal pathfinding on undirected uniform-cost grid maps by over 30 times. Our offline approach decomposes grid maps into a set of empty rectangles, removing from each all interior nod
Collections | ANU Research Publications |
---|---|
Date published: | 2011 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/35875 |
Source: | Symposium on Abstraction, Reformulation, and Approximation (SARA 2011) proceedings |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Harabor_Path_Symmetries_in_Undirected_2011.pdf | 169.02 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