Time-varying shortest path algorithm with transit time tuning for parking lot navigation

This paper presents a new system for intelligent navigation inside a parking lot. After modeling the parking lot with a time-varying graph, the proposed system applies a time-varying shortest path algorithm and dynamically tunes arc transit times based on planned vehicle routes as well as traffic flow sensor data. In computer simulations for evaluation, the proposed system showed a improvement of about 40% in travel time when compared with a system that only applies the conventional Dijkstra´s algorithm.