Path Planning for Automated Valet Parking in Underground Parking Lots Based on UWB and Improved Bidirectional A* Algorithm
编号:52 访问权限:仅限参会人 更新:2025-06-15 10:48:33 浏览:14次 口头报告

报告开始:暂无开始时间(Asia/Shanghai)

报告时间:暂无持续时间

所在会场:[暂无会议] [暂无会议段]

暂无文件

摘要
In increasingly complex underground parking environments, traditional path planning algorithms often struggle with low efficiency and poor path stability when handling long-distance parking tasks. To address these challenges, this paper proposes an improved bidirectional A* path planning method guided by virtual Ultra-Wideband (UWB) anchor points. The approach enhances the heuristic cost function by incorporating information from both forward and reverse search frontiers, which accelerates path convergence and reduces redundant node expansion. Additionally, virtual relay points are introduced via UWB positioning systems to guide the path direction, and the global task is executed in multiple stages to further improve search efficiency and robustness. Simulation results in the university's underground parking lot demonstrate that, compared with traditional A* and bidirectional A* algorithms, the proposed method significantly reduces both search time and node expansion, particularly in long-distance and multi-intersection scenarios. These results validate the feasibility and practicality of the proposed method for large-scale indoor automated valet parking (AVP) applications.
 
关键词
automated valet parking, path planning, A*, UWB
报告人
Liu Run
student SHENZHEN TECHNOLOGY UNIVERSITY

稿件作者
Liu Run SHENZHEN TECHNOLOGY UNIVERSITY
Heyan Li SHENZHEN TECHNOLOGY UNIVERSITY
Wenhao Zhang SHENZHEN TECHNOLOGY UNIVERSITY
Haoyun Yuan SHENZHEN TECHNOLOGY UNIVERSITY
Junde Li SHENZHEN TECHNOLOGY UNIVERSITY
Jiantong Wu SHENZHEN TECHNOLOGY UNIVERSITY
发表评论
验证码 看不清楚,更换一张
全部评论
重要日期
  • 会议日期

    08月01日

    2025

    08月04日

    2025

  • 06月23日 2025

    初稿截稿日期

主办单位
中国机械工程学会设备智能运维分会
承办单位
新疆大学
移动端
在手机上打开
小程序
打开微信小程序
客服
扫码或点此咨询