An Efficient Monte Carlo-based Probabilistic Time-Dependent Routing Calculation Targeting a Server-Side Car Navigation System

by   Emanuele Vitali, et al.

Incorporating speed probability distribution to the computation of the route planning in car navigation systems guarantees more accurate and precise responses. In this paper, we propose a novel approach for dynamically selecting the number of samples used for the Monte Carlo simulation to solve the Probabilistic Time-Dependent Routing (PTDR) problem, thus improving the computation efficiency. The proposed method is used to determine in a proactive manner the number of simulations to be done to extract the travel-time estimation for each specific request while respecting an error threshold as output quality level. The methodology requires a reduced effort on the application development side. We adopted an aspect-oriented programming language (LARA) together with a flexible dynamic autotuning library (mARGOt) respectively to instrument the code and to take tuning decisions on the number of samples improving the execution efficiency. Experimental results demonstrate that the proposed adaptive approach saves a large fraction of simulations (between 36 different traffic situations, paths and error requirements. Given the negligible runtime overhead of the proposed approach, it results in an execution-time speedup between 1.5x and 5.1x. This speedup is reflected at infrastructure-level in terms of a reduction of around 36 resources needed to support the whole navigation pipeline.


A Novel Approach for Fast and Accurate Mean Error Distance Computation in Approximate Adders

In error-tolerant applications, approximate adders have been exploited e...

Monte Carlo Action Programming

This paper proposes Monte Carlo Action Programming, a programming langua...

Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games

This paper addresses Monte Carlo algorithms for calculating the Shapley-...

Self-Adaptive Binary-Addition-Tree Algorithm-Based Novel Monte Carlo Simulation for Binary-State Network Reliability Approximation

The Monte Carlo simulation (MCS) is a statistical methodology used in a ...

Extensions to Multifidelity Monte Carlo Methods for Simulations of Chaotic Systems

Multifidelity Monte Carlo methods often rely on a preprocessing phase co...

Influence of sampling on the convergence rates of greedy algorithms for parameter-dependent random variables

The main focus of this article is to provide a mathematical study of the...

Monte Carlo modeling photon-tissue interaction using on-demand cloud infrastructure

Purpose: This work advances a Monte Carlo (MC) method to combine ionizin...