运动规划
移动机器人
A*搜索算法
计算机科学
冗余(工程)
拐点
路径(计算)
机器人
明星(博弈论)
算法
卷积(计算机科学)
人工智能
数学
计算机网络
人工神经网络
操作系统
数学分析
几何学
出处
期刊:2021 International Conference on Electronic Information Engineering and Computer Science (EIECS)
日期:2021-09-23
被引量:6
标识
DOI:10.1109/eiecs53707.2021.9588002
摘要
Addressing the issue of mobile robots avoiding obstacles autonomously, the traditional A-star algorithm for route planning is improved. First, the full convolution interpolation processing is used to expand the search area of the traditional path planning A-star algorithm. The path inflection point of the improved A-star algorithm is reduced, which shortens the moving distance of the mobile robot. Secondly, through multiple naturalizations of adjacent inflection points, the node redundancy is effectively reduced, and the overall path planning length is greatly reduced. Finally, the improved algorithm is simulated, and the results show that the improved method is a simple, convenient and effective method, which enhances the route planning capability.
科研通智能强力驱动
Strongly Powered by AbleSci AI