Related papers: Computing the Fewest-turn Map Directions based on …
Navigation is one of the most widely used applications of the Location Based Services (LBS) which have become part of our digitally informed daily lives. Navigation services, however, have generally been designed for drivers rather than…
Segment Routing is a recent network technology that helps optimizing network throughput by providing finer control over the routing paths. Instead of routing directly from a source to a target, packets are routed via intermediate waypoints.…
Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very…
The complexity of urban street networks is well accepted to reside in the information space where roads map to nodes and junctions to links between nodes. Assuming that information networks preserve their amount of surprisal on average…
A vehicle's fuel consumption depends on its type, the speed, the condition, and the gradients of the road on which it is moving. We developed a Routing Engine for finding an eco-route (one with low fuel consumption) between a source and a…
In this paper we consider a set of travelers, starting from likely different locations towards a common destination within a road network, and propose solutions to find the optimal connecting points for them. A connecting point is a vertex…
Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised. The routing strategies developed for WMNs must be efficient to make it an operationally self configurable network. Thus we need to…
In this paper, we propose a new method for path planning to a point for robot in environment with obstacles. The resulting algorithm is implemented as a simple variation of Dijkstra's algorithm. By adding a constraint to the shortest-path,…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
In most studies, street networks are considered as undirected graphs while one-way streets and their effect on shortest paths are usually ignored. Here, we first study the empirical effect of one-way streets in about $140$ cities in the…
A novel approach to integrated ground and air public transport journey planning, operating at continent scale. Flexible date search, prerequisite for long distance trips given their typical low and irregular service frequencies, is core…
Motivated by the increasing availability of vehicle trajectory data, we propose learn-to-route, a comprehensive trajectory-based routing solution. Specifically, we first construct a graph-like structure from trajectories as the routing…
We present an algorithm for optimal guidance of users in road networks. It is a "stochastic-on-time-arrival (SOTA)"-like algorithm which calculates optimal guidance strategies with reliable paths, for road network origin-destination pairs.…
The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized framework for weighted directed graphs, where edge weight can be…
Traffic congestion is one of the major challenges faced by the transportation industry. While this problem carries a high economical and environmental cost, the need for an efficient design of optimal paths for passengers in multilayer…
We introduce stronger notions for approximate single-source shortest-path distances, show how to efficiently compute them from weaker standard notions, and demonstrate the algorithmic power of these new notions and transformations. One…
A modified version of the Dijkstra algorithm using an inventive contraction hierarchy is proposed. The algorithm considers a directed acyclic graph with a conical or semi-circular structure for which a pair of edges is chosen iteratively…
One model of message delivery in a computer network is based on labelling each edge by a subset of a (reasonably small) universal set, and then encoding a path as the union of the labels of its edges. Earlier work suggested using random…
In this work we consider algorithms for reconstructing time-varying data into a finite sum of discrete trajectories, alternatively, an off-the-grid sparse-spikes decomposition which is continuous in time. Recent work showed that this…
Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to global minimizers hinges on the discretization error induced…