arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.17150cs.LGcs.GTmath.OC
收藏

偏好未知条件下的交通路径选择在线学习

Online Learning for Traffic Routing under Unknown Preferences

Stanford University(斯坦福大学);Massachusetts Institute of Technology(麻省理工学院)

Devansh Jalota, Karthik Gopalakrishnan, Navid Azizan, Ramesh Johari, Marco Pavone

摘要:

在交通网络中,用户通常以分散和自利的方式选择路线,以最大限度地降低个人旅行成本,这在实践中往往导致社会整体效益低下。因此,设计道路收费方案以应对这些效率损失并引导用户转向系统效率的交通模式的兴趣越来越大。然而,道路收费方案的功效通常依赖于能够获得关于用户的行程属性的完整信息,诸如他们的起点-目的地(O-D)行程信息和他们的时间值,这在实践中可能是不可用的。出于这一实际考虑,我们提出了一个在线学习的方法来设置通行费的交通网络,以驱动不同的时间值的异质用户对系统有效的交通模式。特别是,我们开发了一种简单而有效的算法,该算法仅根据观察到的网络道路上的总流量来调整每个时间段的通行费,而不依赖于用户的任何额外出行属性,从而保护用户隐私。在O-D对和用户的时间值被独立地绘制的设置中,在每个时段,我们表明,我们的方法获得了预期的遗憾和道路容量违规$O(\sqrt{T})$,其中$T$是收费更新的时段数。我们的遗憾保证是相对于一个离线的甲骨文,有完整的信息,用户的行程属性。我们进一步建立了一个$Ω(\sqrt{T})$下界的遗憾的任何算法,这表明我们的算法是最佳的常数。最后,我们展示了我们的方法相对于现实世界的交通网络上的几个基准的优越性能,从而突出了其实用性。

英文摘要:

In transportation networks, users typically choose routes in a decentralized and self-interested manner to minimize their individual travel costs, which, in practice, often results in inefficient overall outcomes for society. As a result, there has been a growing interest in designing road tolling schemes to cope with these efficiency losses and steer users toward a system-efficient traffic pattern. However, the efficacy of road tolling schemes often relies on having access to complete information on users' trip attributes, such as their origin-destination (O-D) travel information and their values of time, which may not be available in practice. Motivated by this practical consideration, we propose an online learning approach to set tolls in a traffic network to drive heterogeneous users with different values of time toward a system-efficient traffic pattern. In particular, we develop a simple yet effective algorithm that adjusts tolls at each time period solely based on the observed aggregate flows on the roads of the network without relying on any additional trip attributes of users, thereby preserving user privacy. In the setting where the O-D pairs and values of time of users are drawn i.i.d. at each period, we show that our approach obtains an expected regret and road capacity violation of $O(\sqrt{T})$, where $T$ is the number of periods over which tolls are updated. Our regret guarantee is relative to an offline oracle that has complete information on users' trip attributes. We further establish a $Ω(\sqrt{T})$ lower bound on the regret of any algorithm, which establishes that our algorithm is optimal up to constants. Finally, we demonstrate the superior performance of our approach relative to several benchmarks on a real-world transportation network, thereby highlighting its practical applicability.

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

↑