道路交通量估计与基于分布的路径选择
Road traffic estimation and distribution-based route selection
摘要:
在路线选择问题中,驾驶员的个人偏好将决定她是否更喜欢具有相对低的平均值和高方差的旅行时间的路线,而不是具有相对高的平均值和低方差的路线。然而,在实践中,这样的风险规避问题往往被忽略,因为路线是基于单标准Dijkstra型算法选择的。此外,路由决策通常不考虑旅行时间的均值和方差估计的不确定性。本文旨在解决这两个问题,通过建立一个框架的行程时间估计。在我们的框架中,底层道路网络表示为图。每个边缘被细分为多个较小的片段,以便自然地对空间上邻近的道路片段之间的统计相似性进行建模。依靠贝叶斯方法,我们构建了一个估计的联合每边旅行时间分布,从而也为我们提供了一个不确定性量化我们的估计。我们的机器依赖于建立极限定理,使由此产生的估计过程中的意义上,它有效地不承担任何分布特性的鲁棒性。我们提出了一套广泛的数值实验,证明了有效性的估计过程和使用的分布估计的背景下,数据驱动的路线选择。
英文摘要:
In route selection problems, the driver's personal preferences will determine whether she prefers a route with a travel time that has a relatively low mean and high variance over one that has relatively high mean and low variance. In practice, however, such risk aversion issues are often ignored, in that a route is selected based on a single-criterion Dijkstra-type algorithm. In addition, the routing decision typically does not take into account the uncertainty in the estimates of the travel time's mean and variance. This paper aims at resolving both issues by setting up a framework for travel time estimation. In our framework, the underlying road network is represented as a graph. Each edge is subdivided into multiple smaller pieces, so as to naturally model the statistical similarity between road pieces that are spatially nearby. Relying on a Bayesian approach, we construct an estimator for the joint per-edge travel time distribution, thus also providing us with an uncertainty quantification of our estimates. Our machinery relies on establishing limit theorems, making the resulting estimation procedure robust in the sense that it effectively does not assume any distributional properties. We present an extensive set of numerical experiments that demonstrate the validity of the estimation procedure and the use of the distributional estimates in the context of data-driven route selection.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。