摘要
为了方便车主寻找车位,优化城市停车位资源,缓解高峰时段泊车位紧张问题,提出了基于分布式架构的泊车分配算法。通过用户终端收集包含当前位置坐标信息与目的地坐标信息的用户泊车请求,根据目的地临近泊车位的可用状态,将路径规划返回给用户终端。与传统算法相比,分布式泊车算法具有更高的抗压能力与全局搜索能力,能够确保泊车信息的实时性与有效性,以减少停车位紧张和车位失效等状况。仿真结果表明:算法可在高需求量、高需求比场景下更快速、更准确地找到占优解集,且更符合实际情况,具有一定的应用价值。
In order to make it easier for drivers to find a parking slot,optimize the resources of urban parking slots,and alleviate the problem of parking slot shortage,a distributed parking allocation algorithm is proposed.The algorithm collects the parking requests of user,including current position coordinate information of the users and destination coordinate information,according to available state of parking slot near destination,the parking route planning is returned to the client.Compared with the traditional algorithm,the distributed parking algorithm has a higher ability to withstand pressure and global search capability,and it can ensure the real-time and validity of the parking information,so as to reduce the problem of the parking slot shortage and unavailable parking slot.The simulation results show that this algorithm can find the solution set more quickly and accurately under the circumstance of high demand,it also have application value and practicality.
作者
庞华健
陈观林
徐煌
PANG Huajian;CHEN Guanlin;XU Huang(School of Information Science&Engineering,Changzhou University,Changzhou 213164,China;School of Computer and Computing Science,Zhejiang University City College,Hangzhou 310015,China)
出处
《传感器与微系统》
CSCD
2019年第5期117-120,124,共5页
Transducer and Microsystem Technologies
基金
浙江省杭州市重大科技创新资助项目(20162013A08)
浙江省重点研发计划资助项目(2015C01027)
关键词
城市交通
车位分配
分布式计算
匹配算法
city traffic
parking slot allocation
distributed computing
matching algorithm
