×

Distributed model predictive control method for optimal coordination of signal splits in urban traffic networks. (English) Zbl 1332.93120

Summary: Coordination and control approaches based on Model Predictive Control (MPC) have been widely investigated for traffic signal control in urban traffic networks. However, due to the complex nonlinear characters of traffic flows and the large scale of traffic networks, a basic challenge faced by these approaches is the high online computational complexity. In this paper, to reduce the computational complexity and improve the applicability of traffic signal control approaches based on MPC in practice, we propose a distributed MPC approach (DCA-MPC) to coordinate and optimize the signal splits. Instead of describing the dynamics of traffic flow within each link of the traffic network with a simplified linear model, we present an improved nonlinear traffic model. Based on the nonlinear model, an MPC optimization framework for the signal splits control is developed, whereby the interactions between subsystems are accurately modeled by employing two interconnecting constraints. In addition, by designing a novel dual decomposition strategy, a distributed coordination algorithm is proposed. Finally, with a benchmark traffic network, experimental results are given to illustrate the effectiveness of the proposed method.

MSC:

93B40 Computational methods in systems theory (MSC2010)
90B20 Traffic problems in operations research
93C95 Application models in control theory
Full Text: DOI

References:

[1] PapageorgiouM., C.Diakaki, V.Dinopoulou, A.Kotsialos, and Y.Wang, “Review of road traffic control strategies,” Proc. IEEE, Vol. 91, No. 12, pp. 2043-2067 (2003).
[2] XieX., S. F.Smith, L.Lu, and G. J.Barlow, “Schedule‐driven intersection control,” Transp. Res. Pt. C‐Emerg. Technol., Vol. 24, pp. 168-189 (2012).
[3] HuangY. S. and P. J.Su, “Modeling and analysis of traffic light control systems,” IET Contr. Theory Appl., Vol. 3, No. 3, pp. 340-350 (2009).
[4] ShenG. and X.Kong, “Study on road network traffic coordination control technique with bus priority,” IEEE Trans. Syst. Man Cybern. Part C‐Appl. Rev., Vol. 39, No. 3, pp. 343-351 (2009).
[5] HuangY. S., Y. S.Weng, and M.Zhou, “Critical scenarios and their identification in parallel railroad level crossing traffic control systems,” IEEE Trans. Intell. Transp. Syst., Vol. 11, No. 4, pp. 968-977 (2010).
[6] Van den BergM., A.Hegyi, B.De Schutter, and J.Hellendoorn, “Integrated traffic control for mixed urban and freeway networks: A model predictive approach,” Eur. J. Transp. Infras. Res., Vol. 7, No. 3, pp. 223-250 (2007).
[7] KashaniH. and G.Saridis, “Intelligent control for urban traffic systems,” Automatica, Vol. 19, No. 2, pp. 191-197 (1983). · Zbl 0503.90045
[8] LinS., B.De Schutter, Y.Xi, and H.Hellendoorn, “Efficient network‐wide model‐based predictive control for urban traffic networks,” Transp. Res. Pt. C‐Emerg. Technol., Vol. 24, pp. 122-140 (2012).
[9] LinS., B.De Schutter, Y.Xi, and H.Hellendoorn, “Fast model predictive controllers for large urban road networks via MILP,” IEEE Trans. Intell. Transp. Syst., Vol. 12, No. 3, pp. 846-856 (2011).
[10] AboudolasK., M.Papageorgiou, and E.Kosmatopoulos, “Store and forward based methods for the signal control problem in large‐scale congested urban road networks,” Transp. Res. Pt. C‐Emerg. Technol., Vol. 17, No. 2, pp. 163-174 (2009).
[11] NegenbornR. R., B. D.Schutter, and J.Hellendoorn, “Multi‐agent model predictive control for transportation networks: Serial versus parallel schemes,” Eng. Appl. Artif. Intel., Vol. 21, No. 3, pp. 53-66 (2008).
[12] TettamantiT. and I.Varga, “Distributed traffic control system based on model predictive control,” Period. Polytech.‐Civ. Eng., Vol. 54, No. 1, pp. 3-9 (2010).
[13] De OliveiraL. B. and E.Camponogara, “Multi‐agent model predictive control of signaling split in urban traffic netwroks,” Transp. Res. Pt. C‐Emerg. Technol., Vol. 18, No. 1, pp. 120-139 (2010).
[14] CamponogaraE. and H. F.Scherer, “Distributed optimization for model predictive control of linear dynamic networks with control‐input and output constraints,” IEEE Trans. Autom. Sci. Eng., Vol. 8, No. 1, pp. 233-242 (2011).
[15] ZhouX. and Y.Lu, “Coordinate model predictive control with neighbourhood optimization for a signal split in urban traffic networks,” IET Intell. Transp. Syst., Vol. 6, No. 4, pp. 372-379 (2012).
[16] ZhengY., S.Li, N.Li, “Distributed model predictive control over network information exchange for large‐scale systems,” Control Eng. Practice, Vol. 19, No. 7, pp. 757-769 (2011).
[17] ChenY., J.Lu, F.Han, and X.Yu, “On the cluster consensus of discrete‐time multi‐agent systems,” Syst. Control Lett., Vol. 60, No. 7, pp. 517-523 (2011). · Zbl 1222.93007
[18] LuJ. and G.Chen, “A time‐varying complex dynamical network model and its controlled synchronization criteria,” IEEE Trans. Autom. Control, Vol. 50, No. 6, pp. 841-846 (2005). · Zbl 1365.93406
[19] ChenY., J.Lu and Z.Lin, “Consensus of discrete‐time multi‐agent systems with transmission nonlinearity,” Automatica, Vol. 49, No. 6, pp. 1768-1775 (2013). · Zbl 1360.93019
[20] ChenY., J.Lu, X.Yu, and Z.Lin, “Consensus of discrete‐time second‐order multiagent systems based on infinite products of general stochastic matrices,” SIAM J. Control Optim., Vol. 51, No. 4, pp. 3274-3301 (2013). · Zbl 1275.93005
[21] BoydS. and L.Vandenberghe. Convex Optimization, Cambridge University Press, Cambridge (2004). · Zbl 1058.90049
[22] NedelcuV., I.Necoara, and Q. T.Dinh, Computational complexity of inexact gradient augmented lagrangian methods: application to constrained MPC, Technical Report, University Politehnica Bucharest, Spl. Independentei 313, pp. 1-23, October 2012.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.