Abstract
Traffic congestion has long been a worldwide difficult problem in metropolitan transportation networks, incurring tremendous time waste and exhaust pollution. Extensive efforts have been made to address this problem, among which traffic control at intersections is known to be especially crucial while challenging. Also, it is helpful to the recent advent of autopilot technologies by enhancing the schedule accuracy and reducing the infrastructure cost. In practice, however, existing researches can hardly work well in a pervasive manner since they are essentially limited to two ideal assumptions: 1) each intersection comprises four ways; 2) each way is homogeneously composed of two lanes. Through an in-depth examination of their basic models, we find that the two-fold ideal assumptions are largely compelled by the surprisingly high complexity of converting a practical intersection topology into a theoretical conflict graph. Moreover, existing works seldom consider the modeling of complex intersections in the scene of cooperative control of multiply intersections. Driven by the above understandings, our first effort towards a general framework (for handling multiple-way heterogeneous intersections) is to carefully transform a practical intersection topology into a homomorphic, regular conflict graph which is suited to theoretical modeling and further processing with an affordable complexity. Besides, a maximum weight independent set (MWIS) based approach is proposed to minimize the average waiting time of vehicles at an isolated intersection. In addition, we apply a backpressure-based algorithm to our framework to further optimize the global average waiting time of vehicles in a whole road network. Simulation results have demonstrated that the average waiting time achieved by our approach is merely 80 seconds while traditional traffic light control reaches 370 seconds.
Highlights
A S a consequence of human beings’ rapid urbanization and population growth, urban traffic congestion has become an increasingly severe worldwide problem
Despite the fundamental significance of intersection traffic control, existing researches can hardly work well in a pervasive manner since they are essentially limited to two ideal assumptions as demonstrated in Fig. 1(a): 1) each intersection comprises four ways; 2) each way is homogeneously composed of two lanes [2], [8], [10]–[12]
We present the details of our MWISbased intersection control, including the concurrent lane set construction, details of the proposed intersection control algorithms and our vehicular network based communication mechanism
Summary
A S a consequence of human beings’ rapid urbanization and population growth, urban traffic congestion has become an increasingly severe worldwide problem. Driven by the above understandings, in this paper we strive towards a general framework for intelligent traffic control at all kinds of intersections To this end, our first effort is to carefully transform a practical intersection topology into a homomorphic, regular conflict graph (as illustrated in Fig. 1(d)) which is suited to theoretical modeling and further processing (e.g., electronic map design 1) in an affordable complexity. In a road network with multiple intersections, the optimal scheduling at each isolated intersection does not always imply the minimization of all vehicles’ average waiting time in a whole road network To this end, we further apply a backpressure-based algorithm [15], [16], [25]–[27] to our framework to reduce the global average waiting time of vehicles 2.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
