Cooperative system for free parking assignment
Cooperative system for free parking assignment
复制标题
免费停车分配协作系统
DOI：
10.1109/vnc.2017.8275639
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
C. Borcea
中科院分区：
文献类型：
--
作者：
Abeer Hakeem;N. Gehani;Reza Curtmola;Xiaoning Ding;C. Borcea
本文提出了分布式免费停车系统（DFPS），这是一种用于分配免费路边停车位的去中心化系统。 DFPS 优化了整个系统的社会福利目标：所有驾驶员到达目的地的总出行时间。 DFPS 使用驾驶员的智能手机来分配停车请求，并使用集中调度程序来接收和分发停车请求。 DFPS 中的停车驱动程序采用 K-D 树结构，用于以分布式方式服务新的停车请求。 DFPS 通过消除调度员的计算并大幅减少调度员处理的通信，解决了与集中式停车分配系统相关的可扩展性问题。同时，DFPS 实现了与集中式系统类似的行程时间性能。与假设广度优先搜索目的地周围停车位的简单算法相比，DFPS 减少了超过 97% 的驾驶员的出行时间。
This paper presents Distributed Free Parking System (DFPS), a decentralized system for assigning free curbside parking spaces. DFPS optimizes a system-wide social welfare objective: the total travel time to destinations for all drivers. DFPS uses the smart phones of the drivers for parking request assignment, and a centralized dispatcher to receive and distribute parking requests. The parked drivers in DFPS are structured in a K-D tree, which is used to serve new parking requests in a distributed fashion. DFPS solves the scalability problem associated with a centralized parking assignment system by removing the computation from the dispatcher and substantially reducing the communication handled by the dispatcher. At the same time, DFPS achieves similar travel time performance with a centralized system. Compared to a naive algorithm that assumes a breadth-first-search for parking spaces around the destinations, DFPS reduces the travel time for over 97% of the drivers.