检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:贾海峰 施文征 JIA Haifeng;SHI Wenzheng(Intelligent Network Department of the Second Academy of Engineering Research,IAT Automobile Technology Company Limited,Beijing 100080,China)
机构地区:[1]阿尔特汽车技术股份有限公司工程研究二院智能网联部,北京100080
出 处:《汽车实用技术》2025年第6期52-59,共8页Automobile Applied Technology
摘 要:在泊车场景复杂的情况下,现有的平行泊车算法存在环境适用范围小、计算时间长、失败率高等问题,为了解决这一问题,设计了一种基于几何曲线和改进混合A*的自动泊车路径规划算法。首先,根据阿克曼的转向理论建立了汽车的运动学模型;其次,设计了几何曲线法来对简单的平行泊车场景进行路径规划;然后,设计了一种改进混合A^(*)来提高复杂平行场景泊车的规划成功率;最后,利用仿真软件进行仿真分析并实车验证。结果表明,基于几何曲线和改进混合A*的自动泊车路径规划算法能够有效地扩大泊车环境适用范围,增强计算能力,提高平行泊车规划成功率,并在泊车领域具有非常广泛的应用前景。In the case of complex parking scenarios,the existing parallel parking algorithms have some problems such as small scope of application,long computing time and high failure rate.In order to solve these problems,an automatic parking path planning algorithm based on geometric curves and improved hybrid A^(*)is designed.Firstly,the kinematic model of the vehicle is established according to Ackermann's steering theory.Secondly,the geometric curve method is designed to plan the path of the simple parallel parking scene.Then,an improved hybrid A^(*)is designed to improve the success rate of parking planning in complex parallel scenes.Finally,simulation software is used to carry out simulation analysis and real vehicle verification.The results show that the automatic parking path planning algorithm based on geometric curves and improved hybrid A*can effectively expand the application scope of parking environment,enhance computing power,improve the success rate of parallel parking planning,and has a very wide application prospect in the parking field.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43