首页> 外文会议>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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号