An Efficient PageRank Approach for Urban Traffic Optimization. (3rd July 2012)

• Record Type: Journal Article
• Authors: Pop, Florin; Dobre, Ciprian
• Other Names: Li Ming Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2012(2012)
• Publication Date: 2012-07-03
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2012/465613
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : The cities are not static environments. They change constantly. When we talk about traffic in the city, the evolution of traffic lights is a journey from mindless automation to increasingly intelligent, fluid traffic management. In our approach, presented in this paper, reinforcement-learning mechanism based on cost function is introduced to determine optimal decisions for each traffic light, based on the solution given by Larry Page for page ranking in Web environment (Page et al. (1999)). Our approach is similar with work presented by Sheng-Chung et al. (2009) and Yousef et al. (2010). We consider that the traffic lights are controlled by servers and a score for each road is computed based on efficient PageRank approach and is used in cost function to determine optimal decisions. We demonstrate that the cumulative contribution of each car in the traffic respects the main constrain of PageRank approach, preserving all the properties of M matrix consider in our model.