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

**Authors:** Emanuele Vitali, Davide Gadioli, Gianluca Palermo, Martin Golasowski,, Joao Bispo, Pedro Pinto, Jan Martinovic, Katerina Slaninova, Joao M. P., Cardoso, Cristina Silvano

arXiv: 1901.06210 · 2019-01-21

## TL;DR

This paper introduces an adaptive Monte Carlo method for probabilistic time-dependent routing in car navigation, significantly reducing computation time and resource usage while maintaining accuracy.

## Contribution

It presents a novel dynamic sampling approach using autotuning to improve efficiency in probabilistic route planning for navigation systems.

## Key findings

- Saved 36% to 81% of simulations compared to static methods.
- Achieved 1.5x to 5.1x speedup in execution time.
- Reduced infrastructure resource consumption by around 36%.

## Abstract

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% and 81%) with respect to a static approach while considering 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% of the computing resources needed to support the whole navigation pipeline.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1901.06210/full.md

## Figures

22 figures with captions in the complete paper: https://tomesphere.com/paper/1901.06210/full.md

## References

43 references — full list in the complete paper: https://tomesphere.com/paper/1901.06210/full.md

---
Source: https://tomesphere.com/paper/1901.06210