arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.2105math.OCmath.DS
收藏

一维交通流最优控制模型的基本图

Fundamental Diagrams of 1D-Traffic Flow by Optimal Control Models

Nadir Farhi

摘要:

环形道路上的交通是由动态规划方程描述的最优控制问题。通过解析求解方程,我们得到了平均汽车密度和平均汽车流量之间的关系,即交通基本图。首先,我们提出了一个基于最小加代数的模型,然后将其推广到随机动态规划模型,再推广到随机对策模型。平均车流量被推导为最优控制问题的每单位时间的平均费用,根据平均车辆密度得到。本文中介绍的模型也可以看作是跟驰模型的发展版本。本文提出的推导方法可用于近似、理解和解释由实际测量得到的基本图形。

英文摘要:

Traffic on a circular road is described by dynamic programming equations associated to optimal control problems. By solving the equations analytically, we derive the relation between the average car density and the average car flow, known as the fundamental diagram of traffic. First, we present a model based on min-plus algebra, then we extend it to a stochastic dynamic programming model, then to a stochastic game model. The average car flow is derived as the average cost per time unit of optimal control problems, obtained in terms of the average car density. The models presented in this article can also be seen as developed versions of the car-following model. The derivations proposed here can be used to approximate, understand and interprete fundamental diagrams derived from real measurements.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑