具有两条入口线的交叉口交通流模型的微观推导
A microscopic derivation of a traffic flow model on a junction with two entry lines
AI总结：
本文从离散跟驰模型出发，通过车辆数趋于无穷和缩放，推导出具有两条入口线和一条出口线的交叉口网络上的L1压缩守恒律，并用依赖流量和平均绿灯时间的芽刻画交叉口行为。
摘要：
我们从离散交通流模型出发，推导出由两条入口支路和一条出口支路组成的网络上的守恒律。连续模型通过令车辆数量趋于无穷并在缩放后由离散模型得到。在离散模型中，车辆在每条支路上求解跟驰模型。交叉口处的优先规则由时间周期性的交通信号灯给出（出于技术原因，其周期随缩放趋于无穷）。极限处的守恒律是L1压缩的，并可用一个依赖于流量以及交通信号灯在一条支路上为“绿灯”的平均时间量的芽（germ）来描述。
英文摘要：
We derive a conservation law on a network made of two incoming branches and a single outgoing one from a discrete traffic flow model. The continuous model is obtained from the discrete one by letting the number of vehicles tend to infinity and after scaling. In the discrete model, the vehicles solve a follow-the-leader model on each branch. The priority rule at the junction is given by a timeperiodic traffic light (with a period tending to infinity with the scaling for technical reasons). The conservation law at the limit is L 1 contractive and described in terms of a germ depending on the flux and on the average amount of time the traffic light is ''green'' on a branch.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
