Compressing Optimal Paths with Run Length Encoding
From MaRDI portal
Publication:3460383
DOI10.1613/jair.4931zbMath1347.68115OpenAlexW2201539200WikidataQ129489531 ScholiaQ129489531MaRDI QIDQ3460383
Ben Strasser, Adi Botea, Daniel Harabor
Publication date: 7 January 2016
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4931
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On partial state matching ⋮ The compressed differential heuristic ⋮ Fast optimal and bounded suboptimal Euclidean pathfinding ⋮ Regarding Goal Bounding and Jump Point Search
This page was built for publication: Compressing Optimal Paths with Run Length Encoding