CN114077255B - A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method - Google Patents

A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method Download PDF

Info

Publication number
CN114077255B
CN114077255B CN202111388075.8A CN202111388075A CN114077255B CN 114077255 B CN114077255 B CN 114077255B CN 202111388075 A CN202111388075 A CN 202111388075A CN 114077255 B CN114077255 B CN 114077255B
Authority
CN
China
Prior art keywords
target point
intelligent vehicle
obstacle
point
potential field
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111388075.8A
Other languages
Chinese (zh)
Other versions
CN114077255A (en
Inventor
刘冉冉
颜海彬
藏传涛
郑恩兴
郭威
蒋益锋
李丽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu University of Technology
Original Assignee
Jiangsu University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Jiangsu University of Technology filed Critical Jiangsu University of Technology
Priority to CN202111388075.8A priority Critical patent/CN114077255B/en
Publication of CN114077255A publication Critical patent/CN114077255A/en
Application granted granted Critical
Publication of CN114077255B publication Critical patent/CN114077255B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05DSYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
    • G05D1/02Control of position or course in two dimensions
    • G05D1/021Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0212Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
    • G05D1/0214Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory in accordance with safety or protection criteria, e.g. avoiding hazardous areas
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

本发明公开了一种基于椭圆模型人工势场法的智能车寻路方法,包括构建相应地图、建立坐标系、确定障碍物位置坐标和目标点位置,然后判断智能车当前是否到达终点位置,若到达终点位置,则完成路径规划,生成最终路径;若未到达终点位置,则用人工势场法进行路径规划,计算智能车当前位置所受到的引力、斥力及合力大小及方向,判断是否陷入局部极小值问题。优点在于:在庞杂环境中,采用椭圆模型增设虚拟目标点,虚构目标点产生的引力将改变机器人在局部最小值的状态,通过在椭圆模型上不断修正虚构目标点的位置,从而使智能车跳出局部平衡区域,同时大大降低了算法的时间成本。

The invention discloses a method of finding a way for a smart car based on an ellipse model artificial potential field method, which includes constructing a corresponding map, establishing a coordinate system, determining the position coordinates of obstacles and the position of a target point, and then judging whether the smart car has reached the end point. When the end point is reached, the path planning is completed and the final path is generated; if the end point is not reached, the artificial potential field method is used for path planning, and the gravity, repulsion, and resultant force and the direction of the current position of the smart car are calculated to determine whether it is trapped in a local area. minima problem. The advantage is that in a complex environment, the ellipse model is used to add a virtual target point. The gravitational force generated by the virtual target point will change the state of the robot at the local minimum. By continuously correcting the position of the virtual target point on the ellipse model, the smart car will jump out Locally balanced regions, while greatly reducing the time cost of the algorithm.

Description

一种基于椭圆模型人工势场法的智能车寻路方法A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method

技术领域technical field

本发明涉及自动寻路技术领域,尤其涉及一种基于椭圆模型人工势场法的智能车寻路方法。The invention relates to the technical field of automatic pathfinding, in particular to an intelligent vehicle pathfinding method based on an ellipse model artificial potential field method.

背景技术Background technique

智能车是通过车载传感器感知道路环境,自动规划行车路线并控制车辆到达预定目标的智能汽车。集自动控制、体系结构、人工智能、视觉计算等众多技术于一体,是计算机科学、模式识别和智能控制技术高度发展的产物,也是衡量一个国家科研实力和工业水平的一个重要标志,在国防和国民经济领域有着广阔的应用前景。近年来,移动机器人以及各种无人飞行器在各行各业广泛发展应用起来,成为又一个研究热点,路径规划技术是机器人相关研究中最基本、最重要的技术之一。路径规划是指机器人根据一些特定的指标(如花费时间最少、行走路径最短等),在其工作空间中搜索一条从起点到终点的避障路径。路径规划研究始于20世纪70年代,此后各机器人研发大国对其的研究从没有间断,至今已经是成果斐然。目前,常用的路径规划的方法分为传统算法和智能仿生算法。其中,传统的人工势场法因为计算简单方便而被广泛使用。A smart car is a smart car that senses the road environment through on-board sensors, automatically plans a driving route, and controls the vehicle to reach a predetermined target. Integrating many technologies such as automatic control, architecture, artificial intelligence, and visual computing, it is a product of the highly developed computer science, pattern recognition, and intelligent control technologies. It is also an important symbol to measure a country's scientific research strength and industrial level. The field of national economy has broad application prospects. In recent years, mobile robots and various unmanned aerial vehicles have been widely developed and applied in various industries, and have become another research hotspot. Path planning technology is one of the most basic and important technologies in robot-related research. Path planning means that the robot searches for an obstacle-avoiding path from the starting point to the end point in its workspace according to some specific indicators (such as the least time spent, the shortest walking path, etc.). The research on path planning began in the 1970s. Since then, the research on it by major robot research and development countries has never stopped, and it has achieved remarkable results so far. At present, the commonly used path planning methods are divided into traditional algorithms and intelligent bionic algorithms. Among them, the traditional artificial potential field method is widely used because of its simple and convenient calculation.

传统人工势场法是假设目标点对智能车产生引力,障碍物对智能车产生斥力,从而使智能车沿着势力下降的方向行走,就像是水往低处流。该算法的优点就是结构简单,有利于底层控制的实时性,可大大减少计算量和计算时间,并且生成相对光滑的路径,利于保持自动驾驶车辆的稳定性。该算法存在的问题也很明显,一是目标不可达的问题,若智能车与目标点的距离很远,引力将变得极大,斥力与之相比则较小,甚至可以忽略,此时智能车在前进的路径是上很有可能与障碍物相碰撞导致智能车的寻路失败,在目标点附近有大型障碍物时,智能车在靠近目标时会受到障碍物极大的斥力作用,导致无法到达终点。二是局部最小值问题,零势能域问题是人工势场法的瓶颈问题,产生零势能点的原因是智能车在工作区域存在多个障碍物点,且位置分布比较特殊,可能会在工作区域的某个点出现引力和斥力刚好大小相等,方向相反,智能车的受力为零,智能车就会在该点附近来回摆动无法到达目的地,严重影响智能车的运行效率。Lee,J等人通过使用任意力算法来建立新的人工势场法函数来控制移动机器人的避障规划,同时解决了机器人、障碍物、目标点对称排序的问题。Li.Chunshu等人提出一种带记忆功能的“延边走”方法,该方法通过沿着障碍物的边缘行走跳出人工势场法的局部最小点,并记录和分析机器人走过的局部最小点来判断目标点是否被障碍物包围,以免机器人一直来回振荡或者位置目标点转圈。这些方法虽然在一定程度上解决了人工势场法存在的缺点,但是智能车在所处环境较为复杂的情况下往往无法取得很好的避障效果,不能得到最优路径,或者路径曲线曲折。The traditional artificial potential field method assumes that the target point generates gravitational force on the smart car, and obstacles generate repulsive force on the smart car, so that the smart car walks in the direction of declining force, just like water flowing down. The advantage of this algorithm is that its structure is simple, which is conducive to the real-time performance of the underlying control, which can greatly reduce the amount of calculation and calculation time, and generate a relatively smooth path, which is conducive to maintaining the stability of the automatic driving vehicle. The problems of this algorithm are also obvious. One is the problem that the target is not reachable. If the distance between the smart car and the target point is very far, the gravitational force will become extremely large, while the repulsive force will be smaller or even negligible. The smart car is likely to collide with obstacles on the way forward, causing the smart car to fail to find its way. When there is a large obstacle near the target point, the smart car will be greatly repulsed by the obstacle when it approaches the target. resulting in failure to reach the end point. The second is the local minimum problem. The zero potential energy domain problem is the bottleneck problem of the artificial potential field method. The reason for the zero potential energy point is that there are many obstacle points in the working area of the smart car, and the location distribution is relatively special, which may be in the working area. At a certain point, the attractive force and the repulsive force are just equal in size and opposite in direction, and the force on the smart car is zero, and the smart car will swing back and forth near this point and cannot reach the destination, which seriously affects the operating efficiency of the smart car. Lee, J et al. used the arbitrary force algorithm to establish a new artificial potential field function to control the obstacle avoidance planning of mobile robots, and at the same time solved the problem of symmetrical ordering of robots, obstacles, and target points. Li.Chunshu et al. proposed a method of "walking along the edge" with a memory function. This method jumps out of the local minimum point of the artificial potential field method by walking along the edge of the obstacle, and records and analyzes the local minimum point that the robot walks. Determine whether the target point is surrounded by obstacles, so as to prevent the robot from oscillating back and forth or turning the target point in circles. Although these methods solve the shortcomings of the artificial potential field method to a certain extent, the smart car often cannot achieve a good obstacle avoidance effect in a complex environment, cannot obtain the optimal path, or the path curve is tortuous.

本发明在传统人工势场的基础上,通过改进斥力函数和建立椭圆模型设置虚拟目标点来解决势场法在规划路径过程中可能遇到的无法到达目标点和陷入局部最小值的问题。Based on the traditional artificial potential field, the present invention solves the problems that the potential field method cannot reach the target point and falls into a local minimum in the process of path planning by improving the repulsion function and establishing an ellipse model to set a virtual target point.

发明内容Contents of the invention

本发明的目的是为了解决现有技术中的问题,而提出的一种基于椭圆模型人工势场法的智能车寻路方法。The purpose of the present invention is to solve the problems in the prior art, and propose a smart car path-finding method based on the ellipse model artificial potential field method.

为了实现上述目的,本发明采用了如下技术方案:一种基于椭圆模型人工势场法的智能车寻路方法,包括以下步骤:In order to achieve the above object, the present invention adopts following technical scheme: a kind of intelligent vehicle pathfinding method based on ellipse model artificial potential field method, comprises the following steps:

步骤1、根据智能车所在的区域构建相应的地图,将地图网格化并建立坐标系,确定地图中存在障碍物位置的坐标和目标点位置;Step 1. Construct the corresponding map according to the area where the smart car is located, grid the map and establish a coordinate system, and determine the coordinates of the obstacle position and the position of the target point in the map;

步骤2、判断智能车当前是否到达终点位置;Step 2. Determine whether the smart car has reached the end point;

步骤3、若到达终点位置,则完成路径规划,生成最终路径;若未到达终点位置,则用人工势场法进行路径规划;Step 3. If the end point is reached, path planning is completed to generate the final path; if the end point is not reached, path planning is performed using the artificial potential field method;

步骤4、计算智能车当前位置所受到的引力、斥力及合力大小及方向;Step 4. Calculate the magnitude and direction of the gravitational force, repulsive force, and resultant force on the current position of the smart car;

步骤5、判断是否陷入局部极小值问题;Step 5, judging whether to fall into the local minimum problem;

步骤6、若未陷入局部最小值,则返回步骤2继续进行判断和路径规划,若陷入局部最小值问题,则根据局部最小值问题点构建椭圆模型,增设虚拟目标点,增大终点位置方向对智能车的吸引力,从而跳出局部最小值问题;Step 6. If you are not stuck in the local minimum, return to step 2 to continue the judgment and path planning. If you fall into the local minimum problem, build an ellipse model based on the local minimum problem point, add a virtual target point, and increase the direction of the end position. The attractiveness of smart cars, thus jumping out of the local minimum problem;

步骤7、再次使用椭圆模型人工势场法进行计算,直到行驶到终点位置;Step 7, use the ellipse model artificial potential field method to calculate again until the end point is reached;

步骤8、对规划后的路径在进行二次优化,从起点开始依次向后检测路径节点,判断是否能够直线到达,若能直线到达,则删除起点到该节点的路径;若不能直线到达,则将该节点位置当做起点位置继续做能否直线到达的判断,从而简化路径。Step 8. Perform secondary optimization on the planned path, check the path nodes backwards from the starting point, and judge whether it can be reached in a straight line. If it can be reached in a straight line, delete the path from the starting point to the node; if it cannot be reached in a straight line, then Take the node position as the starting point and continue to judge whether it can be reached in a straight line, thereby simplifying the path.

在上述的基于椭圆模型人工势场法的智能车寻路方法中,采用人工势场法,避免智能车在运动过程中出现目标不可达现象,在含有障碍物的工作环境中为所述智能车规划出一条从起始点到目标点的安全路径,并判断智能车是否陷入局部最小值问题,包括:In the above-mentioned smart car path-finding method based on the artificial potential field method of the ellipse model, the artificial potential field method is used to avoid the phenomenon that the smart car is inaccessible to the target during the movement process. Plan a safe path from the starting point to the target point, and judge whether the smart car is stuck in a local minimum problem, including:

以地图建立X-O-Y坐标系,假设机器人陷入局部平衡的坐标为Pmin(xmin,ymin),终点位置坐标为Pgoal(xgoal,ygoal),则这两点的中点坐标位置Pb为:Establish the XOY coordinate system with the map, assuming that the coordinate of the robot falling into local equilibrium is P min (x min , y min ), and the coordinate of the end point is P goal (x goal , y goal ), then the coordinate position of the midpoint of these two points is P b for:

以Pmin和Pgoal两点的连线作为新轴X’,以Pb为原点,建立过原点垂直于X’的轴Y’,新的坐标系是由原坐标系经过旋转平移得到,如下式:Take the connection between P min and P goal as the new axis X', take P b as the origin, and establish the axis Y' perpendicular to X' through the origin. The new coordinate system is obtained by rotating and translating the original coordinate system, as follows Mode:

其中是旋转矩阵,/>是平移矩阵;in is the rotation matrix, /> is the translation matrix;

在新坐标系下建立椭圆方程如下:The ellipse equation is established in the new coordinate system as follows:

焦距2c=|Pmin-Pgoal|,a=ψc,ψ是长轴因子,a2=b2+c2Focal length 2c=|P min -P goal |, a=ψc, ψ is the major axis factor, a 2 =b 2 +c 2 .

以椭圆与X’轴的正交点为初始的虚拟目标点,增大终点位置对智能车的吸引力,从而打破局部最小状态,智能车按此虚构目标点行走,若检测到再次陷入局部平衡时,则构建新的椭圆模型,寻找新的虚构目标点。Take the orthogonal point of the ellipse and the X' axis as the initial virtual target point to increase the attractiveness of the end position to the smart car, thus breaking the local minimum state. The smart car walks according to this virtual target point. If it detects that it falls into local equilibrium again When , a new ellipse model is constructed to find a new fictitious target point.

在上述的基于椭圆模型人工势场法的智能车寻路方法中,人工势场法的引力函数如下:In the above-mentioned smart car pathfinding method based on the ellipse model artificial potential field method, the gravitational function of the artificial potential field method is as follows:

式中Xg表示目标点的位置(xg,yg);λ1表示引力常数;ρ(X,Xg)是智能车当前位置和终点位置的几何距离;In the formula, X g represents the position of the target point (x g , y g ); λ 1 represents the gravitational constant; ρ(X, X g ) is the geometric distance between the current position of the smart car and the terminal position;

对引力势力函数中的距离求一阶导所得到的即为引力:The gravitational force is obtained by taking the first derivative of the distance in the gravitational force function:

同理,斥力势函数如下:Similarly, the repulsion potential function is as follows:

式中X0=(x0,y0)表示障碍物位置;λ2表示斥力场常量;ρ0表示障碍物影响半径;ρ(X,X0)是智能车与障碍物之间的间距;In the formula, X 0 = (x 0 , y 0 ) represents the position of the obstacle; λ 2 represents the repulsion field constant; ρ 0 represents the radius of influence of the obstacle; ρ(X, X 0 ) is the distance between the smart car and the obstacle;

对斥力函数对距离求一阶导数即斥力:Find the first derivative of the repulsion function with respect to the distance, that is, repulsion:

所以智能车在空间中所受到的合力Ftotal(X)为:Therefore, the resultant force F total (X) received by the smart car in space is:

Ftotal(X)=Fatt(X)+Frep(X)F total (X)=F att (X)+F rep (X)

目标点位置无法抵达的问题是由于智能车在目标点周围的障碍物产生的斥力大于目标点的引力的原因;The problem that the target point cannot be reached is because the repulsion generated by the obstacles around the target point is greater than the gravitational force of the target point;

因此,在传统的斥力函数基础上,引入当前点到目标点之间的距离因子ρ(X,Xg),根据不同的情形降低斥力值的大小;改进的斥力函数如下所示:Therefore, based on the traditional repulsion function, the distance factor ρ(X,X g ) between the current point and the target point is introduced to reduce the repulsion value according to different situations; the improved repulsion function is as follows:

当智能车到终点位置之间的间距ρ(X,Xg)<1时,且障碍物离机器人较近时,和ρ(X,Xg)2均是小于1的数值,因此可以降低斥力值,防止在目标点周围因斥力过大引起目标点无法抵达现象。When the distance between the smart car and the end position ρ(X,X g )<1, and the obstacle is close to the robot, and ρ(X,X g ) 2 are both values less than 1, so the repulsion value can be reduced to prevent the phenomenon that the target point cannot be reached due to excessive repulsion around the target point.

在上述的基于椭圆模型人工势场法的智能车寻路方法中,在步骤3中,人工势场法算法改进其斥力函数,根据智能车当前位置到目标点之间的距离因子ρ(X,Xg),设置三种不同的情况,智能车的位置出现在障碍物影响半径值的一半以内时,智能车已经十分靠近障碍物,考虑到安全避障的因素,不能够将斥力削减的过多,此处取距离因子的开平方系数,另一方面,机器人的位置在障碍物影响半径值的一半位置到最大值之间时,智能车刚开始接近障碍物,为了防止引力小于斥力从而无法接近目标点,当距离因子大于障碍物影响半径时,智能车不受影响。In the above-mentioned smart car path-finding method based on the artificial potential field method of the ellipse model, in step 3, the artificial potential field method algorithm improves its repulsion function, and according to the distance factor ρ(X, X g ), set three different situations, when the position of the smart car appears within half of the radius value of the obstacle, the smart car is already very close to the obstacle, considering the factors of safe obstacle avoidance, the repulsion force cannot be reduced Many, the square root coefficient of the distance factor is taken here. On the other hand, when the position of the robot is between half of the obstacle’s influence radius and the maximum value, the smart car just starts to approach the obstacle. In order to prevent the attractive force from being smaller than the repulsive force, it cannot When approaching the target point, when the distance factor is greater than the obstacle influence radius, the smart car will not be affected.

在上述的基于椭圆模型人工势场法的智能车寻路方法中,在步骤6中,以局部极小值点位置和目标点位置构建椭圆模型,以指向目标点的方向为正方向建立X’轴,在其两点的中点位置作垂直于X’轴的Y’轴,从而建立新的坐标系X’-O-Y’,设置虚拟目标点为X’轴正方向与椭圆模型的交点,从而增加目标点对智能车在引力方向上的力,从而打破局部极小值状态,跳出局部平衡。In the above-mentioned smart car pathfinding method based on the artificial potential field method of the ellipse model, in step 6, the ellipse model is constructed with the local minimum point position and the target point position, and X' is established with the direction pointing to the target point as the positive direction axis, at the midpoint of the two points, make the Y' axis perpendicular to the X' axis, so as to establish a new coordinate system X'-O-Y', and set the virtual target point as the intersection point of the positive direction of the X' axis and the ellipse model , so as to increase the force of the target point on the smart car in the gravitational direction, thereby breaking the local minimum state and jumping out of the local equilibrium.

与现有的技术相比,本发明的优点在于:Compared with the prior art, the present invention has the advantages of:

1、在庞杂环境中,采用椭圆模型增设虚拟目标点,虚构目标点产生的引力将改变机器人在局部最小值的状态,通过在椭圆模型上不断修正虚构目标点的位置,从而使智能车跳出局部平衡区域,同时大大降低了算法的时间成本;1. In a complex environment, use the ellipse model to add a virtual target point. The gravitational force generated by the virtual target point will change the state of the robot at the local minimum. By continuously correcting the position of the virtual target point on the ellipse model, the smart car will jump out of the local area. Balance the area while greatly reducing the time cost of the algorithm;

2、根据智能车当前位置与终点位置之间的距离,并根据设置距离影响因子设置三种不同的情况,更好的保证了智能车规划路径的安全性。2. According to the distance between the current position of the smart car and the end position, and according to the setting distance influencing factors, three different situations are set to better ensure the safety of the planned route of the smart car.

附图说明Description of drawings

图1为本发明提出的一种基于椭圆模型人工势场法的智能车寻路方法中人工势场法的基本原理图;Fig. 1 is the basic principle diagram of the artificial potential field method in a kind of intelligent vehicle pathfinding method based on the ellipse model artificial potential field method that the present invention proposes;

图2为本发明提出的一种基于椭圆模型人工势场法的智能车寻路方法中椭圆模型建立虚拟目标点的方法图;Fig. 2 is the method figure that ellipse model establishes virtual target point in a kind of intelligent vehicle pathfinding method based on ellipse model artificial potential field method that the present invention proposes;

图3为本发明提出的一种基于椭圆模型人工势场法的智能车寻路方法中椭圆模型人工势场法的具体流程图;Fig. 3 is the concrete flow chart of ellipse model artificial potential field method in a kind of intelligent car pathfinding method based on ellipse model artificial potential field method that the present invention proposes;

图4为本发明提出的一种基于椭圆模型人工势场法的智能车寻路方法中椭圆模型人工势场法规划路径的效果图。Fig. 4 is an effect diagram of planning a path by the ellipse model artificial potential field method in a smart vehicle pathfinding method based on the ellipse model artificial potential field method proposed by the present invention.

具体实施方式Detailed ways

以下实施例仅处于说明性目的,而不是想要限制本发明的范围。The following examples are for illustrative purposes only and are not intended to limit the scope of the invention.

实施例Example

参照图1-4,一种基于椭圆模型人工势场法的智能车寻路方法,包括以下步骤:Referring to Fig. 1-4, a smart car pathfinding method based on the ellipse model artificial potential field method includes the following steps:

步骤1、根据智能车所在的区域构建相应的地图,将地图网格化并建立坐标系,确定地图中存在障碍物位置的坐标和目标点位置;Step 1. Construct the corresponding map according to the area where the smart car is located, grid the map and establish a coordinate system, and determine the coordinates of the obstacle position and the position of the target point in the map;

步骤2、判断智能车当前是否到达终点位置;Step 2. Determine whether the smart car has reached the end point;

步骤3、若到达终点位置,则完成路径规划,生成最终路径;若未到达终点位置,则用人工势场法进行路径规划;Step 3. If the end point is reached, path planning is completed to generate the final path; if the end point is not reached, path planning is performed using the artificial potential field method;

步骤4、计算智能车当前位置所受到的引力、斥力及合力大小及方向;Step 4. Calculate the magnitude and direction of the gravitational force, repulsive force, and resultant force on the current position of the smart car;

步骤5、判断是否陷入局部极小值问题;Step 5, judging whether to fall into the local minimum problem;

步骤6、若未陷入局部最小值,则返回步骤2继续进行判断和路径规划,若陷入局部最小值问题,则根据局部最小值问题点构建椭圆模型,增设虚拟目标点,增大终点位置方向对智能车的吸引力,从而跳出局部最小值问题;Step 6. If you are not stuck in the local minimum, return to step 2 to continue the judgment and path planning. If you fall into the local minimum problem, build an ellipse model based on the local minimum problem point, add a virtual target point, and increase the direction of the end position. The attractiveness of smart cars, thus jumping out of the local minimum problem;

步骤7、再次使用椭圆模型人工势场法进行计算,直到行驶到终点位置;Step 7, use the ellipse model artificial potential field method to calculate again until the end point is reached;

步骤8、对规划后的路径在进行二次优化,从起点开始依次向后检测路径节点,判断是否能够直线到达,若能直线到达,则删除起点到该节点的路径;若不能直线到达,则将该节点位置当做起点位置继续做能否直线到达的判断,从而简化路径。Step 8. Perform secondary optimization on the planned path, check the path nodes backwards from the starting point, and judge whether it can be reached in a straight line. If it can be reached in a straight line, delete the path from the starting point to the node; if it cannot be reached in a straight line, then Take the node position as the starting point and continue to judge whether it can be reached in a straight line, thereby simplifying the path.

采用人工势场法,避免智能车在运动过程中出现目标不可达现象,在含有障碍物的工作环境中为所述智能车规划出一条从起始点到目标点的安全路径,并判断智能车是否陷入局部极小点,包括:The artificial potential field method is used to avoid the phenomenon that the target is unreachable during the movement of the smart car, and a safe path from the starting point to the target point is planned for the smart car in a working environment containing obstacles, and it is judged whether the smart car is Stuck in local minima, including:

以地图建立X-O-Y坐标系,假设机器人陷入局部平衡的坐标为Pmin(xmin,ymin),终点位置坐标为Pgoal(xgoal,ygoal),则这两点的中点坐标位置Pb为:Establish the XOY coordinate system with the map, assuming that the coordinate of the robot falling into local equilibrium is P min (x min , y min ), and the coordinate of the end point is P goal (x goal , y goal ), then the coordinate position of the midpoint of these two points is P b for:

以Pmin和Pgoal两点的连线作为新轴X’,以Pb为原点,建立过原点垂直于X’的轴Y’,新的坐标系是由原坐标系经过旋转平移得到,如下式:Take the connection between P min and P goal as the new axis X', take P b as the origin, and establish the axis Y' perpendicular to X' through the origin. The new coordinate system is obtained by rotating and translating the original coordinate system, as follows Mode:

其中是旋转矩阵,/>是平移矩阵;in is the rotation matrix, /> is the translation matrix;

在新坐标系下建立椭圆方程如下:The ellipse equation is established in the new coordinate system as follows:

焦距2c=|Pmin-Pgoal|,a=ψc,ψ是长轴因子,a2=b2+c2Focal length 2c=|P min -P goal |, a=ψc, ψ is the major axis factor, a 2 =b 2 +c 2 ;

以椭圆与X’轴的正交点为初始的虚拟目标点,增大终点位置对智能车的吸引力,从而打破局部最小状态,智能车按此虚构目标点行走,若检测到再次陷入局部平衡时,则构建新的椭圆模型,寻找新的虚构目标点。Take the orthogonal point of the ellipse and the X' axis as the initial virtual target point to increase the attractiveness of the end position to the smart car, thus breaking the local minimum state. The smart car walks according to this virtual target point. If it detects that it falls into local equilibrium again When , a new ellipse model is constructed to find a new fictitious target point.

人工势场法的引力函数如下:The gravitational function of the artificial potential field method is as follows:

式中Xg表示目标点的位置(xg,yg);λ1表示引力常数;ρ(X,Xg)是智能车当前位置和终点位置的几何距离;In the formula, X g represents the position of the target point (x g , y g ); λ 1 represents the gravitational constant; ρ(X, X g ) is the geometric distance between the current position of the smart car and the terminal position;

对引力势力函数中的距离求一阶导所得到的即为引力:The gravitational force is obtained by taking the first derivative of the distance in the gravitational force function:

同理,斥力势函数如下:Similarly, the repulsion potential function is as follows:

式中X0=(x0,y0)表示障碍物位置;λ2表示斥力场常量;ρ0表示障碍物影响半径;ρ(X,X0)是智能车与障碍物之间的间距;In the formula, X 0 = (x 0 , y 0 ) represents the position of the obstacle; λ 2 represents the repulsion field constant; ρ 0 represents the radius of influence of the obstacle; ρ(X, X 0 ) is the distance between the smart car and the obstacle;

对斥力函数对距离求一阶导数即斥力:Find the first derivative of the repulsion function with respect to the distance, that is, repulsion:

所以智能车在空间中所受到的合力Ftotal(X)为:Therefore, the resultant force F total (X) received by the smart car in space is:

Ftotal(X)=Fatt(X)+Frep(X)F total (X)=F att (X)+F rep (X)

目标点位置无法抵达的问题是由于智能车在目标点周围的障碍物产生的斥力大于目标点的引力的原因;The problem that the target point cannot be reached is because the repulsion generated by the obstacles around the target point is greater than the gravitational force of the target point;

因此,在传统的斥力函数基础上,引入当前点到目标点之间的距离因子ρ(X,Xg),根据不同的情形降低斥力值的大小;改进的斥力函数如下所示:Therefore, based on the traditional repulsion function, the distance factor ρ(X,X g ) between the current point and the target point is introduced to reduce the repulsion value according to different situations; the improved repulsion function is as follows:

当智能车到终点位置之间的间距ρ(X,Xg)<1时,且障碍物离机器人较近时,和ρ(X,Xg)2均是小于1的数值,因此可以降低斥力值,防止在目标点周围因斥力过大引起目标点无法抵达现象。When the distance between the smart car and the end position ρ(X,X g )<1, and the obstacle is close to the robot, and ρ(X,X g ) 2 are both values less than 1, so the repulsion value can be reduced to prevent the phenomenon that the target point cannot be reached due to excessive repulsion around the target point.

一方面,机器人的位置出现在障碍物影响半径值的一半以内时,智能车已经十分靠近障碍物,考虑到安全避障的因素,不能够将斥力削减的过多,此处取距离因子的开平方系数。另一方面,机器人的位置在障碍物影响半径值的一半位置到最大值之间时,智能车刚开始接近障碍物,为了防止引力小于斥力从而无法接近目标点,应该尽可能的减小斥力的大小,故此处取距离因子的平方系数。On the one hand, when the position of the robot appears within half of the radius value of the obstacle, the smart car is already very close to the obstacle. Considering the factor of safe obstacle avoidance, the repulsive force cannot be reduced too much. Here, the distance factor is used square factor. On the other hand, when the position of the robot is between the half position and the maximum value of the influence radius value of the obstacle, the smart car just starts to approach the obstacle. In order to prevent the attractive force from being smaller than the repulsive force and thus unable to approach the target point, the repulsive force should be reduced as much as possible. size, so the square coefficient of the distance factor is taken here.

在较为复杂的环境中,有可能出现智能车在未抵达目标点位置时,智能车所受到的引力和斥力的大小一样,方向相反,合力为零的情况,这将导致智能车在目前位置来回的振荡。In a more complex environment, it is possible that when the smart car does not reach the target point, the gravity and repulsion force on the smart car are the same in size and opposite in direction, and the resultant force is zero, which will cause the smart car to go back and forth at the current position. oscillation.

本发明提出了建立椭圆模型来设置虚拟目标点的方法,虚构目标点产生的引力将改变机器人在局部最小值的状态,通过在椭圆模型上不断修正虚构目标点的位置,从而使智能车跳出局部平衡区域。The present invention proposes a method of establishing an ellipse model to set a virtual target point. The gravitational force generated by the virtual target point will change the state of the robot at the local minimum. By continuously correcting the position of the virtual target point on the ellipse model, the smart car will jump out of the local area. balance area.

在步骤3中,人工势场法算法改进其斥力函数,根据智能车当前位置到目标点之间的距离因子ρ(X,Xg),设置三种不同的情况,智能车的位置出现在障碍物影响半径值的一半以内时,智能车已经十分靠近障碍物,考虑到安全避障的因素,不能够将斥力削减的过多,此处取距离因子的开平方系数,另一方面,机器人的位置在障碍物影响半径值的一半位置到最大值之间时,智能车刚开始接近障碍物,为了防止引力小于斥力从而无法接近目标点,当距离因子大于障碍物影响半径时,智能车不受影响。In step 3, the artificial potential field method algorithm improves its repulsion function. According to the distance factor ρ(X,X g ) between the current position of the smart car and the target point, three different situations are set. The position of the smart car appears in the obstacle When the object influence radius is within half of the value, the smart car is already very close to the obstacle. Considering the factor of safe obstacle avoidance, the repulsive force cannot be reduced too much. Here, the square root coefficient of the distance factor is taken. On the other hand, the robot’s When the position is between the half position and the maximum value of the influence radius value of the obstacle, the smart car starts to approach the obstacle. In order to prevent the attractive force from being smaller than the repulsive force and thus unable to approach the target point, when the distance factor is greater than the obstacle influence radius, the smart car will not be affected. Influence.

在步骤6中,以局部极小值点位置和目标点位置构建椭圆模型,以指向目标点的方向为正方向建立X’轴,在其两点的中点位置作垂直于X’轴的Y’轴,从而建立新的坐标系X’-O-Y’,设置虚拟目标点为X’轴正方向与椭圆模型的交点,从而增加目标点对智能车在引力方向上的力,从而打破局部极小值状态,跳出局部平衡。In step 6, the ellipse model is constructed with the position of the local minimum point and the target point, the X' axis is established with the direction pointing to the target point as the positive direction, and the Y perpendicular to the X' axis is drawn at the midpoint of the two points 'axis, so as to establish a new coordinate system X'-O-Y', set the virtual target point as the intersection point of the positive direction of the X' axis and the ellipse model, so as to increase the force of the target point on the smart car in the gravitational direction, thus breaking the local The state of minimum value jumps out of local equilibrium.

Claims (5)

1. An intelligent vehicle road finding method based on an elliptic model artificial potential field method is characterized by comprising the following steps of:
step 1, constructing a corresponding map according to an area where an intelligent vehicle is located, gridding the map, establishing a coordinate system, and determining coordinates of the position of an obstacle and the position of a target point in the map;
step 2, judging whether the intelligent vehicle reaches the end position currently;
step 3, if the final position is reached, path planning is completed, and a final path is generated; if the terminal position is not reached, path planning is carried out by using an artificial potential field method;
step 4, calculating the magnitude and direction of attractive force, repulsive force and resultant force of the current position of the intelligent vehicle;
step 5, judging whether the problem of local minimum value is solved;
step 6, if the local minimum is not trapped, returning to the step 2 to continue judging and path planning, if the local minimum is trapped, constructing an elliptical model according to the problem point of the local minimum, adding a virtual target point, and increasing the attractive force of the end position direction to the intelligent vehicle so as to jump out the problem of the local minimum;
step 7, calculating again by using an elliptic model artificial potential field method until the vehicle runs to the end position;
step 8, carrying out secondary optimization on the planned path, sequentially detecting path nodes backwards from the starting point, judging whether the path nodes can reach straight lines, and deleting the path from the starting point to the nodes if the path nodes can reach straight lines; if the straight line can not be reached, the node position is used as the starting point position to continuously judge whether the straight line can be reached, so that the path is simplified.
2. The intelligent vehicle road-finding method based on the elliptical model artificial potential field method of claim 1, wherein the artificial potential field method is adopted to avoid the phenomenon that the intelligent vehicle cannot reach the target in the moving process, a safe path from a starting point to a target point is planned for the intelligent vehicle in a working environment containing obstacles, and whether the intelligent vehicle falls into a local minimum point is judged, and the method comprises the following steps:
an X-O-Y coordinate system is established by a map, and the coordinate of the robot sinking into local balance is assumed to be P min (x min ,y min ) The end position coordinate is P goal (x goal ,y goal ) The midpoint coordinate position P of the two points b The method comprises the following steps:
with P min And P goal The connection line of the two points is taken as a new axis X', and P b As an origin, an axis Y 'which passes through the origin and is perpendicular to X' is established, and a new coordinate system is obtained by rotating and translating an original coordinate system, wherein the formula is as follows:
wherein the method comprises the steps ofIs a rotation matrix +.>Is a translation matrix;
the ellipse equation is established under the new coordinate system as follows:
focal length 2c= |p min -P goal I, a=ψc, ψ is the long axis factor, a 2 =b 2 +c 2
And taking the orthogonal point of the ellipse and the X' axis as an initial virtual target point, increasing the attraction of the end point position to the intelligent vehicle, breaking the local minimum state, enabling the intelligent vehicle to walk according to the virtual target point, and if the intelligent vehicle is detected to sink into local balance again, constructing a new ellipse model, and searching for a new virtual target point.
3. The intelligent vehicle road-finding method based on the elliptic model artificial potential field method according to claim 2, wherein the gravitation function of the artificial potential field method is as follows:
wherein X is g Representing the position (x g ,y g );λ 1 Representing the gravitational constant; ρ (X, X) g ) The geometric distance between the current position and the final position of the intelligent vehicle;
the first order derivative of the distance in the gravitational potential function is the gravitational force:
similarly, the repulsive potential function is as follows:
wherein X is 0 =(x 0 ,y 0 ) Representing the obstacle position; lambda (lambda) 2 Representing a repulsive force field constant; ρ 0 Representing the obstacle influencing radius; ρ (X, X) 0 ) Is the distance between the intelligent vehicle and the obstacle;
the repulsive force function is used for solving the first derivative of the distance, namely repulsive force:
so the resultant force F applied by the intelligent vehicle in space total (X) is:
F total (X)=F att (X)+F rep (X)
the problem that the position of the target point cannot be reached is that the repulsive force generated by the obstacle around the target point of the intelligent vehicle is larger than the attractive force of the target point;
therefore, based on the traditional repulsive force function, a distance factor rho (X, X g ) The repulsive force value is reduced according to different situations; the improved repulsive force function is shown below:
when the distance ρ (X, X) between the intelligent vehicle and the end position g ) When the obstacle is less than 1 and the obstacle is close to the robot,and ρ (X, X) g ) 2 The values are all smaller than 1, so that the repulsive force value can be reduced, and the phenomenon that the target point cannot be reached due to overlarge repulsive force around the target point is prevented.
4. The intelligent vehicle road-finding method based on the elliptic model artificial potential field method according to claim 1, wherein in step 3, the artificial potential field method algorithm improves the repulsive force function thereof according to the distance factor ρ (X, X g ) Setting up three kinds of different circumstances, when the position of intelligent car appears in the obstacle influences the half of radius value, the intelligent car has very near the obstacle, consider the factor of safe obstacle avoidance, can not cut down the repulsion too much, get the square coefficient of opening of distance factor here, on the other hand, the position of robot is in the obstacle when influencing the half position of radius value to the maximum value, the intelligent car just begins to be close to the obstacle, thereby in order to prevent that gravitation is less than repulsion and can't be close to the target point, when distance factor is greater than the obstacle and influences the radius, the intelligent car is not influenced.
5. The intelligent vehicle road-finding method based on the elliptic model artificial potential field method according to claim 1, wherein in step 6, an elliptic model is constructed by taking the position of a local minimum point and the position of a target point, an X 'axis is established by taking the direction pointing to the target point as a positive direction, a Y' axis perpendicular to the X 'axis is established at the midpoint position of the two points, thereby establishing a new coordinate system X' -O-Y ', setting a virtual target point as the intersection point of the positive direction of the X' axis and the elliptic model, thereby increasing the force of the target point on the intelligent vehicle in the attractive force direction, thereby breaking the local minimum state and jumping out of local balance.
CN202111388075.8A 2021-11-22 2021-11-22 A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method Active CN114077255B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111388075.8A CN114077255B (en) 2021-11-22 2021-11-22 A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111388075.8A CN114077255B (en) 2021-11-22 2021-11-22 A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method

Publications (2)

Publication Number Publication Date
CN114077255A CN114077255A (en) 2022-02-22
CN114077255B true CN114077255B (en) 2023-07-18

Family

ID=80284215

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111388075.8A Active CN114077255B (en) 2021-11-22 2021-11-22 A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method

Country Status (1)

Country Link
CN (1) CN114077255B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114924559A (en) * 2022-04-08 2022-08-19 南京航空航天大学 Intelligent vehicle path planning method for controlling virtual force direction
CN115562291B (en) * 2022-10-19 2023-12-12 哈尔滨理工大学 Path planning method to improve dynamic coefficient of potential field based on artificial potential field method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113359762A (en) * 2021-07-02 2021-09-07 哈尔滨理工大学 Dynamic planning method for unmanned surface vehicle

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017039720A1 (en) * 2015-09-03 2017-03-09 3M Innovative Properties Company Beam expander with a curved reflective polarizer
CN106843235B (en) * 2017-03-31 2019-04-12 深圳市靖洲科技有限公司 A kind of Artificial Potential Field path planning towards no person bicycle
CN107608346A (en) * 2017-08-30 2018-01-19 武汉理工大学 Ship intelligent barrier avoiding method and system based on Artificial Potential Field
CN110244713B (en) * 2019-05-22 2023-05-12 江苏大学 Intelligent vehicle lane change track planning system and method based on artificial potential field method
CN110567478B (en) * 2019-09-30 2023-06-30 广西科技大学 A Path Planning Method for Unmanned Vehicles Based on Artificial Potential Field Method
CN110703767A (en) * 2019-11-08 2020-01-17 江苏理工学院 Unmanned vehicle obstacle avoidance path planning method based on improved intelligent water drop algorithm
CN111546343B (en) * 2020-05-13 2021-08-03 浙江工业大学 A method and system for path planning of fire-fighting mobile robot based on improved artificial potential field method
CN111844007B (en) * 2020-06-02 2023-04-28 江苏理工学院 Obstacle avoidance path planning method and device for pollination robot manipulator

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113359762A (en) * 2021-07-02 2021-09-07 哈尔滨理工大学 Dynamic planning method for unmanned surface vehicle

Also Published As

Publication number Publication date
CN114077255A (en) 2022-02-22

Similar Documents

Publication Publication Date Title
CN111811514B (en) Path planning method based on regular hexagon grid jump point search algorithm
WO2018176594A1 (en) Artificial potential field path planning method for unmanned bicycle
CN111780777A (en) A Path Planning Method for Unmanned Vehicles Based on Improved A* Algorithm and Deep Reinforcement Learning
CN105955262A (en) Mobile robot real-time layered path planning method based on grid map
CN114077255B (en) A Pathfinding Method for Intelligent Vehicles Based on Ellipse Model Artificial Potential Field Method
CN111289005A (en) Path finding method based on A star optimization algorithm
CN114675649A (en) Indoor mobile robot path planning method fusing improved A and DWA algorithm
CN112947415B (en) Indoor path planning method based on meaning information of barrier
CN113485367B (en) A path planning method for multifunctional stage mobile robots
CN110231824A (en) Path Planning Method for Agent Based on Straight-line Deviation Method
CN113204236A (en) Intelligent agent path tracking control method
CN114964267B (en) Path planning method of unmanned tractor in multi-task point environment
CN114510057A (en) A ROS-based autonomous navigation method for mobile robots in indoor environments
WO2022142893A1 (en) Path planning method and apparatus for biped robot, and biped robot
CN113805597B (en) Obstacle self-protection artificial potential field method local path planning method based on particle swarm optimization
CN114815853B (en) A path planning method and system considering road obstacle characteristics
CN110045738A (en) Robot path planning method based on ant group algorithm and Maklink figure
CN114428499A (en) Astar and DWA algorithm fused mobile trolley path planning method
CN117451068A (en) A hybrid path planning method based on improved A* algorithm and dynamic window method
CN115167398A (en) Unmanned ship path planning method based on improved A star algorithm
CN118583184A (en) Agent hierarchical path planning method and system considering dynamic obstacles in complex environments
CN116878515A (en) Local navigation method in dynamic environment facing multiple pedestrians
CN118424259A (en) ROS robot path planning method and device based on improved dynamic window method
CN111998858A (en) A UAV Route Planning Method Based on Improved A* Algorithm
CN115564140A (en) Method and device for global and local path hierarchical planning of unstructured roads in mining area

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant