Skip navigation
Skip navigation

Path Planning with Compressed All-Pairs Shortest Paths Data

Botea, Adi; Harabor, Daniel


All-pairs shortest paths (APSP) can eliminate the need to search in a graph, providing optimal moves very fast. A major challenge is storing pre-computed APSP data efficiently. Recently, compression has successfully been employed to scale the use of APSP

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


File Description SizeFormat Image
01_Botea_Path_Planning_with_Compressed_2013.pdf212.22 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator