Dynamic Scope-Based Dijkstra's Algorithm

TL;DR

This paper introduces a dynamic route planning algorithm based on scope, adapting a previous static approach to handle changing road networks for more efficient navigation.

Contribution

It presents a novel modification of the scope-aware Dijkstra's algorithm to operate dynamically on road networks, extending prior static methods.

Findings

Modified scope-aware algorithm supports dynamic updates

Improved route planning efficiency in changing networks

Lays groundwork for future dynamic scope-based routing

Abstract

We briefly report on the current state of a new dynamic algorithm for the route planning problem based on a concept of scope (the static variant presented at ESA'11, HM2011A). We first motivate dynamization of the concept of scope admissibility, and then we briefly describe a modification of the scope-aware query algorithm of HM2011A to dynamic road networks. Finally, we outline our future work on this concept.