Search in dynamic graphs based on crowdsourcing

Abstract

Applications that are working on routing rely on graph theory. But in today’s world, data is changing very fast, and there is a need in having real-time or near-real-time results. This article presents a way of obtaining cheap near-real-time environmental data for route searching, and reviews several algorithms that are able to process such dynamic data. The need of different graph search algorithms isdictated by the fact that producing optimal results may be infeasible for real life use-cases, the fact that environment models are usually imperfect, and that environments are dynamic.