محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | Preprint |
| منشور في: |
2026
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://arxiv.org/abs/2601.00521 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1866910008232378368 |
|---|---|
| author | Hickert, Cameron Li, Sirui He, Zhengbing Wu, Cathy |
| author_facet | Hickert, Cameron Li, Sirui He, Zhengbing Wu, Cathy |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_00521 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Probability-Aware Parking Selection Hickert, Cameron Li, Sirui He, Zhengbing Wu, Cathy Systems and Control Artificial Intelligence Applications 90B20 (Primary) 90C39, 90C40 (Secondary) G.3; I.2.8; J.2 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. |
| title | Probability-Aware Parking Selection |
| topic | Systems and Control Artificial Intelligence Applications 90B20 (Primary) 90C39, 90C40 (Secondary) G.3; I.2.8; J.2 |
| url | https://arxiv.org/abs/2601.00521 |