基于权值的Dijkstra停车路径规划算法的优化与实现  

Optimizing Dijkstra algorithm design and accomplishment for parking routine programming based on weight caculation

作　　者：袁琳[1] 王渊[1] 孙建芸 王新生[1,2] 

机构地区：[1]湖北大学资源环境学院,湖北武汉430062 [2]农业部遥感应用中心武汉分中心,湖北武汉430062

出　　处：《湖北大学学报（自然科学版）》2017年第3期279-284,共6页Journal of Hubei University：Natural Science

摘　　要：基于用户自由选择车位,以停车时间最短为准则,结合权值的计算方法及停车场的内部结构特点,对Dijkstra算法进行改进,设计并实现符合实际的最优停车路径规划算法,并对武汉某公园的大型停车场进行应用验证.结果表明,相对于传统算法,改进后的Dijkstra算法降低时间的复杂度,减少节点的搜索量,提高搜索效率,在停车场引导系统中有一定的实际应用价值.Relying on the principle that the user self-defined routine,and shortest parking time purpose,we associate with combining the weight calculation algorithm and parking lot internal structure to optimize theDijkstra algorithm and accomplished the algorithm for the best parking routine design.The research result hasbeen successfully tested in one selected large parking garage in Wuhan Park,and proved to be a greatimprovement in reducing time complication,node searching times,and improved the searching efficiency.Theimproved parking guide system has some practical value.

关 键 词：停车场 权值 DIJKSTRA算法 最优停车路径 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]