arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.6617cs.LGcs.AI
收藏

准时到达:大规模道路网络上行程时间分布的估计

Arriving on time: estimating travel time distributions on large-scale road networks

UC Berkeley(加州大学伯克利分校)

Timothy Hunter, Aude Hofleitner, Jack Reilly, Walid Krichene, Jerome Thai, Anastasios Kouvelas, Pieter Abbeel, Alexandre Bayen

摘要:

大多数最优路径选择问题关注于最小化旅行时间或旅行距离。通常,更有用的目标是最大化准时到达的概率,这需要旅行时间的统计分布,而不仅仅是平均值。我们提出了一种方法来估计行程时间分布在大规模的道路网络,使用探测车从GPS收集的数据。我们提出了一个框架,该框架适用于大量的数据输入,并随着网络的大小线性扩展。利用平面拓扑图,该方法有效地计算相邻街道之间的时间相关性。首先,原始探测车辆的痕迹被压缩成对的旅行时间和数量的停止为每个横穿路段使用的“走走停停”算法开发这项工作。然后,压缩的数据被用作训练路径旅行时间模型的输入,该模型将马尔可夫模型与高斯马尔可夫随机场耦合在一起。最后,可扩展的推理算法开发的复合MM-GMRF模型的路径行程时间分布。我们说明了我们的模型的准确性和可扩展性的505,000道路连接网络横跨旧金山湾区。

英文摘要:

Most optimal routing problems focus on minimizing travel time or distance traveled. Oftentimes, a more useful objective is to maximize the probability of on-time arrival, which requires statistical distributions of travel times, rather than just mean values. We propose a method to estimate travel time distributions on large-scale road networks, using probe vehicle data collected from GPS. We present a framework that works with large input of data, and scales linearly with the size of the network. Leveraging the planar topology of the graph, the method computes efficiently the time correlations between neighboring streets. First, raw probe vehicle traces are compressed into pairs of travel times and number of stops for each traversed road segment using a `stop-and-go' algorithm developed for this work. The compressed data is then used as input for training a path travel time model, which couples a Markov model along with a Gaussian Markov random field. Finally, scalable inference algorithms are developed for obtaining path travel time distributions from the composite MM-GMRF model. We illustrate the accuracy and scalability of our model on a 505,000 road link network spanning the San Francisco Bay Area.

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

↑