基于A*优化算法的停车场动态泊车研究

Research of dynamic parking in parking lots based on A* optimization algorithm

摘要:

针对目前大型停车场停车效率、车位利用率低等问题，将停车效率问题转化为动态泊车概率问题，结合实际的地下停车场车位模型，以泊车用户的泊车概率、算法搜索效率为主要评价指标，并以较大的概率快速寻找到可用空车位为目的，提出了一种带约束条件的A*优化算法，然后基于VC++6.0环境对停车场实例进行算法的应用仿真。实验结果表明，优化后的A*算法大大增加了泊车用户的泊车概率，A*算法的搜索效率也得到显著提高，此A*算法在停车场中的应用，很大程度上提高了泊车用户的停车效率以及停车位的利用率，减少了泊车用户盲目重复寻找车位所花费的时间，在大型停车场中具有一定的应用研究价值。

Abstract:

In view of the problems in parking lots of low parking efficiency and parking set utilization rate. combining the parking model of underground parking lot,translating the question of parking efficiency into the question of dynamic parking probability, evaluate the algorithm with parking probability and algorithm efficiency, an improved A* algorithm with constrains is proposed in this paper. The experimental result based on structure of parking lot and VC++6.0 platform show that both the parking probability and algorithmic search efficiency are increased. in some way, the application of improved A* algorithm in parking lots increase the user parking efficiency and parking set utilization rate,reducing the time that parking users will spend blindly looking for parking Spaces, so it has definite pragmatic research value in parking lots.