Abstract: In this paper, we consider the problem of finding the shortest path in a graph when there is aleatoric uncertainty about the presence and/or cost of certain edges. We investigate hybrid path ...

Abstract: Dijkstra’s shortest path algorithm is a fundamental graph search method widely used in domains such as navigation, robotics, gaming, and network routing. However, its performance can degrade ...