Shortest Path Algorithms for Pedestrian Navigation Systems
Citations Over Time
Abstract
Efficient shortest path algorithms are of key importance for routing and navigation systems. However, these applications are designed focusing on the requirements of motor vehicles, and therefore, finding paths in pedestrian sections of urban areas is not sufficiently supported. In addition, finding the shortest path is often not adequate for urban sidewalk routes, as users of these applications may also be interested in alternative routes that, although slightly longer, possess other desirable features and properties. According to the literature, the search for alternative routes is carried out mainly using the k-shortest paths (KSP) algorithm which represents an ordered list of all available alternatives. Even though various KSP algorithms have been proposed, to the best of our knowledge, there is no research addressing all issues inherent in a pedestrian navigation system. The purpose of this paper is to present a heuristic algorithm for graph datasets that implements a penalty-based method which, by increasing certain edge weights, effectively searches for the most accessible alternative paths in multi-route cases. To demonstrate how the algorithm works, we present experimental results on finding the most accessible paths in pedestrian sections of the historical center of Thessaloniki city.
Related Papers
- → Comparative Analysis between Dijkstra and Bellman-Ford Algorithms in Shortest Path Optimization(2020)70 cited
- → An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)(2022)24 cited
- → Shortest Path Search Futsal Field Location With Dijkstra Algorithm(2018)23 cited
- Implementation of Search Shortest Path in MapInfo Map(2007)
- Shortest Path Trajectory System Based on Dijkstra Algorithm(2012)