首页> 外文会议>IEEE International Conference on Robotics and Automation >Where to park? minimizing the expected time to find a parking space
【24h】

Where to park? minimizing the expected time to find a parking space

机译:在哪里停车?减少寻找停车位的预期时间

获取原文

摘要

Quickly finding a free parking spot that is close to a desired target location can be a difficult task. This holds for human drivers and autonomous cars alike. In this paper, we investigate the problem of predicting the occupancy of parking spaces and exploiting this information during route planning. We propose an MDP-based planner that considers route information as well as the occupancy probabilities of parking spaces to compute the path that minimizes the expected total time for finding an unoccupied parking space and for walking from the parking location to the target destination. We evaluated our system on real world data gathered over several days in a real parking lot. We furthermore compare our approach to three parking strategies and show that our method outperforms the alternative behaviors.
机译:快速找到靠近所需目标位置的空闲停车位可能是一项艰巨的任务。这适用于人类驾驶员和自动驾驶汽车。在本文中,我们研究了在规划路线时预测停车位占用率并利用此信息的问题。我们提出了一个基于MDP的计划程序,该计划程序将考虑路线信息以及停车位的占用概率,以计算路径,从而最大程度地减少寻找空闲的停车位以及从停车位置步行至目标目的地的预期总时间。我们根据在真实停车场中几天内收集到的真实世界数据评估了我们的系统。此外,我们将我们的方法与三种停车策略进行了比较,并表明我们的方法优于其他行为。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号