Criticality of Urban Networks: Untangling the Complexity of Urban Congestion

城市网络的重要性：解决城市拥堵的复杂性

• 批准号: 2311159
• 负责人: Jorge Laval
• 金额: $ 40.03万
• 依托单位: Georgia Tech Research Corporation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-07-01 至 2026-06-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2311159&HistoricalAwards=false
• 关键词: Criticality; Urban; Networks; Untangling; Complexity

This award will support research to explore the application of tools and methods from complexity science to better understand and control urban congestion. This paradigm-shifting approach is made in light of recent empirical data confirming earlier theories that the flow of traffic through urban transportation networks behaves like a fluid inside a container. In this analogy, rush-hour congestion can be thought of as the boiling point of the fluid, where one can observe two distinct states of matter coexisting in different proportions depending on the temperature: gas (little congestion) and liquid (stopped, stuck in traffic). This is where traffic flow becomes chaotic and therefore our traditional engineering tools such as calculus and statistics no longer apply to prediction and control. This research provides a framework for describing and modeling traffic flow systems in this context. The educational component of this project will promote and facilitate the incorporation of basic complex systems education into the civil engineering curricula at Georgia Tech.The theory of phase transitions is one of the better understood theories in physics, but it has not been applied to traffic flow successfully so far due to the lack of a suitable description of heat flow in the system. This project suggests the flow of vehicles as a correct interpretation, and the research approach includes the analysis of large amounts of empirical observations, together with mathematical modeling and theoretical analysis that will combine elements from traffic flow theory, statistical mechanics and fractal geometry within the overall framework of complexity science. Most relevant to this project will be the theory of self-organized criticality (SOC) and its connections with different universality classes such as Manna, Kardar-Parisi-Zhang and directed percolation classes, all of which have received much attention lately in the context of traffic networks. SOC has been found to be fundamental in diverse areas from geology to astrophysics, and this project will explore if urban networks fall in this category, along with the methodological implications for controlling urban congestion.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

该奖项将支持研究探索复杂性科学的工具和方法的应用，以更好地理解和控制城市拥堵。这种范式转变的方法是根据最近的经验数据证实早期的理论，即通过城市交通网络的交通流的行为就像一个容器内的流体。在这个类比中，高峰时段的拥堵可以被认为是流体的沸点，在那里人们可以观察到两种不同的物质状态，它们根据温度以不同的比例共存：气体（轻微拥堵）和液体（停止，陷入交通）。这就是交通流变得混乱的地方，因此我们传统的工程工具，如微积分和统计学不再适用于预测和控制。这项研究提供了一个框架，描述和建模交通流系统在这种情况下。该项目的教育部分将促进和促进基本复杂系统教育纳入格鲁吉亚技术学院的土木工程课程。相变理论是物理学中较好理解的理论之一，但由于缺乏对系统中热流的适当描述，迄今为止它还没有成功地应用于交通流。该项目建议将车辆流作为正确的解释，研究方法包括分析大量的经验观察，以及数学建模和理论分析，将交通流理论，统计力学和分形几何的联合收割机元素结合在复杂性科学的整体框架内。与本项目最相关的是自组织临界性（SOC）理论及其与不同普适性类（如Manna，Kardar-Parisi-Zhang和定向渗流类）的联系，所有这些都在交通网络的背景下受到了广泛关注。SOC在从地质学到天体物理学的各个领域都具有重要意义，该项目将探索城市网络是否属于这一类别，沿着控制城市拥堵的方法学意义。该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。