Cellular automata model of self-organizing traffic control in urban networks

Bulletin of the Polish Academy of Sciences. Technical Sciences

J. SzklarskiInstitute of Fundamental Technological Research, Polish Academy of Sciences, 5B Pawi?skiego St., 02-106 Warszawa, PolandOther articles by this author:De Gruyter OnlineGoogle Scholar¹ 

[1] Institute of Fundamental Technological Research, Polish Academy of Sciences, 5B Pawi?skiego St., 02-106 Warszawa, Poland

关键词: Keywords: cellular automata model;    self-organizing traffic control;    urban networks;   

DOI  :  10.2478/v10175-010-0041-3

学科分类：工程和技术（综合）

来源: Polska Akademia Nauk * Centrum Upowszechniania Nauki / Polish Academy of Sciences, Center for the Advancement of Science

【 摘 要 】

A model of city traffic based on Nagel-Schreckenberg cellular automaton (CA) model is presented. Traffic control is realized at intersections with two conflicting streams each (at any time at most one stream can have "green light" assigned to it). For simple and regular lattice-like networks which are considered, it is easy to find optimal switching periods giving maximum possible flow rates. These optimal strategies are compared with a self-controlling approach proposed by [1], which has not been implemented in a CA model until now. Previous work proved that generally this method gives superior results when compared to classical methods. In this paper we show that for deterministic scenario such control leads to self-organization, and that the solution always quickly converges to the optimal solution which is known in this case. Moreover, we consider also non-deterministic case, in the sense that possibility of turning with given probability is allowed. It is shown that the self-controlling strategy always gives better results than any solution based on fixed cycles with green waves.

【 授权许可】

Unknown