NOVEL APPROACH FOR ROBOT PATH PLANNING BASED ON NUMERICAL ARTIFICIAL POTENTIAL FIELD AND GENETIC ALGORITHM

A novel approach for collision-free path planning of a multiple degree-of-freedom （DOF） articulated robot in a complex environment is proposed. Firstly, based on visual neighbor point （VNP）, a numerical artificial potential field is constructed in Cartesian space, which provides the heuristic information, effective distance to the goal and the motion direction for the motion of the robot joints. Secondly, a genetic algorithm, combined with the heuristic rules, is used in joint space to determine a series of contiguous configurations piecewise from initial configuration until the goal configuration is attained. A simulation shows that the method can not only handle issues on path planning of the articulated robots in environment with complex obstacles, but also improve the efficiency and quality of path planning.

Mobile robot path planning method combined improved artificial potential field with optimization algorithm

To overcome the shortcomings of the traditional artificial potential field method in mobile robot path planning, an improved artificial potential field model （IAPFM） was established, then a new path planning method combining the IAPFM with optimization algorithm （trust region algorithm） is proposed. Attractive force between the robot and the target location, and repulsive force between the robot and the obstacles are both converted to the potential field intensity; and filled potential field is used to guide the robot to go out of the local minimum points ; on this basis, the effect of dynamic obstacles velocity and the robot＇s velocity is consid thers and the IAPFM is established, then both the expressions of the attractive potential field and the repulsive potential field are obtained. The trust region algorithm is used to search the minimum value of the sum of all the potential field inten- sities within the movement scope which the robot can arrive in a sampling period. Connecting of all the points which hare the minimum intensity in every sampling period constitutes the global optimization path. Experiment result shows that the method can meet the real-time requirement, and is able to execute the mobile robot path planning task effectively in the dynamic environment.

Path Planning for AUVs Based on Improved APF-AC Algorithm

With the increase in ocean exploration activities and underwater development,the autonomous underwater vehicle(AUV)has been widely used as a type of underwater automation equipment in the detection of underwater environments.However,nowadays AUVs generally have drawbacks such as weak endurance,low intelligence,and poor detection ability.The research and implementation of path-planning methods are the premise of AUVs to achieve actual tasks.To improve the underwater operation ability of the AUV,this paper studies the typical problems of path-planning for the ant colony algorithm and the artificial potential field algorithm.In response to the limitations of a single algorithm,an optimization scheme is proposed to improve the artificial potential field ant colony(APF-AC)algorithm.Compared with traditional ant colony and comparative algorithms,the APF-AC reduced the path length by 1.57%and 0.63%(in the simple environment),8.92%and 3.46%(in the complex environment).The iteration time has been reduced by approximately 28.48%and 18.05%(in the simple environment),18.53%and 9.24%(in the complex environment).Finally,the improved APF-AC algorithm has been validated on the AUV platform,and the experiment is consistent with the simulation.Improved APF-AC algorithm can effectively reduce the underwater operation time and overall power consumption of the AUV,and shows a higher safety.

LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment

In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account.

基于改进APF-Informed-RRT^(*)的机械臂避障路径规划

针对Informed-RRT^(*)算法在避障路径规划中缺乏目的性和方向性,存在规划时间长、迭代效率低等问题,提出了结合人工势场法和Informed-RRT^(*)算法的避障规划算法。首先,针对传统人工势场法存在目标点不可达、易与障碍物碰撞的问题,提出了改进后的人工势场法,并将其融入Informed-RRT^(*)算法中,使随机树沿势场下降的方向生长,增强其方向性;其次,依据随机树与障碍物间的距离,提出了一种自适应生长步长策略,提高了对空间的探索能力;最后,引入贪心算法的思想,在生长时直接判断随机树能否直达目标点,提高了路径规划效率。在二维和三维环境下对改进后的算法与传统算法及其衍生算法进行对比实验,仿真结果表明改进后的Informed-RRT^(*)算法相较于原始算法规划的路径长度和规划耗时分别减少了17.42%和36.21%。

基于改进APF-FMT^(*)的农业机器人路径规划算法

【目的】解决农业机器人在复杂农业环境下全局路径规划耗时过长、路径最优解求解困难的问题。【方法】提出一种基于改进人工势场法的快速行进树算法(APF-FMT^(*))。首先,在引力势场中引入相对距离,根据与目标点的距离改变引力大小,克服了人工势场法距离目标点过远时引力过大的问题;然后,将FMT^(*)算法与改进人工势场法相结合,采用三阶B样条曲线对路径进行平滑处理;最后,建立3个农业工作地图进行仿真试验。【结果】仿真结果表明,与FMT^(*)、RRT^(*)和Informed-RRT^(*)3种算法对比,在地图Map1和Map2中,APF-FMT^(*)都能快速找到良好的解,且随样本数量增加获得的路径解得到改善,搜索时间比其他3种算法减少45%以上;在有狭小通道的Map3中,APF-FMT^(*)、FMT^(*)搜索时间比RRT^(*)和Informed-RRT^(*)减少75%以上,并且获得更好的解。【结论】本研究提出的APF-FMT^(*)算法不仅克服了FMT^(*)算法冗余探索问题,还有效地解决了人工势场法目标点不可达的问题,提高了农业机器人路径规划效率和作业安全性。

改进RRT^(*)-APF-DP融合算法的机械臂路径规划

针对基本的快速拓展随机树算法(rapidly-exploring random tree,RRT^(*))存在搜索随机性大、效率低、路径非最优的缺点,提出一种引入人工势场法算法(artificial potential field method,APF)和Douglas-Peucker算法的改进RRT^(*)-APF-DP路径规划算法.在RRT*算法的采样点生成阶段引入变采样范围偏置搜索与步长自适应调整策略,融合重新设计的APF算法的引力与斥力函数,增强路径扩展导向性与绕过障碍物能力.采用重采样策略改进DP算法,优化避障代价与控制点数量.实验结果表明,本算法规划的避障路径满足机械臂的运动要求,且算法规划的避障路径代价、规划时间和路径控制节点数均得到有效改善.

Ant Colony Optimization with Potential Field Based on Grid Map for Mobile Robot Path Planning

For the mobile robot path planning under the complex environment,ant colony optimization with artificial potential field based on grid map is proposed to avoid traditional ant colony algorithm's poor convergence and local optimum.Firstly,the pheromone updating mechanism of ant colony is designed by a hybrid strategy of global map updating and local grids updating.Then,some angles between the vectors of artificial potential field and the orientations of current grid are introduced to calculate the visibility of eight-neighbor cells of cellular automata,which are adopted as ant colony's inspiring factor to calculate the transition probability based on the pseudo-random transition rule cellular automata.Finally,mobile robot dynamic path planning and the simulation experiments are completed by this algorithm,and the experimental results show that the method is feasible and effective.

基于双向A^(*)-APF算法的船舶路径规划研究

为解决目前船舶路径规划算法中存在的全局非最优解和局部最优解等问题,在双向A^(*)算法的基础上加入了优化函数PathOptimization和IsClear,以去除冗余拐点,缩短全局路径距离;在人工势场法(artificial potential field,APF)的基础上,设定离散化步长函数、斥力感应阈值和临时终点,以避免局部最优解和震荡问题;实现两种算法的融合算法(双向A^(*)-APF算法),在MATLAB模拟的相同栅格图中,对比算法改进前后的模拟试验数据。结果表明,融合算法平均减少了50%的冗余拐点,平均减少了47.5%的算法搜索时间,平均缩短了7%的路径距离,能够同时安全规避动态障碍物和静态障碍物。研究表明,双向A^(*)-APF算法可用于解决船舶路径全局非最优解和局部最优解等问题。

APF与A*融合的多目标点路径规划算法

在智能餐厅环境下,针对移动机器人在多目标点路径规划时存在规划效率不高的问题,提出了一种基于A*算法与APF算法相结合的多目标点路径规划的方法。将多目标点路径规划问题转化成类旅行商问题,采用A*算法和人工势场法规划出多目标点的最优遍历顺序。首先,将若干个目标点用一个集合表示并应用在A*算法上面,实现A*算法多个目标点的路径规划;其次,引入人工势场法对多个目标点进行优先级判定,借助人工势场法计算各个目标点的势能值,之后利用人工势场法得到的势能值对目标点集进行排序,完成各个目标点之间的最优顺序;最后,对规划好的目标点集使用A*算法进行全局路径规划。为了验证该方法的有效性和先进性,将该算法进行消融实验,同时也与两种典型的多目标点规划算法进行对比。结果表明,该算法是有效的,能够在缩短路径规划时间和降低路径代价的同时规划出一条有效路径。

基于APF-LSTM-DDPG算法的移动机器人局部路径规划

针对深度强化学习算法存在训练时间长、收敛速度慢的问题,将深度确定性策略梯度(deep deterministic policy gradient,DDPG)算法和人工势场(artifical potential field,APF)法相融合,引入长短期记忆(long short-term memory,LSTM)神经网络结构,提出了APF-LSTM-DDPG算法。首先在DDPG算法中添加LSTM,通过记忆单元和遗忘单元将奖励较高的样本优先学习,使模型更快地收敛;其次引入人工势场法,设计相应势场函数,解决环境奖励稀疏的缺点,加速模型收敛进程;然后通过人工势场法修正算法的动作选择,缩短路径长度;最后在机器人仿真平台(robot operating system,ROS)中搭建不同障碍物环境对算法进行了仿真验证。仿真结果表明,APF-LSTM-DDPG算法在搭建的仿真环境中训练时平均奖励能够更快地稳定,提高了算法的成功率并减少了规划路径中的冗余。

融合RRT^(*)与APF算法的机器人路径规划研究

针对传统快速扩展随机树(rapidly-exploring random tree star,RRT^(*))算法在全局路径规划过程中存在收敛速度慢、搜索路径不平滑、内存占用多等问题,提出了一种RRT^(*)与人工势场法(artificial potential field,APF)的融合搜索算法。为了加快RRT^(*)算法在搜索过程中的收敛速度,在算法中利用人工势场法的思想引导扩展随机树快速向目标点生长;对融合算法在空间中的采样范围做出改进,使算法在APF产生的合力特定范围内进行采样,提高算法在空间中的搜索效率,减少无用节点的扩展。仿真结果表明:相比传统的RRT和RRT^(*)算法以及APF-RRT融合算法,APF-RRT^(*)融合算法能够规划出更短、更平滑的路径,路径距离缩短了1.5%~10.83%;算法的搜索时间也显著缩短了1.97%~49.78%;与其他算法相比,APF-RRT^(*)融合算法的路径节点数量减少了4.66%~41.95%,路径平滑性也得到了提高。

一种改进的SA-APF路径规划算法

针对基于模拟退火的人工势场算法存在局部最小值问题,引入一种随机逃逸力,提出一种改进的SA-APF(Simulated Annealing-Artificial Potential Field)算法,可使机器人快速逃离局部最优解。针对算法中仍存在目标不可达问题,根据模糊控制方法提出一种自适应斥力势场增益系数,在机器人遇到目标点附近有对称排列的障碍物时,使机器人能够到达目标点,并采用4次贝赛尔曲线拟合,使路径更光滑。仿真结果表明,在简单和复杂的障碍物的实验条件下,改进后的算法可以准确、高效地完成路径规划。

一种AAPF算法及其在多机器人路径规划中的应用

研究了多移动机器人系统中的路径规划问题,提出一种自适应人工势场算法AAPF.通过引入自适应滑动策略,克服了基本APF算法容易陷入局部极值的问题;通过引入自适应退避策略,解决了多机器系统路径规划中的避碰问题.将AAPF算法应用到多机器人系统的路径规划问题中,仿真实验证明了AAPF算法的有效性.

基于APFIGA的全方位机器人多障碍区路径规划研究

为解决机器人在多障碍区的路径规划问题，提出了一种基于由遗传算法改进的人工势场法（APFIGA）的全方位移动操作机器人路径规划方法。该规划方法通过在可穿越的障碍区添加障碍物穿越系数来鼓励机器人走捷径，进而提高其路径优化能力；利用当前点邻域内势场强度信息，结合遗传算法确定全方位移动操作机器人的运动方向及速度，并引入机器人速度及移动障碍物速度的影响，得出势场强度下降最快的路径，提高方法的动态环境规划能力。该方法能克服机器人在障碍物附近易于抖动的现象，通过在斥力势中添加与目标距离成正比的系数项解决目标不可达问题，并利用填平势场跳出局部极小。仿真与实物实验结果验证了所提出路径规划方法的正确性和有效性。

复杂环境下改进APF的机器人路径规划

针对移动机器人在有大型障碍物和运动空间相对狭窄的复杂环境中,人工势场法(APF)容易出现反复震荡、路径规划时间较长以及大型障碍物附近避障困难的问题,提出了在结合边缘探测法的APF路径规划基础上,加入自适应动态步长调整算法来克服APF的上述缺陷,实现移动机器人在复杂环境下的平滑路径规划,在确保路径近似最优的同时提高APF算法的收敛速度和路经规划的避障性能。实验结果证明了上述方法的有效性。

基于APF-RRT算法的无人机航迹规划

提出了一种基于改进快速随机搜索树算法、人工势场法和遗传算法相融合(APF-RRT)的无人机航迹规划方法,以解决搜索范围随机性强和收敛速度较慢的问题。首先,引入目标偏置来引导随机采样点的生成,因目标点有一定的概率成为采样点,从而减少采样数量。同时,加入改进人工势场法来改进新节点的生成方向,将目标点与障碍物的合力方向作为搜索树的生长方向,提高了路径搜索的效率。然后,将改进后的RRT算法生成的一组航迹点作为遗传算法的初始种群,并建立了适应度函数模型,利用遗传算法对路径进行了优化,获得较优路径,解决了路径随机性问题。最后,仿真结果表明改进后算法生成的路径长度更短,运行时间更短。

基于PER-APF算法的无人驾驶汽车换道轨迹规划

针对传统人工势场算法在解决无人驾驶汽车换道轨迹规划过程中存在的不足,提出一种基于势能重构人工势场(PER-APF)的无人驾驶汽车换道轨迹规划算法;首先,建立了具有斥力区分的道路边界约束条件和多约束换道轨迹规划模型,通过判断障碍车辆与道路边沿的距离来保证换道过程的安全性与有效性;其次,提出了基于势能重构的改进APF算法,通过构建虚拟区域以及重构物理势能力场,有效地解决了目标不可达以及局部最优问题;仿真结果表明,所设计的PER-APF算法能够快速有效地为无人驾驶汽车规划一条安全合理的换道轨迹。

一种基于APF的点式移动机器人全局路径规划方法

提出一种基于人工势场法(APF)的点式移动机器人在静态环境的无碰撞路径规划方法.该方法采用三阶段过程:环境建模,可行方向搜索和路径生成.该方法的最大优点就是方向性强,计算量小.

改进的APF算法在采摘机械手运动规划中的应用

针对六连杆采摘机械手运动规划的实时性,基于传统的人工势场(APF)算法,提出改进的人工势场(IAPF)优化算法。采用初等变换序列方法对机械手进行运动学建模,运用该模型可方便地得到机械手上各点相对于基底坐标系的雅可比矩阵。IAPF算法在APF算法原有的引力势场计算模型的基础上,加入了Sigmoid函数,以使得路径规划算法收敛,在斥力势场中引入了反S的Sigmoid函数,防止出现斥力爆炸现象。IAPF算法避免了传统算法的局部最小缺陷和目标不可达问题,同时有效地减少机械手运动规划的计算时间和关节误差。并通过实验验证了所提优化算法在采摘机械手避障运动规划中的实时性和准确性。