基于改进Djikstra算法的自动泊车系统二次规划最优路径研究  

On twice planning optimal path of automatic parking system based on improved Djikstra algorithm

作　　者：程志强[1] 刘云龙[1] 谷善茂[1] CHENG Zhi-qiang;LIU Yun-long;GU Shan-mao(Weifang University,Weifang 261061,China)

机构地区：[1]潍坊学院,山东潍坊261061

出　　处：《潍坊学院学报》2020年第6期35-40,共6页Journal of Weifang University

基　　金：潍坊市科技计划项目(2020GX012)。

摘　　要：针对停车场泊车无序、路径拥堵等停车难问题,提出了一种基于改进Dijkstra算法的二次规划最短路径规划方法。由于驾乘人员搜索的期望空车位目标时常基于电梯入口就近原则实现,首先对停车场空车位到电梯入口的路径以及该空车位到停车场入口的路径分别进行网络建模,其次,基于改进Dijkstra算法,求取停车场各个空车位到电梯入口最短行驶距离确定泊车位,进而求取该泊车位到停车场入口最短行驶距离。最后,输出二次规划的最优泊车路径。算法实例表明,该优化算法简单实用,具有较强的全局搜索能力,可有效地实现泊车路径规划的要求。Aiming at the difficult problem of parking in the parking lot,such as parking disruption and path congestion,a shortest path planning method based on improved Dijkstra algorithm is proposed.The expectation of the occupant's search is usually based on the proximity of the elevator’s entrance.First,respectively establish network model of the path from the parking lot empty parking space to the entrance of the elevator and the path from the empty parking spaces to entrance of the parking lot,Secondly,based on the improved Dijkstra algorithm,and determine the parking spaces according to the shortest distance from the parking lot of each empty parking space to the entrance of the levator,and obtain the shortest distance from the parking spaces to the entrance of the parking lot,Finally,the optimal parking path of the twice planing is output.The algorithm example shows that the optimization algorithm is simple and practical,and has strong global search ability,which can effectively realize the requirements of parking path planning.

关 键 词：自动泊车系统 二次规划 最优路径 改进DIJKSTRA算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]