{"type":"ScholarlyArticle","title":"Scalable Landmark Hub Labeling for Optimal and Bounded Suboptimal Pathfinding","authors":[{"name":"Sabine Storandt","slug":"sabine-storandt","given":"Sabine","family":"Storandt","affiliation":"Universität Konstanz , Germany"}],"abstract":"Hub Labeling and A* are two well-established algorithms for shortest path computation in large graphs.  Hub Labeling offers excellent query times for distance computation, but at  the cost of a high space consumption for label storage. Landmark-based A* search  requires less space but  answers queries much slower. Recently, Landmark Hub Labeling (LHL) has been proposed, which  combines both concepts and achieves a smaller space consumption than Hub Labeling and also much better query times than A*. However, the known algorithms for computing a LHL do not scale to large graphs, limiting its applicability. In this paper, we devise novel algorithms for LHL construction that work on graphs with millions of edges. We also further improve the LHL query answering algorithm and investigate  how to  reduce the space consumption  of labeling techniques by performing bounded suboptimal pathfinding. In an extensive experimental study, we demonstrate the effectiveness of our methods and illuminate that sensible  trade-offs between space consumption, query time, and path quality  can be achieved with LHL.","doi":"10.24963/ijcai.2024/750","url":"https://ijcai.org/proceedings/2024/750","pdf":"https://ijcai.org/proceedings/2024/0750.pdf","markdown":"https://ijcai.org/proceedings/2024/750.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/750","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Planning and Scheduling","track":"Main Track","number":750,"pages":{"first":6788,"last":6795},"keywords":["Search: S: Applications","Multidisciplinary Topics and Applications: MTA: Transportation","Planning and Scheduling: PS: Routing","Search: S: Combinatorial search and optimisation"],"videos":[],"references":[{"position":1,"raw":"[Babenko et al., 2015] Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, and Mathias Weller. On the complexity of hub labeling (extended ab- stract). In Proc. 40th Int. Symp. Mathematical Foundations of Computer Science (MFCS '15), volume 9235 of Lecture Notes in Computer Science, pages 62-74. Springer, 2015.","title":"On the complexity of hub labeling (extended abstract)","authors":"Maxim A Babenko, Andrew V Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller","year":"2015","venue":"Proc. 40th Int. Symp. Mathematical Foundations of Computer Science (MFCS '15)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bauer et al., 2010] Reinhard Bauer, Tobias Columbus, Bas- tian Katz, Marcus Krug, and Dorothea Wagner. Prepro- cessing speed-up techniques is hard. In International Con- ference on Algorithms and Complexity, pages 359-370. Springer, 2010.","title":"Preprocessing speed-up techniques is hard","authors":"Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner","year":"2010","venue":"International Conference on Algorithms and Complexity","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chen et al., 2021] Zitong Chen, Ada Wai-Chee Fu, Minhao Jiang, Eric Lo, and Pengfei Zhang. P2H: efficient distance querying on road networks by projected vertex separators. In Proc. 2021 Int. Conf. Management of Data (SIGMOD '21), pages 313-325. ACM, 2021.","title":"P2H: efficient distance querying on road networks by projected vertex separators","authors":"Chen","year":"2021","venue":"Proc. 2021 Int. Conf. Management of Data (SIGMOD '21)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cohen et al., 2003] Edith Cohen, Eran Halperin, Haim Ka- plan, and Uri Zwick. Reachability and distance queries via 2-hop labels. SIAM J. Comput., 32(5):1338-1355, 2003.","title":"Reachability and distance queries via 2-hop labels","authors":"Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick","year":"2003","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Delling et al., 2006] Daniel Delling, Peter Sanders, Do- minik Schultes, and Dorothea Wagner. Highway hierar- chies star. In The Shortest Path Problem, pages 141-174, 2006.","title":"Highway hierarchies star","authors":"Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner","year":"2006","venue":"The Shortest Path Problem","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Delling et al., 2013a] Daniel Delling, Andrew V Goldberg, Andreas Nowatzyk, and Renato F Werneck. Phast: Hardware-accelerated shortest path trees. Journal of Par- allel and Distributed Computing, 73(7):940-952, 2013.","title":"Phast: Hardware-accelerated shortest path trees","authors":"Delling","year":"2013","venue":"Journal of Parallel and Distributed Computing","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Delling et al., 2013b] Daniel Delling, Andrew V Goldberg, and Renato F Werneck. Hub label compression. In Proc. 12th Int. Symp. Experimental Algorithms (SEA '13), vol- ume 7933 of Lecture Notes in Computer Science, pages 18-29. Springer, 2013.","title":"Hub label compression","authors":"Delling","year":"2013","venue":"Proc. 12th Int. Symp. Experimental Algorithms (SEA '13)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Delling et al., 2014a] Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck. Robust distance queries on massive networks. In Proc. 22th Ann. Eu- rop. Symp. Algorithms (ESA '14), volume 8737 of Lec- ture Notes in Computer Science, pages 321-333. Springer, 2014.","title":"Robust distance queries on massive networks","authors":"Delling","year":"2014","venue":"Proc. 22th Ann. Europ. Symp. Algorithms (ESA '14)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Delling et al., 2014b] Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, and Renato F. Werneck. Hub labels: Theory and practice. In Proc. 13th Int. Symp. Experimen- tal Algorithms (SEA '14), volume 8504 of Lecture Notes in Computer Science, pages 259-270. Springer, 2014.","title":"Hub labels: Theory and practice","authors":"Delling","year":"2014","venue":"Proc. 13th Int. Symp. Experimental Algorithms (SEA '14)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Efentakis and Pfoser, 2013] Alexandros Efentakis and Di- eter Pfoser. Optimizing landmark-based routing and pre- processing. In Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science, pages 25-30, 2013.","title":"Optimizing landmark-based routing and preprocessing","authors":"Alexandros Efentakis, Dieter Pfoser","year":"2013","venue":"Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Foead et al., 2021] Daniel Foead, Alifio Ghifari, Marchel Budi Kusuma, Novita Hanafiah, and Eric Gunawan. A systematic literature review of a* pathfind- ing. Procedia Computer Science, 179:507-514, 2021.","title":"A systematic literature review of a* pathfinding","authors":"Daniel Foead, Alifio Ghifari, Marchel Budi Kusuma, Novita Hanafiah, Eric Gunawan","year":"2021","venue":"Procedia Computer Science","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Geisberger et al., 2012] Robert Geisberger, Peter Sanders, Dominik Schultes, and Christian Vetter. Exact routing in large road networks using contraction hierarchies. Trans- portation Science, 46(3):388-404, 2012.","title":"Exact routing in large road networks using contraction hierarchies","authors":"Robert Geisberger, Peter Sanders, Dominik Schultes, Christian Vetter","year":"2012","venue":"Transportation Science","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Goldberg and Harrelson, 2005] Andrew V Goldberg and Chris Harrelson. Computing the shortest path: A search meets graph theory. In SODA, volume 5, pages 156-165.","title":"Computing the shortest path: A search meets graph theory","authors":"V Andrew, Chris Goldberg, Harrelson","year":null,"venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Goldberg et al., 2007] Andrew V Goldberg, Haim Kaplan, and Renato F Werneck. Better landmarks within reach. In International Workshop on Experimental and Efficient Algorithms, pages 38-51. Springer, 2007.","title":"Better landmarks within reach","authors":"Haim Andrew V Goldberg, Renato F Kaplan, Werneck","year":"2007","venue":"International Workshop on Experimental and Efficient Algorithms","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gonzalez, 1985] Teofilo F Gonzalez. Clustering to mini- mize the maximum intercluster distance. Theoretical com- puter science, 38:293-306, 1985.","title":"Clustering to minimize the maximum intercluster distance","authors":"F Teofilo, Gonzalez","year":"1985","venue":"Theoretical computer science","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hershberger and Suri, 2001] John Hershberger and Sub- hash Suri. Vickrey prices and shortest paths: What is an edge worth? In Proceedings 42nd IEEE symposium on foundations of computer science, pages 252-259. IEEE, 2001.","title":"John Hershberger and Subhash Suri. Vickrey prices and shortest paths: What is an edge worth?","authors":"Suri Hershberger","year":"2001","venue":"Proceedings 42nd IEEE symposium on foundations of computer science","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Korf, 1988] Richard E Korf. Optimal path-finding algo- rithms. In Search in artificial intelligence, pages 223-267. Springer, 1988.","title":"Optimal path-finding algorithms","authors":"Richard E Korf","year":"1988","venue":"Search in artificial intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ouyang et al., 2018] Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, and Qing Zhu. When hierarchy meets 2-hop-labeling: Efficient shortest distance queries on road networks. In Proc. 2018 Int. Conf. Management of Data (SIGMOD '18), pages 709-724. ACM, 2018.","title":"When hierarchy meets 2-hop-labeling: Efficient shortest distance queries on road networks","authors":"Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu","year":"2018","venue":"Proc. 2018 Int. Conf. Management of Data (SIGMOD '18)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Peque et al., 2017] Genaro Peque, Junji Urata, and Taka- masa Iryo. Implementing an alt algorithm for large-scale time-dependent networks. In 22nd International Con- ference of Hong Kong Society for Transportation Stud- ies: Transport and Society, HKSTS 2017, pages 515-522.","title":"Implementing an alt algorithm for large-scale time-dependent networks","authors":"Genaro Peque, Junji Urata, Takamasa Iryo","year":"2017","venue":"22nd International Conference of Hong Kong Society for Transportation Studies: Transport and Society","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Potamias et al., 2009] Michalis Potamias, Francesco Bonchi, Carlos Castillo, and Aristides Gionis. Fast shortest path distance estimation in large networks. In Proceedings of the 18th ACM conference on Information and knowledge management, pages 867-876, 2009.","title":"Fast shortest path distance estimation in large networks","authors":"Michalis Potamias, Francesco Bonchi, Carlos Castillo, Aristides Gionis","year":"2009","venue":"Proceedings of the 18th ACM conference on Information and knowledge management","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Shen et al., 2022] Bojie Shen, Muhammad Aamir Cheema, Daniel D Harabor, and Peter J Stuckey. Fast optimal and bounded suboptimal euclidean pathfinding. Artificial In- telligence, 302:103624, 2022.","title":"Fast optimal and bounded suboptimal euclidean pathfinding","authors":"Shen","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Storandt, 2022] Sabine Storandt. Algorithms for landmark hub labeling. In 33rd International Symposium on Algo- rithms and Computation (ISAAC 2022). Schloss Dagstuhl- Leibniz-Zentrum für Informatik, 2022.","title":"Algorithms for landmark hub labeling","authors":"Sabine Storandt, Storandt","year":"2022","venue":"33rd International Symposium on Algorithms and Computation (ISAAC 2022)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Sturtevant, 2012] N. Sturtevant. Benchmarks for grid-based pathfinding. Transactions on Computational Intelligence and AI in Games, 4(2):144 -148, 2012.","title":"Benchmarks for grid-based pathfinding","authors":"N Sturtevant","year":"2012","venue":"Transactions on Computational Intelligence and AI in Games","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}