Abstract
Computing diverse shortest paths requires finding a set of k alternative paths (including the shortest path) between a given source s and a target t. Intuitively, these paths should be significantly different from each other and meaningful/natural (e.g., must not contain loops or unnecessary detours). While finding diverse shortest paths (also called alternative paths) in road networks has been extensively studied, to the best of our knowledge, we are the first to formally study alternative pathfinding in game maps which are typically represented as Euclidean planes containing polygonal obstacles. First, we adapt the existing techniques designed for road networks to find alternative paths in the game maps. Then, we design a web-based system that allows the users to visualise the alternative paths generated by these existing approaches in different maps. Finally, we use this web-based system to conduct a user study that shows that the existing road network approaches generate high-quality alternative paths when adapted for the game maps. Furthermore, we also evaluate the quality of alternative paths returned by existing approaches using some well-known quantitative measures on a widely used game maps benchmark.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
For example, see a game development project with Unity3D at https://arongranberg.com/astar/docs/alternativepath.html.
- 2.
- 3.
- 4.
- 5.
- 6.
References
Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230–241. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20662-7_20
Akgün, V., Erkut, E., Batta, R.: On finding dissimilar paths. Eur. J. Oper. Res. 121(2), 232–246 (2000)
Cheema, M.A.: Indoor location-based services: challenges and opportunities. SIGSPATIAL Spec. 10(2), 10–17 (2018)
Chen, Y., Bell, M.G., Bogenberger, K.: Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system. IEEE Trans. Intell. Transp. Syst. 8, 14–20 (2007)
Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-dissimilar paths with minimum collective length. In: SIGSPATIAL (2018)
Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-shortest paths with limited overlap. VLDB J. 29(5), 1023–1047 (2020)
Cui, M., Harabor, D.D., Grastien, A.: Compromise-free pathfinding on a navigation mesh. In: IJCAI.,pp. 496–502 (2017)
Häcker, C., Bouros, P., Chondrogiannis, T., Althaus, E.: Most diverse near-shortest paths. In: SIGSPATIAL, pp. 229–239 (2021)
Jones, A.H.: Method of and apparatus for generating routes. US Patent 8,249,810, 21 Aug 2012
Kobitzsch, M.: An alternative approach to alternative routes: HiDAR. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 613–624. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40450-4_52
Kobitzsch, M., Radermacher, M., Schieferdecker, D.: Evolution and evaluation of the penalty method for alternative graphs. In: ATMOS, vol. 33, pp. 94–107 (2013)
Li, L., Cheema, M.A.: Alternative pathfinding in game maps and indoor venues. In: ICAPS (2021)
Li, L., Cheema, M.A., Lu, H., Ali, M.E., Toosi, A.N.: Comparing alternative route planning techniques: a comparative user study on Melbourne. Dhaka and Copenhagen road networks. IEEE TKDE (2021)
Li, Y., Yiu, M.L., Kou, N.M., et al.: An experimental study on hub labeling based shortest path algorithms. PVLDB 11(4), 445–457 (2017)
Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE Trans. Knowl. Data Eng. 30, 488–502 (2017)
Moghanni, A., Pascoal, M., Godinho, M.T.: Finding shortest and dissimilar paths. Int. Trans. Oper. Res. 29(3), 1573–1601 (2022)
Oh, S., Leong, H.W.: Edge n-level sparse visibility graphs: fast optimal any-angle pathfinding using hierarchical taut paths. In: SoCS, pp. 64–72 (2017)
Shen, B., Cheema, M.A., Harabor, D.D., Stuckey, P.J.: Euclidean pathfinding with compressed path databases. In: IJCAI, pp. 4229–4235 (2021)
Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Trans. Comput. Intell. AI Games 4(2), 144–148 (2012)
Acknowledgements
Muhammad Aamir Cheema is supported by ARC FT180100140.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, L., Cheema, M.A., Ali, M.E., Lu, H., Li, H. (2022). Diverse Shortest Paths in Game Maps: A Comparative User Study and Experiments. In: Hua, W., Wang, H., Li, L. (eds) Databases Theory and Applications. ADC 2022. Lecture Notes in Computer Science, vol 13459. Springer, Cham. https://doi.org/10.1007/978-3-031-15512-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-15512-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-15511-6
Online ISBN: 978-3-031-15512-3
eBook Packages: Computer ScienceComputer Science (R0)