Shortest Path Algorithms for Pedestrian Navigation Systems

Efficient shortest path algorithms are of key importance for routing and navigation systems. However, these applications designed focusing on the requirements motor vehicles, therefore, finding paths in pedestrian sections urban areas is not sufficiently supported. In addition, often adequate sidewalk routes, as users may also be interested alternative routes that, although slightly longer, possess other desirable features properties. According to literature, search carried out mainly using k-shortest (KSP) algorithm which represents an ordered list all available alternatives. Even though various KSP have been proposed, best our knowledge, there no research addressing issues inherent a system. The purpose this paper present heuristic graph datasets that implements penalty-based method which, by increasing certain edge weights, effectively searches most accessible multi-route cases. To demonstrate how works, we experimental results historical center Thessaloniki city.