QQ客服 官方微博 反馈留言

	Parking rank: A novel method of parking lots sorting and recommendation based on public information
	Shi Dong; Mingsong Chen; Lei Peng; Huiyun Li
	2018
会议日期	2018
会议地点	Lyon France
英文摘要	Nowadays, it’s difficult to find available parking spaces in big cities within china due to the rapid growth of the vehicles. Parking guidance system(PGS) would play an important role to reduce the time spent on looking for parking spaces. An intuitional idea is to collect the real-time occupancy information of city-wide parking lots and guide the vehicles to the proper one on demands. But the idea is hardly implemented practically because of the huge financial and time costs on linking all city-wide parking lots in early deployment stage. Unlike the expensive real-time data, the public information of parking lots is easily obtained with little costs. What if we dig these free public data and use them in parking recommendation? Inspired by the classic Page rank algorithm used in web searching, this paper propose a novel method, named Parking rank, to sort the parking lots based on the public information totally, such as price, location, total spaces, etc. And a driving-cost sensitive recommendation method is presented in this paper. The simulation shows, when working with the Parking rank algorithm, the recommendation algorithm can help vehicles find the proper parking lots efficiently and reasonably, even in the urban district lack of any real-time information. In fact, Parking rank algorithm can be used as pre-processing of static ranking of city-wide parking lots , and can work with other recommendation algorithm related to real-time occupancy information, or work alone if there is only the public information about parking lots.
URL标识	查看原文
内容类型	会议论文
源URL	[http://ir.siat.ac.cn:8080/handle/172644/13730]
专题	深圳先进技术研究院_集成所
推荐引用方式 GB/T 7714	Shi Dong,Mingsong Chen,Lei Peng,et al. Parking rank: A novel method of parking lots sorting and recommendation based on public information[C]. 见:. Lyon France. 2018.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。