Path Planning with Compressed All-Pairs Shortest Paths Data
Loading...
Date
Authors
Botea, Adi
Harabor, Daniel
Journal Title
Journal ISSN
Volume Title
Publisher
AAAI Press
Abstract
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
Description
Keywords
Citation
Collections
Source
International Conference on Automated Planning & Scheduling
Type
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31
Downloads
File
Description