系统仿真学报 ›› 2024, Vol. 36 ›› Issue (7): 1643-1654.doi: 10.16182/j.issn1004731x.joss.23-0407

• 研究论文 • 上一篇    

基于角度搜索的移动机器人路径规划方法

王雅如1(), 姚得鑫2, 刘增力1(), 彭艺1   

  1. 1.昆明理工大学 信息工程与自动化学院,云南 昆明 650500
    2.昆明理工大学 机电工程学院,云南 昆明 650500
  • 收稿日期:2023-04-10 修回日期:2023-05-09 出版日期:2024-07-15 发布日期:2024-07-12
  • 通讯作者: 刘增力 E-mail:884683524@qq.com;2285383243@qq.com
  • 第一作者简介:王雅如(1997-),女,硕士生,研究方向为移动机器人路径规划。E-mail:884683524@qq.com
  • 基金资助:
    国家自然科学基金(61761025)

Path Planning for Mobile Robot Based on Angle Search

Wang Yaru1(), Yao Dexin2, Liu Zengli1(), Peng Yi1   

  1. 1.Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
    2.Faculty of Mechanical and Electrical Engineering, Kunming University of Science and Technology, Kunming 650500, China
  • Received:2023-04-10 Revised:2023-05-09 Online:2024-07-15 Published:2024-07-12
  • Contact: Liu Zengli E-mail:884683524@qq.com;2285383243@qq.com

摘要:

为提升路径搜索速度,优化路径长度,提出一种用角度控制机器人的寻路算法—角度搜索算法。该算法根据机器人位置与目标点位置进行一定维度的高效搜索,从而实现在静态环境中有效寻路。根据所用栅格地图的环境特点,提前设定搜索角;计算机器人周围栅格的预估角;将预估角与搜索角进行比较选出新的扩展点,在扩展过程中排除重复路径的扩展和搜索角范围内无可行点的情况,直到找到目标点生成最终路径。通过仿真测试,将提出算法与Dijkstra、A*两种算法在复杂程度不同的两种地图上进行比较,所提算法寻路时间分别最大减少了19.44%和12.23%,转折次数分别最大减少了28.6%和54.5%,路径长度较A*算法在两种地图上分别减少了9.28%和6.53%,且在简单场景中实现了对局部障碍物的动态规避。将所提算法应用到基于ROS的移动机器人Turtlebot2上,实验结果表明,在相同地图环境中,所提算法较A*算法路径更加平滑稳定,验证了所提算法的有效性和可行性。

关键词: 路径规划, 预估角, 移动机器人, 搜索角, ROS

Abstract:

The angle search algorithm for angle-controlled robots is proposed to increase the path search speed and optimize the path length. The algorithm effectively finds a path in static surroundings by performing an efficient search in a specific dimensional range based on the position of the robot and the target point. Firstly, search angles are predetermined according to the characteristics of the environment in the grid map. Then, the estimated angle of the robot's surrounding grid is computed. Finally, a new extension point is chosen by comparing the estimated angle to the search angle, demonstrating the usefulness and viability of the suggested algorithm. The proposed algorithm is compared with the Dijkstra and A* algorithms on two types of maps with different levels of complexity. The path finding time of the proposed algorithm is reduced by 19.44% and 12.23% respectively, and the number of turns is reduced by 28.6% and 54.5% respectively. The path length is reduced by 9.28% and 6.53% respectively compared with the A* algorithm on the two maps, and the dynamic avoidance of local obstacles is realized in simple scenes. The proposed algorithm is then applied to the ROS-based Turtlebot2 mobile robot, and the experimental results reveal that it is smoother and more stable than the A* algorithm in the same map environment, proving its viability and effectiveness.

Key words: path planning, estimated angle, mobile robot, search angle, ROS

中图分类号: