Multi-agent model-based predictive control for large-scale urban traffic networks using a serial scheme

被引:39
作者
Zhou, Zhao [1 ,2 ,3 ]
De Schutter, Bart [3 ]
Lin, Shu [4 ]
Xi, Yugeng [1 ,2 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
[2] Minist Educ China, Key Lab Syst Control & Informat Proc, Shanghai 200240, Peoples R China
[3] Delft Univ Technol, Delft Ctr Syst & Control, NL-2628 CD Delft, Netherlands
[4] Univ Chinese Acad Sci, Sch Comp & Control Engn, Beijing 100049, Peoples R China
基金
美国国家科学基金会;
关键词
road traffic control; predictive control; multi-agent systems; large-scale systems; computational complexity; convergence; traffic lights; traffic flows; traffic congestion mitigation; network-wide control strategy; multi-agent control approach; congestion-degree-based serial scheme; traffic control actions; hypothetical large-scale urban traffic network; computation time; centralised control method; convergence speed; parallel scheme; model-based predictive control approach; TRANSPORTATION NETWORKS; SIGNAL CONTROL; FORMULATION; STRATEGIES; ALGORITHMS;
D O I
10.1049/iet-cta.2014.0490
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Urban traffic networks are large-scale systems, consisting of many intersections controlled by traffic lights and interacting connected links. For efficiently regulating the traffic flows and mitigating the traffic congestion in cities, a network-wide control strategy should be implemented. Control of large-scale traffic networks is often infeasible by only using a single controller, that is, in a centralised way, because of the high dimension, complicated dynamics and uncertainties of the system. In this study, the authors propose a multi-agent control approach using a congestion-degree-based serial scheme. Each agent employs a model-based predictive control approach and communicates with its neighbours. The congestion-degree-based serial scheme helps the agents to reach an agreement on their decisions regarding traffic control actions as soon as possible. A simulation study is carried out on a hypothetical large-scale urban traffic network based on the presented control strategy. The results illustrate that this approach has a better performance with regard to computation time compared with the centralised control method and a faster convergence speed compared with the classical parallel scheme.
引用
收藏
页码:475 / 484
页数:10
相关论文
共 25 条
[11]   A signal timing plan formulation for urban traffic control [J].
Dotoli, Mariagrazia ;
Fanti, Maria Pia ;
Meloni, Carlo .
CONTROL ENGINEERING PRACTICE, 2006, 14 (11) :1297-1311
[12]  
Gartner N. H., 1983, Transportation Research Record, P75
[13]   Existence of urban-scale macroscopic fundamental diagrams: Some experimental findings [J].
Geroliminis, Nikolas ;
Daganzo, Carlos F. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2008, 42 (09) :759-770
[14]  
Hunt P. B., 1982, Traffic Engineering Control, V23, P190
[15]   On the spatial partitioning of urban transportation networks [J].
Ji, Yuxuan ;
Geroliminis, Nikolas .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2012, 46 (10) :1639-1656
[16]   Efficient network-wide model-based predictive control for urban traffic networks [J].
Lin, Shu ;
De Schutter, Bart ;
Xi, Yugeng ;
Hellendoorn, Hans .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2012, 24 :122-140
[17]   Fast Model Predictive Control for Urban Road Networks via MILP [J].
Lin, Shu ;
De Schutter, Bart ;
Xi, Yugeng ;
Hellendoorn, Hans .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2011, 12 (03) :846-856
[18]   A cell-based traffic control formulation: Strategies and benefits of dynamic timing plans [J].
Lo, HK .
TRANSPORTATION SCIENCE, 2001, 35 (02) :148-164
[19]   Constrained model predictive control: Stability and optimality [J].
Mayne, DQ ;
Rawlings, JB ;
Rao, CV ;
Scokaert, POM .
AUTOMATICA, 2000, 36 (06) :789-814
[20]   A real-time traffic signal control system: architecture, algorithms, and analysis [J].
Mirchandani, P ;
Head, L .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2001, 9 (06) :415-432