考虑概率的停车选择
Probability-Aware Parking Selection
AI总结:
本文提出考虑概率的停车选择方法,通过动态规划框架优化停车位置选择,减少到达时间误差,实验表明其在真实数据和模拟中均有效。
摘要:
当前的导航系统将行驶时间误认为真实到达时间,通过忽略停车搜索时间和最终步行段而混淆了两者。这种低估会显著影响用户体验、出行方式选择、交通拥堵和排放。为了解决这个问题,本文引入了考虑概率的停车选择问题,旨在指导司机选择最佳的停车位置而不是直接前往目的地。提出了一种可适应的动态规划框架,利用概率性和停车区级可用性来最小化预期到达时间。闭式分析确定了何时最优地瞄准特定停车区或探索替代方案,以及预期的时间成本。敏感性分析和三个示例案例被检验,展示了该模型能够考虑停车可用性的动态性质。鉴于永久传感基础设施的成本很高,我们评估了使用随机观察来估计可用性的误差率。使用现实世界数据进行的实验表明,这种方法在华盛顿州西雅图市是可行的,随着观察频率的增加,平均绝对误差从7%降低到低于2%。在基于数据的模拟中,考虑概率的策略相对于不考虑概率的基线显示时间节省高达66%,但仍然比行驶时间估计长123%。
英文摘要:
Current navigation systems conflate time-to-drive with the true time-to-arrive by ignoring parking search duration and the final walking leg. Such underestimation can significantly affect user experience, mode choice, congestion, and emissions. To address this issue, this paper introduces the probability-aware parking selection problem, which aims to direct drivers to the best parking location rather than straight to their destination. An adaptable dynamic programming framework is proposed that leverages probabilistic, lot-level availability to minimize the expected time-to-arrive. Closed-form analysis determines when it is optimal to target a specific parking lot or explore alternatives, as well as the expected time cost. Sensitivity analysis and three illustrative cases are examined, demonstrating the model's ability to account for the dynamic nature of parking availability. Given the high cost of permanent sensing infrastructure, we assess the error rates of using stochastic observations to estimate availability. Experiments with real-world data from the US city of Seattle indicate this approach's viability, with mean absolute error decreasing from 7% to below 2% as observation frequency increases. In data-based simulations, probability-aware strategies demonstrate time savings up to 66% relative to probability-unaware baselines, yet still take up to 123% longer than time-to-drive estimates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。