The problem of path exploration and planning of agents in unknown environments is a popular application problem in the field of reinforcement learning. In this paper, we propose an improved ...

This paper presents a comparative study of the Floyd-Warshall (FW) algorithm and the Simulated Annealing (SA) heuristic for solving shortest path problems in static and dynamic traffic-based graphs.