Authors:
Sandro Castronovo
1
;
Björn Kunz
1
and
Christian Müller
2
Affiliations:
1
German Research Center for Artificial Intelligence (DFKI), Germany
;
2
German Research Center for Artificial Intelligence (DFKI) and EIT ICT labs, Germany
Keyword(s):
Graph theory, Dynamic graphs, Heuristic search, Shortest paths.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Formal Methods
;
Industrial Applications of AI
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Planning and Scheduling
;
Simulation and Modeling
;
Soft Computing
;
Symbolic Systems
Abstract:
Shortest-path problems on graphs have been studied in depth in Artificial Intelligence and Computer Science.
Search on dynamic graphs, i.e. graphs that can change their layout while searching, receives plenty of attention
today – mostly in the planning domain. Approaches often assume global knowledge on the dynamic graph, i.e.
that topology and dynamic operations are known to the algorithm. There exist use-cases however, where this
assumption cannot be made. In vehicular ad-hoc networks, for example, a vehicle is only able to recognize
the topology of the graph within wireless network transmission range. In this paper, we propose a combined
uniform and heuristic search algorithm, which maintains shortest paths in highly dynamic graphs under the
premise that graph operations are not globally known.