检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王杨斌 章伟 王为科 胡陟 WANG Yangbin;ZHANG Wei;WANG Weike;HU Zhi(College of Mechanical and Automotive Engineering,Shanghai University of Engineering Science,Shanghai 201000,China)
机构地区:[1]上海工程技术大学机械与汽车工程学院,上海201000
出 处:《电光与控制》2022年第5期28-32,共5页Electronics Optics & Control
基 金:国家自然科学基金青年科学基金(62003207)。
摘 要:针对Informed-RRT^(*)算法在路径规划中与动态障碍物的碰撞问题,提出基于Informed-RRT^(*)和人工势场法的改进路径规划算法。该算法引入椭圆区域采样策略和自适应步长策略提高了寻找可行全局路径的稳定性和效率,在静态障碍物边界区域获得最优成本可行路径方案。当机器人按照全局路径运动遇到动态障碍物时,引入裁剪路径分支策略和人工势场法对局部路径进行重规划,实现动态避障功能。将改进算法应用于仿真环境,结果表明改进算法实现了全局最优探索和局部避障功能,验证了算法的有效性。Regarding the problem of the Informed-RRT^(*) algorithm of collision with dynamic obstacles in path planning,an improved path planning algorithm based on Informed-RRT^(*) and artificial potential field method is proposed.The algorithm introduces elliptical region sampling strategy and adaptive step-size strategy to improve the stability and efficiency of finding feasible global path,and the optimal cost feasible path scheme is obtained in the boundary region of static obstacles.When the robot encounters dynamic obstacles in its movement according to the global path,the cutting path branching strategy and artificial potential field method are introduced to re-plan the local path to realize dynamic obstacle avoidance.The improved algorithm is applied to the simulation environment,and the results show that the improved algorithm achieves the functions of global optimal search and local obstacle avoidance,which verifies the effectiveness of the algorithm.
关 键 词:路径规划 动态环境 Informed-RRT^(*) 人工势场法 自适应步长策略 动态避障
分 类 号:TP242[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15