Abeer Hakeem, N. Gehani, Reza Curtmola, Xiaoning Ding, C. Borcea
{"title":"免费泊车分配合作系统","authors":"Abeer Hakeem, N. Gehani, Reza Curtmola, Xiaoning Ding, C. Borcea","doi":"10.1109/VNC.2017.8275639","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":101592,"journal":{"name":"2017 IEEE Vehicular Networking Conference (VNC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cooperative system for free parking assignment\",\"authors\":\"Abeer Hakeem, N. Gehani, Reza Curtmola, Xiaoning Ding, C. Borcea\",\"doi\":\"10.1109/VNC.2017.8275639\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":101592,\"journal\":{\"name\":\"2017 IEEE Vehicular Networking Conference (VNC)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Vehicular Networking Conference (VNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VNC.2017.8275639\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Vehicular Networking Conference (VNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNC.2017.8275639","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
