• Home
  • Search
  • Efficiently computing alternative paths in game maps
  • Cite Icon1
  • https://doi.org/10.1007/s11280-023-01188-6Copy DOI Icon

Efficiently computing alternative paths in game maps

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Alternative pathfinding 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 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, based on our web-based system that visualises alternative paths generated by different approaches, we conduct a user study that shows that the existing road network approaches generate high-quality alternative paths when adapted for the game maps. However, these existing approaches are computationally inefficient especially when compared to the state-of-the-art shortest path algorithms. Motivated by this, we propose novel data structures and exploit these to develop an efficient algorithm to compute high-quality alternative paths. that shows that the existing road network approaches generate high-quality alternative paths in game maps. Our extensive experimental study demonstrates that our proposed algorithm is more than an order of magnitude faster than the existing approaches and returns alternative paths of comparable quality. Furthermore, our algorithm is comparable to a state-of-the-art shortest path algorithm in terms of running time.

Loading PDF

Similar Papers
  • Research Article
  • Citations25

An effective heuristic for computing many shortest path alternatives in road networks

  • Jun 01, 2012
  • International Journal of Geographical Information Science
  • Stéphanie Vanhove +1
  • Conference Article
  • Citations2

Finding realistic shortest path in road networks with lane changing and turn restriction

  • Oct 01, 2016
  • Oanh Tran Thi Kim +3
  • Book Chapter
  • Citations8

Encoding Travel Traces by Using Road Networks and Routing Algorithms

  • Jan 01, 2012
  • Pablo Martinez Lerin +2
  • Research Article
  • Citations2

Tawanda's non- iterative optimal tree algorithm for shortest route problems

  • Jan 03, 2013
  • Scientific Journal of Pure and Applied Sciences
  • Trust Tawanda
  • Research Article

Probability-based Routing in Optical Burst Switching Networks with Full-range Wavelength Conversions

  • Jan 01, 2006
  • Journal of Optical Communications
  • Zhang Shi +2
  • Research Article
  • Citations69

A new algorithm for shortest paths among obstacles in the plane

  • Mar 01, 1991
  • Annals of Mathematics and Artificial Intelligence
  • Joseph S B Mitchell
  • Research Article
  • Citations22

A Multiple Pairs Shortest Path Algorithm

  • Nov 01, 2005
  • Transportation Science
  • I-Lin Wang +2
  • Research Article
  • Citations19

A comparison of algorithms for origin–destination matrix generation on real road networks and an approximation approach

  • Apr 06, 2008
  • Computers & Industrial Engineering
  • Byung-In Kim +1
  • Research Article
  • Citations12

A dissimilar alternative paths-search algorithm for navigation services: A heuristic approach

  • Sep 18, 2009
  • KSCE Journal of Civil Engineering
  • Yeon-Jeong Jeong +3
  • Book Chapter
  • Citations1

Offering a New Bus Route Between Campus and Bus Terminal Using Shortest Path Algorithm

  • Jan 01, 2021
  • Eren Özceylan
  • Conference Article
  • Citations93

Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles

  • Jan 01, 1988
  • S Kapoor +1
  • Conference Article
  • Citations1

An Incremental Query Algorithm for Optimal Path Queries under Traffic Jams

  • Jan 01, 2008
  • Xiaoyu Song +2
  • Book Chapter
  • Citations66

Reach for A*: shortest path algorithms with preprocessing

  • Jul 28, 2009
  • Andrew Goldberg +2
  • Research Article
  • Citations23

Improved Algorithms for Dynamic Shortest Paths

  • Jan 01, 2000
  • Algorithmica
  • H N Djidjev +2
  • Conference Article
  • Citations1

A linear time pre-processing for optimization of shortest path and distance algorithms

  • Aug 01, 2017
  • Neeta A Eapen +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.