Abstract

We investigate the problem of vehicle route planning in a dynamic environment. In order to better reflect real-life situations, we assume that travel times are not known exactly, but bounded from below and from above, i.e., they are given as interval quantities. Accordingly, we develop algorithms for effective route replanning in a highly dynamic road network environment that combines traffic image processing with interval data for dynamic path optimisation. The developed algorithms are integrated into a larger system for traffic management. The efficiency of the proposed algorithms and their ability to support the dynamics of road traffic is verified using real data. The experimental research was also conducted using the microscopic, time-discrete, space-continuous traffic simulator.

Highlights

  • Nowadays, vehicle users demand efficient route planning in a dynamically changing environment

  • The navigation system should be able to compute the new route in a few seconds and send it to a user or decide wheatear this change has a significant impact on the travel time

  • Significant acceleration of the response time of the shortest path queries is obtained by using precalculated paths and specially prepared data stored in the Route Planning System (RPS) database

Read more

Summary

Introduction

Vehicle users demand efficient route planning in a dynamically changing environment. Most of the existing navigation systems use the average values of travel times to reflect the dynamics of the road traffic. Thanks to the use of interval arithmetics, the proposed algorithm enables us to determine if the route should be changed to effectively reach the goal – because the traffic in the entire network has changed (e.g., travel times in some sections) so that the current route is no longer optimal. The main objective of the INSIGMA system is to improve the public security and life quality by providing advanced tools that are able to detect dangerous events as well as monitor and optimise road traffic This objective can be achieved by using dynamic data obtained from different types of sensors, such as cameras and inductive loops.

Fast route algorithms
Centralized system for route planning
Route Planning System under uncertainty
Interval arithmetic
Interval approach to the shortest path problem
The travel time change effect under interval uncertainty
Interval route planning algorithm
Update path decision algorithm
Computational experiments
Value of probability in interval comparison
Average travel time dependence on road network size
Average travel time dependence on the road traffic volume
Average travel time with respect to street length
Efficiency of RPS system
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call