CN115097857A - Real-time trajectory planning method considering the shape of rotor UAV in complex environment - Google Patents
Real-time trajectory planning method considering the shape of rotor UAV in complex environment Download PDFInfo
- Publication number
- CN115097857A CN115097857A CN202210842336.7A CN202210842336A CN115097857A CN 115097857 A CN115097857 A CN 115097857A CN 202210842336 A CN202210842336 A CN 202210842336A CN 115097857 A CN115097857 A CN 115097857A
- Authority
- CN
- China
- Prior art keywords
- aerial vehicle
- unmanned aerial
- node
- real
- map
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 42
- 238000005457 optimization Methods 0.000 claims abstract description 21
- 238000001514 detection method Methods 0.000 claims abstract description 7
- 238000011478 gradient descent method Methods 0.000 claims abstract description 4
- 230000004888 barrier function Effects 0.000 claims abstract 4
- 238000005315 distribution function Methods 0.000 claims abstract 2
- 230000033001 locomotion Effects 0.000 claims description 24
- 230000001133 acceleration Effects 0.000 claims description 6
- 238000005070 sampling Methods 0.000 claims description 5
- 238000013519 translation Methods 0.000 claims description 5
- 230000007613 environmental effect Effects 0.000 claims description 4
- 238000007689 inspection Methods 0.000 claims description 2
- 206010048669 Terminal state Diseases 0.000 claims 1
- 239000002245 particle Substances 0.000 description 9
- 230000000694 effects Effects 0.000 description 5
- 238000013461 design Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 2
- 241000500881 Lepisma Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/08—Control of attitude, i.e. control of roll, pitch, or yaw
- G05D1/0808—Control of attitude, i.e. control of roll, pitch, or yaw specially adapted for aircraft
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/10—Simultaneous control of position or course in three dimensions
- G05D1/101—Simultaneous control of position or course in three dimensions specially adapted for aircraft
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine 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
Description
技术领域technical field
本发明涉及多旋翼无人机的轨迹规划领域,尤其涉及一种复杂环境下考虑旋翼无人机外形的实时轨迹规划方法。The invention relates to the field of trajectory planning of a multi-rotor unmanned aerial vehicle, in particular to a real-time trajectory planning method considering the shape of the rotor unmanned aerial vehicle in a complex environment.
背景技术Background technique
旋翼无人机实时自主轨迹规划算法是指在复杂环境中生成一条满足机器人动力学/运动学约束、光滑性约束、无碰撞约束的轨迹。该算法包括前端的路径规划算法和后端的轨迹优化算法。旋翼无人机的前端路径规划算法得到一条粗糙的可通行路径,其方法主要包括基于搜索的路径规划算法和基于采样的路径规划算法。基于搜索的路径规划算法以A*算法为代表,该算法结合Dijkstra算法与广度优先算法,通过借助启发式函数的作用更快搜索到最优路径。基于采样的路径规划算法以RRT*为主,该算法在空间中随机采样,将最近的采样点连接入路径树并考虑其是否有更好的父节点,直到终点附近的区域被探索到。前端路径规划算法为后端轨迹优化算法提供了优化的初值,使轨迹在满足约束条件的情况下快速收敛到最优解。目前的旋翼无人机轨迹规划算法为了节省计算资源,将无人机等效为质点,进行路径规划时只考虑x,y,z三轴的规划,未考虑无人机形状对轨迹的影响,若无人机真实体积庞大,则会导致搜索到的路径不可行的结果。The real-time autonomous trajectory planning algorithm of rotary-wing UAV refers to generating a trajectory that satisfies the robot dynamics/kinematics constraints, smoothness constraints, and collision-free constraints in a complex environment. The algorithm includes a front-end path planning algorithm and a back-end trajectory optimization algorithm. The front-end path planning algorithm of the rotor UAV obtains a rough passable path, and its methods mainly include the path planning algorithm based on search and the path planning algorithm based on sampling. The search-based path planning algorithm is represented by the A* algorithm, which combines the Dijkstra algorithm and the breadth-first algorithm to search for the optimal path faster by using the heuristic function. The sampling-based path planning algorithm is dominated by RRT*, which randomly samples in space, connects the nearest sampling points into the path tree and considers whether it has a better parent node, until the area near the end point is explored. The front-end path planning algorithm provides the optimal initial value for the back-end trajectory optimization algorithm, so that the trajectory can quickly converge to the optimal solution when the constraints are met. In order to save computing resources, the current rotor UAV trajectory planning algorithm treats the UAV as a mass point, and only considers the planning of the three axes of x, y, and z when planning the path, and does not consider the influence of the shape of the UAV on the trajectory. If the UAV is really large, it will lead to the result that the searched path is not feasible.
对于旋翼无人机的轨迹规划,近年来的研究主要围绕在无人机质点模型的轨迹规划,缺乏一种考虑旋翼无人机外形的易于实现且通用的轨迹规划方法。For the trajectory planning of the rotor UAV, the research in recent years mainly focuses on the trajectory planning of the particle model of the UAV, and there is a lack of an easy-to-implement and general trajectory planning method considering the shape of the rotor UAV.
现有技术中,将旋翼无人机外形使用凸多面体表示,使用飞行走廊表示安全性约束来避免与障碍物的碰撞,在规划时满足旋翼无人机的凸多面体一直包含在飞行走廊中,则轨迹定是无碰撞的。飞行走廊生成算法根据前端搜索到的路径,从第一个点开始沿着路径找到最远且不超限的无障碍点,根据它们之间的连线生成一个凸多面体,循环多次直到终点被包含在凸多面体中为止。该算法用于旋翼无人机竞速比赛,适用于机动性较强的小型旋翼无人机,若用于大型无人机,则存在以下两个问题:(1)前端路径规划算法未考虑无人机的实际形状,以质点模型规划的前端加入考虑无人机形状的后端优化可能导致无法求解;(2)后端在飞行走廊中进行优化时,必须保证飞机凸多面体的每一点都在同一个飞行走廊凸包内,但对于大型无人机这是难以保证的。并且该算法基于全局地图已知的情况,且对无人机凸多面体上每一个顶点进行规划十分消耗算力。In the prior art, the shape of the rotor UAV is represented by a convex polyhedron, and the flight corridor is used to represent the safety constraints to avoid collision with obstacles. When planning, the convex polyhedron of the rotor drone is always included in the flight corridor, then The trajectory must be collision-free. According to the path searched by the front end, the flight corridor generation algorithm finds the farthest unobstructed point along the path from the first point, generates a convex polyhedron according to the connection between them, and loops many times until the end point is contained in the convex polyhedron. The algorithm is used for rotor UAV racing competitions, and is suitable for small rotor UAVs with strong maneuverability. If it is used for large UAVs, there are the following two problems: (1) The front-end path planning algorithm does not consider the For the actual shape of the human-machine, adding the back-end optimization considering the shape of the drone to the front-end of the particle model planning may lead to inability to solve; (2) When the back-end is optimized in the flight corridor, it must be ensured that every point of the convex polyhedron of the aircraft is within the The same flight corridor convex hull, but this is difficult to guarantee for large UAVs. And the algorithm is based on the known situation of the global map, and the planning of each vertex on the UAV convex polyhedron is very computationally intensive.
因此,亟需提出一种针对大型旋翼无人机在狭窄复杂环境中的实时轨迹规划方法。Therefore, it is urgent to propose a real-time trajectory planning method for large rotary-wing UAVs in narrow and complex environments.
发明内容SUMMARY OF THE INVENTION
针对现有技术不足,本发明提出了一种复杂环境下考虑旋翼无人机外形的实时轨迹规划方法,本发明充分考虑了大型旋翼无人机的运动学/动力学特性,轨迹规划的前端和后端均加入了旋翼无人机的外形约束,进行有效且鲁棒的实时局部轨迹生成。In view of the deficiencies of the prior art, the present invention proposes a real-time trajectory planning method considering the shape of the rotor UAV in a complex environment. The shape constraints of the rotor UAV are added to the back end for effective and robust real-time local trajectory generation.
本发明的技术方案为:本发明实施例提供了一种复杂环境下考虑旋翼无人机外形的实时轨迹规划方法,所述方法包括以下步骤:The technical solution of the present invention is as follows: the embodiment of the present invention provides a real-time trajectory planning method considering the shape of a rotor UAV in a complex environment, and the method includes the following steps:
(1)采集无人机当前的局部地图信息和实时定位信息,建立占据概率栅格地图,并基于占据概率栅格地图构建ESDF地图;(1) Collect the current local map information and real-time positioning information of the UAV, establish an occupancy probability grid map, and build an ESDF map based on the occupancy probability grid map;
(2)通过考虑偏航角的前端路径规划算法,并将无人机外形抽象为若干球的组合,通过步骤(1)建立的ESDF地图检查所有球体的圆心与最近障碍物的距离是否小于球的半径来进行碰撞检测,得到符合无人机运动学约束且整机无碰撞的路径;(2) Through the front-end path planning algorithm considering the yaw angle, and abstracting the shape of the UAV as a combination of several spheres, check whether the distance between the center of the sphere and the nearest obstacle is less than the distance of the sphere through the ESDF map established in step (1). The radius of the UAV is used for collision detection, and the path that conforms to the kinematic constraints of the UAV and has no collision of the whole machine is obtained;
(3)在后端轨迹优化算法中将无人机外形抽象为若干球的组合,从ESDF地图中查询所有球心与障碍物的距离信息和远离障碍物的梯度方向信息,再利用梯度下降法优化步骤(2)得到的路径。(3) In the back-end trajectory optimization algorithm, the shape of the UAV is abstracted as a combination of several balls, and the distance information between the center of the ball and the obstacle and the gradient direction information away from the obstacle are queried from the ESDF map, and then the gradient descent method is used. Optimize the path obtained in step (2).
本发明的有益效果为:本发明主要设计了复杂环境下考虑大型旋翼无人机外形的实时轨迹规划方法,在基于无人机质点模型的轨迹规划算法上加以改进,不进行障碍物的膨胀,使算法能够保证在考虑大型旋翼无人机外形约束的条件下,能够快速地得到一条安全可行的轨迹。通过与基于质点模型的轨迹规划方法进行对比,可以看出若将无人机视为质点,并对障碍物进行膨胀的方法,很可能搜索到一条有碰撞的路径,而本发明在大致相同搜索时间的情况下,能够得到一条安全无碰的轨迹。本发明前端搜索的路径更贴合后端优化的结果,且在遇见障碍物是拐角的情况时,仍能得到一条无碰撞的轨迹。本发明提出通用的考虑大型旋翼无人机外形的实时轨迹规划方案,前后端都建立无人机机身安全性约束模型,在复杂环境下保证轨迹安全可行。本发明方法将旋翼无人机的几何外形解析地表达为凸几何体的组合形式。前端路径规划算法考虑偏航角yaw的规划并进行整机形状的碰撞检查。后端轨迹优化算法根据圆心与无人机质心的旋转平移关系,使用链式法则将圆心处梯度传导至轨迹点上。The beneficial effects of the present invention are as follows: the present invention mainly designs a real-time trajectory planning method considering the shape of a large-scale rotor UAV in a complex environment, improves the trajectory planning algorithm based on the particle model of the UAV, and does not perform expansion of obstacles, The algorithm can ensure that a safe and feasible trajectory can be quickly obtained under the condition of considering the shape constraints of the large rotor UAV. By comparing with the trajectory planning method based on the particle model, it can be seen that if the UAV is regarded as a particle and the obstacle is expanded, it is likely to search for a path with collision, and the present invention searches roughly the same In the case of time, a safe and collision-free trajectory can be obtained. The path searched by the front end of the present invention is more suitable for the result of the back end optimization, and a collision-free trajectory can still be obtained when the obstacle is a corner. The present invention proposes a general real-time trajectory planning scheme considering the shape of a large-scale rotary-wing UAV, and establishes a UAV fuselage safety constraint model at the front and rear ends, which is feasible to ensure the trajectory safety in a complex environment. The method of the invention analytically expresses the geometric shape of the rotor UAV as a combined form of convex geometric bodies. The front-end path planning algorithm considers the planning of the yaw angle yaw and performs the collision check of the whole machine shape. The back-end trajectory optimization algorithm uses the chain rule to transfer the gradient at the center of the circle to the trajectory points according to the rotation and translation relationship between the center of the circle and the center of mass of the drone.
附图说明Description of drawings
图1为大型旋翼无人机质点模型规划效果图;Figure 1 shows the planning effect of the particle model of the large rotor UAV;
图2为旋翼无人机几何形状的解析表达方法示意图;Fig. 2 is a schematic diagram of the analytical expression method of the geometric shape of the rotor UAV;
图3为前端路径规划效果图;Figure 3 is an effect diagram of front-end path planning;
图4为后端轨迹优化效果图。Figure 4 shows the effect of back-end trajectory optimization.
具体实施方式Detailed ways
这里将详细地对示例性实施例进行说明,其示例表示在附图中。下面的描述涉及附图时,除非另有表示,不同附图中的相同数字表示相同或相似的要素。以下示例性实施例中所描述的实施方式并不代表与本发明相一致的所有实施方式。相反,它们仅是与如所附权利要求书中所详述的、本发明的一些方面相一致的装置和方法的例子。Exemplary embodiments will be described in detail herein, examples of which are illustrated in the accompanying drawings. Where the following description refers to the drawings, the same numerals in different drawings refer to the same or similar elements unless otherwise indicated. The implementations described in the illustrative examples below are not intended to represent all implementations consistent with the present invention. Rather, they are merely examples of apparatus and methods consistent with some aspects of the invention as recited in the appended claims.
下面结合附图,对本发明提出的复杂环境下考虑旋翼无人机外形的实时轨迹规划方法进行详细说明。在不冲突的情况下,下述的实施例及实施方式中的特征可以相互组合。The following describes the real-time trajectory planning method considering the shape of the rotor UAV under the complex environment proposed by the present invention in detail with reference to the accompanying drawings. The features of the embodiments and implementations described below may be combined with each other without conflict.
本发明实施例提出了一种复杂环境下考虑旋翼无人机外形的实时轨迹规划方法,本发明方法对于大型旋翼无人机在未知复杂环境进行探索,可作为无人机自主导航系统中的规划器模块。基于当前局部地图信息和无人机实时定位信息,建立栅格地图与ESDF地图,通过将无人机外形抽象为有限球的组合来快速检测与周围环境的碰撞。前端路径搜索算法得到一条粗糙但安全可行的局部路径,后端对前端得到的轨迹进行优化,满足轨迹对机身整体安全性约束的前提下,轨迹满足无人机动力/运动学约束,即轨迹更光滑且可行。The embodiment of the present invention proposes a real-time trajectory planning method that considers the shape of the rotor UAV in a complex environment. The method of the present invention can be used for the exploration of large rotor UAVs in unknown and complex environments, and can be used as a planning method in the autonomous navigation system of the UAV. device module. Based on the current local map information and the real-time positioning information of the UAV, a grid map and an ESDF map are established, and the collision with the surrounding environment can be quickly detected by abstracting the shape of the UAV as a combination of finite spheres. The front-end path search algorithm obtains a rough but safe and feasible local path, and the back-end optimizes the trajectory obtained by the front-end to satisfy the overall safety constraints of the fuselage. Slicker and workable.
本发明方法主要涉及算法前后端对无人机整体形状约束的处理,为了方便介绍,本发明以形状为长方形(长1.2m,宽0.8m),z轴可忽略不计的旋翼无人机为例。具体包括以下步骤:The method of the present invention mainly involves the processing of the constraints on the overall shape of the UAV at the front and back ends of the algorithm. For the convenience of introduction, the present invention takes a rotor UAV with a rectangular shape (length 1.2m, width 0.8m) and negligible z-axis as an example . Specifically include the following steps:
(1)采集无人机当前的局部地图信息和实时定位信息,建立占据概率栅格地图与ESDF地图。(1) Collect the current local map information and real-time positioning information of the UAV, and establish the occupancy probability grid map and ESDF map.
本发明实施例使用占据概率栅格地图来描述环境信息,它在机器人定位信息已知的情况下,从带噪声的传感器,如激光雷达、双目摄像机等测量数据中生成地图。栅格地图使用二值化的方法表示某栅格是否被障碍物占据,对于栅格mi,被占据的概率为p(mi|z1:t,x1:t),它表示对于给定的栅格mi和1到t次的定位信息x1:t进行观察的概率z1:t。概率值越大则表示该栅格被占据的可能性越高。The embodiment of the present invention uses an occupancy probability grid map to describe environmental information, and generates a map from measurement data of noisy sensors, such as lidar and binocular cameras, when the robot positioning information is known. The grid map uses the binarization method to indicate whether a grid is occupied by obstacles. For grid m i , the probability of being occupied is p(m i |z 1:t ,x 1:t ), which indicates that for the given grid The probability z 1:t of observing with a given grid m i and 1 to t times of positioning information x 1 :t. The larger the probability value, the higher the probability that the grid is occupied.
本发明实施例使用ESDF(欧式符号距离场)地图表示环境障碍物势场信息,该地图基于占据概率栅格地图建立,得到每个栅格距离其最近障碍物的距离。对于x,y,z三轴分别构建障碍物栅格与周围栅格的距离函数,这些函数的下包络线即为栅格与其最近障碍物的距离函数,可表示为:In the embodiment of the present invention, an ESDF (Euclidean Symbolic Distance Field) map is used to represent the potential field information of environmental obstacles. The map is established based on the occupancy probability grid map, and the distance of each grid from its nearest obstacle is obtained. For the three axes of x, y, and z, the distance functions between the obstacle grid and the surrounding grids are respectively constructed. The lower envelope of these functions is the distance function between the grid and its nearest obstacle, which can be expressed as:
其中,p表示查询的栅格,q为障碍物所在栅格,为占据概率栅格地图中的所有栅格,f(q)为q的采样函数。为得到空间中某点与最近障碍物的距离与梯度,需要对该点周围的八个栅格进行三线性插值。Among them, p represents the query grid, q is the grid where the obstacle is located, For all grids in the occupancy probability grid map, f(q) is a sampling function of q. In order to obtain the distance and gradient between a point in space and the nearest obstacle, it is necessary to perform trilinear interpolation on the eight grids around the point.
占据概率栅格地图与ESDF地图的实时数据进行更新,地图信息以向量的形式进行存储,在进行路径规划时,通过查询相应栅格的索引值,即可获得障碍物信息。The occupancy probability grid map and the real-time data of the ESDF map are updated, and the map information is stored in the form of a vector. During path planning, the obstacle information can be obtained by querying the index value of the corresponding grid.
(2)通过考虑偏航角的前端路径规划算法,得到符合无人机运动学约束且整机无碰撞的路径;将无人机外形抽象为若干球的组合(以两个球为例),通过建立的ESDF地图检查两圆圆心与最近障碍物的距离是否小于圆的半径来进行碰撞检测。(2) Through the front-end path planning algorithm considering the yaw angle, a path that conforms to the kinematic constraints of the UAV and has no collision of the whole machine is obtained; the shape of the UAV is abstracted as a combination of several balls (taking two balls as an example), Collision detection is performed by checking whether the distance between the center of the two circles and the nearest obstacle is less than the radius of the circle through the established ESDF map.
本发明分为前端路径规划和后端轨迹优化两部分,根据旋翼无人机模型的微分平坦动力学特性,旋翼无人机的平坦输出空间可以用x,y,z和偏航角yaw表示。对于一般的旋翼无人机,使用质点模型能够满足其规划要求,而对于大型旋翼无人机的前端路径规划算法,若使用质点模型进规划,可能会得到一条无人机实际无法通行的路径,如图1所示,因此在进行路径规划时,需要考虑无人机整机外形。大型旋翼无人机的运动学特性令其无法进行大姿态的飞行,即大幅度转动pitch(俯仰角)和roll(横滚角),因此规划时只考虑其yaw(偏航角)的运动学约束。The invention is divided into two parts: front-end path planning and back-end trajectory optimization. According to the differential flat dynamic characteristics of the rotor UAV model, the flat output space of the rotor UAV can be represented by x, y, z and the yaw angle yaw. For general rotor UAV, the use of particle model can meet its planning requirements, but for the front-end path planning algorithm of large rotor UAV, if the particle model is used for planning, a path that the UAV cannot actually pass may be obtained. As shown in Figure 1, the overall shape of the UAV needs to be considered when planning the path. The kinematics of large rotary-wing UAVs make it impossible to fly with a large attitude, that is, to rotate the pitch (pitch angle) and roll (roll angle) greatly, so only the kinematics of its yaw (yaw angle) are considered in planning. constraint.
本发明实例中前端路径规划算法利用考虑偏航角yaw的基于运动学的A*算法,得到初始路径,具体为:In the example of the present invention, the front-end path planning algorithm utilizes the kinematic-based A* algorithm considering the yaw angle yaw to obtain the initial path, specifically:
(2.1)从起点开始扩展节点,基于不同的控制输入量得到若干条运动基元,通过对运动基元进行安全性和动力学可行性检查,保留满足约束条件的运动基元;(2.1) Expand the nodes from the starting point, obtain several motion primitives based on different control inputs, and retain the motion primitives that meet the constraints by checking the safety and dynamic feasibility of the motion primitives;
一般的A*算法将起点到当前节点的欧式距离作为代价函数,将当前节点到终点的欧式距离作为启发函数,每一次向终点搜索时,选取待扩展节点中代价函数与启发函数相加最小的节点作为下一个路径点,直至搜索到终点。对于基于动力学的A*算法,扩展节点时需考虑无人机的运动学特性,其运动的轨迹可表示为关于时间t的多项式,考虑旋翼无人机外形的实时轨迹规划,需要加入一维对偏航角的规划,使用四个独立的一维时间参数化多项式方程表示:The general A* algorithm uses the Euclidean distance from the starting point to the current node as the cost function, and the Euclidean distance from the current node to the end point as the heuristic function. Every time when searching to the end point, the cost function and the heuristic function in the node to be expanded are selected with the smallest sum of the cost function and the heuristic function. The node is used as the next waypoint until the search reaches the end point. For the A* algorithm based on dynamics, the kinematic characteristics of the UAV need to be considered when expanding nodes, and the trajectory of its motion can be expressed as a polynomial with respect to time t. Considering the real-time trajectory planning of the shape of the rotor UAV, it is necessary to add a one-dimensional The planning for the yaw angle is expressed using four independent one-dimensional time-parameterized polynomial equations:
p(t):=[px(t),py(t),pz(t),Pyaw(t)]T p(t): = [p x (t), p y (t), p z (t), P yaw (t)] T
其中,pμ(t)为各维的时间参数化多项式方程,μ∈{x,y,z,yaw},ak为多项式系数,k为多项式阶数。使为状态向量,使为控制输入,则其状态空间模型可以表示为:Among them, p μ (t) is the time-parameterized polynomial equation of each dimension, μ∈{x, y, z, yaw}, a k is the polynomial coefficient, and k is the polynomial order. Make is the state vector, so that is the control input, its state space model can be expressed as:
状态方程的完整解表示为:The complete solution to the equation of state is expressed as:
其表示初始状态为x(0),控制输入量为u(t),旋翼无人机系统的轨迹为x(t)。It indicates that the initial state is x(0), the control input is u(t), and the trajectory of the rotor UAV system is x(t).
在扩展节点时,给定旋翼无人机的当前状态,对持续时间τ输入一组离散控制量本发明实施例中给定n=2,表示以各轴的加速度为输入量,则偏航角yaw的输入量为角加速度。各轴的[-umax,umax]被均匀离散为则每次扩展节点可以得到(2r+1)4条运动基元。When expanding the node, given the current state of the rotor UAV, input a set of discrete control quantities for the duration τ In the embodiment of the present invention, n=2 is given, which means that the acceleration of each axis is used as the input quantity, and the input quantity of the yaw angle yaw is the angular acceleration. [-u max , u max ] of each axis is uniformly discretized as Then each time a node is expanded, (2r+1) 4 motion primitives can be obtained.
本发明为了平衡前后端规划的计算消耗,令r=2,每条运动基元需通过可行性和安全性检查才能使其对应的节点加入可扩展节点集。可行性检查要求运动基元上的轨迹点的速度与加速度不超过无人机运动能力的最大限制,安全性检查要求整段运动基元无碰撞,查询球形组合的各球心到最近障碍物的距离并计算,该距离不能小于球的半径。In the present invention, in order to balance the calculation consumption of front-end and back-end planning, let r=2, and each motion primitive needs to pass feasibility and security checks before its corresponding node can be added to the scalable node set. The feasibility check requires that the velocity and acceleration of the trajectory points on the motion primitives do not exceed the maximum limit of the UAV's motion capability, and the safety check requires that the entire motion primitives have no collision, and the distance between the center of each spherical combination and the nearest obstacle is inquired. Distance and calculate, the distance cannot be less than the radius of the ball.
通过将无人机的外形抽象为有限个球的组合(本发明实施例以两个球为例)进行快速碰撞检测。Rapid collision detection is performed by abstracting the shape of the drone as a combination of a limited number of balls (two balls are used as an example in the embodiment of the present invention).
本发明为了满足轨迹生成的实时性,将无人机机体抽象为两个球的组合进行安全性检查,其原理为:检查两球圆心与最近障碍物的距离是否小于球的半径来判断是否碰撞,与最近障碍物距离通过查询ESDF地图信息得出。因查询操作的计算复杂度为0(n),所以本发明针对考虑无人机形状的碰撞检测方法能够达到实时的效果。In order to meet the real-time performance of trajectory generation, the present invention abstracts the drone body as a combination of two balls for safety inspection. , and the distance to the nearest obstacle is obtained by querying the ESDF map information. Since the computational complexity of the query operation is 0(n), the present invention can achieve a real-time effect for the collision detection method considering the shape of the drone.
(2.2)根据步骤(2.1)得到的运动基元,计算每一运动基元对应的节点,对每个节点进行代价函数和启发函数评估,并将该节点加入待扩展节点列表。将待扩展节点列表中代价函数和启发函数之和最小的节点作为下一节点;重复上述步骤,直至搜索到的节点为终点,即得到符合无人机运动学约束且整机无碰撞的路径。(2.2) According to the motion primitives obtained in step (2.1), the nodes corresponding to each motion primitive are calculated, the cost function and the heuristic function are evaluated for each node, and the node is added to the list of nodes to be expanded. The node with the smallest sum of the cost function and the heuristic function in the node list to be expanded is used as the next node; the above steps are repeated until the searched node is the end point, that is, a path that conforms to the kinematic constraints of the UAV and has no collision for the whole machine is obtained.
节点的代价函数J(T)设计为关于控制输入量u(t)与时间t的函数,即:The cost function J(T) of the node is designed as a function of the control input u(t) and time t, namely:
其中,ρ为时间t的权重。Among them, ρ is the weight of time t.
节点的启发函数J*(Th)设计为不考虑碰撞的情况下,从当前节点的状态到终点状态的最优化问题,旨在求出最优的转移时间t,即:The heuristic function J*(Th) of the node is designed as the optimization problem from the current state of the node to the end state without considering the collision, aiming to find the optimal transition time t, namely:
其中pμc,vμc,,pμg,vμg为当前节点和终点无人机的位置和速度,通过使where p μc , v μc , p μg , v μg are the position and speed of the current node and end point UAV, by using
得到最优时间t下,最小的J*(Th)。 Get the minimum J*(Th) under the optimal time t.
若出现待扩展节点为空且未到达终点的情况,则对yaw的输入控制量进行更精细的离散,令ryaw=4,重新生成(2r+1)3*(2ryaw+1)条运动基元,若仍未有可扩展节点则退回上一节点重新搜索一条不同拓扑的路径。If the node to be expanded is empty and has not reached the end point, the input control amount of yaw is more finely discretized, let r yaw =4, and regenerate (2r+1) 3 *(2r yaw +1) motions Primitive, if there is still no scalable node, return to the previous node and search for a path with a different topology.
前端考虑偏航角的基于运动学的A*算法生成的粗糙轨迹为后端轨迹优化提供了较好的初值,加快了后端的优化速度,也避免了一般的A*算法搜索到不可行区域导致优化失败的情况。The rough trajectory generated by the kinematics-based A* algorithm that considers the yaw angle at the front end provides a better initial value for the back-end trajectory optimization, which speeds up the back-end optimization speed and avoids the general A* algorithm to search for infeasible areas. Conditions that cause optimization to fail.
(3)通过后端轨迹优化算法,构建无人机的非质点模型,将无人机的几何外形抽象为解析表达方法,优化步骤(2)得到的局部路径。(3) Through the back-end trajectory optimization algorithm, the non-particle model of the UAV is constructed, the geometric shape of the UAV is abstracted into an analytical expression method, and the local path obtained in step (2) is optimized.
本发明后端基于B样条或MINCO轨迹类进行轨迹优化。本发明实施例中以B样条为例,前端路径可转化为控制点Q={Q_0,Q_1,…,Q_N}的pb阶B样条,通过优化控制点的位置来得到满足约束条件的轨迹。轨迹优化基于梯度下降的方法,通过对目标函数求导得到使目标函数值减小的梯度方向,从而优化控制点位置使目标函数最小,目标函数为关于控制点的函数。其目标函数可表示为:The back end of the present invention performs trajectory optimization based on B-splines or MINCO trajectory classes. In the embodiment of the present invention, taking a B-spline as an example, the front-end path can be converted into a pb-order B-spline with control points Q={Q_0, Q_1, . . Trajectory optimization is based on the method of gradient descent. By derivation of the objective function, the gradient direction that reduces the value of the objective function is obtained, thereby optimizing the position of the control point to minimize the objective function, and the objective function is a function of the control point. Its objective function can be expressed as:
f=λsfs+λcfc+λ(fv+fa)f=λ s f s +λ c f c +λ(f v +f a )
其中,fs为光滑成本函数,λs为自定义的光滑成本函数对应的系数,通过获得轨迹的几何信息来使轨迹更加平滑。fc为碰撞成本函数,λc为自定义的碰撞成本函数对应的系数,使轨迹远离障碍物。fv和fa为动力学可行性成本函数,λ为自定义的动力学可行性成本函数对应的系数,限制机器人的速度和加速度不超过限制。Among them, f s is the smooth cost function, λ s is the coefficient corresponding to the user-defined smooth cost function, and the trajectory is made smoother by obtaining the geometric information of the trajectory. f c is the collision cost function, and λ c is the coefficient corresponding to the user-defined collision cost function to keep the trajectory away from obstacles. f v and f a are the dynamic feasibility cost function, λ is the coefficient corresponding to the self-defined dynamic feasibility cost function, and the speed and acceleration of the robot are limited to not exceed the limit.
为生成考虑整机形状的安全轨迹,本发明将旋翼无人机外形等效为两个球的组合,如图2所示(五角星为PA和PB,十字星为PO),PO为旋翼无人机质心,PA和PB分别为两个球的球心,空间中PA和PB到PO的模为一定值,PA点和PB点到PO坐标间的平移量为关于偏航角yaw的函数。为了使约束函数(碰撞成本函数)为凸函数,在计算碰撞约束时,从ESDF地图中分别获得两个球心与环境中障碍物的距离信息和远离障碍物的梯度方向信息,再根据PA、PB、PO的旋转和平移关系将距离和梯度信息传递到PO点,从而将轨迹沿梯度下降的方向推离障碍物来避免碰撞。以球心PA为例,PA可表示为质心PO和航向角的函数:In order to generate a safe trajectory considering the shape of the whole machine, the present invention uses the shape of the rotor UAV as a combination of two balls, as shown in Figure 2 (the five-pointed star is P A and P B , the cross star is P O ), P O is the center of mass of the rotor UAV, P A and P B are the centers of the two spheres, respectively, the modulus of P A and P B to P O in space is a certain value, and the coordinates of P A and P B to P O The amount of translation is a function of the yaw angle yaw. In order to make the constraint function (collision cost function) a convex function, when calculating the collision constraint, the distance information between the two sphere centers and the obstacles in the environment and the gradient direction information away from the obstacles are obtained from the ESDF map, and then according to P A The rotation and translation relationships of , P B , and PO transfer distance and gradient information to PO point, thereby pushing the trajectory away from obstacles in the direction of gradient descent to avoid collisions. Taking the center of the sphere PA as an example, PA can be expressed as a function of the center of mass PO and the heading angle:
为机器人当前的航向角,为PO对PA关于航向角的平移量。根据链式法则,可求出约束函数J(即碰撞成本函数fc)关于机器人位置和航向角的梯度: is the current heading angle of the robot, for P O to P A with respect to the heading angle amount of translation. According to the chain rule, the gradient of the constraint function J (ie, the collision cost function f c ) with respect to the robot position and heading angle can be found:
其中,为从环境距离场得到的PA点关于障碍物的梯度。in, is the gradient of point P A with respect to the obstacle obtained from the environmental distance field.
本发明将旋翼无人机几何外形抽象为解析表达的方法包括但不限于使用有限的圆的组合来表示,其他任何凸多面体的组合都可以被应用。The method for abstracting the geometric shape of the rotor UAV into an analytical expression in the present invention includes, but is not limited to, using a limited combination of circles to represent, and any other combination of convex polyhedrons can be applied.
前端路径规划效果图如图3所示。后端轨迹优化效果图如图4所示。对比可知,本发明前端搜索的路径更贴合后端优化的结果,且在遇见障碍物是拐角的情况时,仍能得到一条安全无碰撞的轨迹。The rendering of the front-end path planning is shown in Figure 3. The effect diagram of back-end trajectory optimization is shown in Figure 4. By comparison, it can be seen that the path searched by the front end of the present invention is more suitable for the result of the back end optimization, and a safe and collision-free trajectory can still be obtained when the obstacle is a corner.
以上实施例仅用于说明本发明的设计思想和特点,其目的在于使本领域内的技术人员能够了解本发明的内容并据以实施,本发明的保护范围不限于上述实施例。所以,凡依据本发明所揭示的原理、设计思路所作的等同变化或修饰,均在本发明的保护范围之内。The above embodiments are only used to illustrate the design ideas and features of the present invention, and the purpose is to enable those skilled in the art to understand the contents of the present invention and implement them accordingly, and the protection scope of the present invention is not limited to the above embodiments. Therefore, all equivalent changes or modifications made according to the principles and design ideas disclosed in the present invention fall within the protection scope of the present invention.
Claims (10)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210842336.7A CN115097857B (en) | 2022-07-18 | 2022-07-18 | Real-time trajectory planning method considering the shape of rotary-wing UAV in complex environment |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210842336.7A CN115097857B (en) | 2022-07-18 | 2022-07-18 | Real-time trajectory planning method considering the shape of rotary-wing UAV in complex environment |
Publications (2)
Publication Number | Publication Date |
---|---|
CN115097857A true CN115097857A (en) | 2022-09-23 |
CN115097857B CN115097857B (en) | 2024-04-30 |
Family
ID=83299280
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210842336.7A Active CN115097857B (en) | 2022-07-18 | 2022-07-18 | Real-time trajectory planning method considering the shape of rotary-wing UAV in complex environment |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115097857B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116774735A (en) * | 2023-08-24 | 2023-09-19 | 北京理工大学 | A UAV cluster trajectory planning method and system based on edge computing |
CN117870653A (en) * | 2024-03-13 | 2024-04-12 | 中国科学技术大学 | Method for establishing and updating two-dimensional differential Euclidean symbol distance field map |
CN118111447A (en) * | 2024-04-28 | 2024-05-31 | 南开大学 | UAV motion planning method, device and storage medium for narrow environment |
CN119223315A (en) * | 2024-12-02 | 2024-12-31 | 中科南京智能技术研究院 | Mobile terminal path planning method and system based on distance field |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110807782A (en) * | 2019-10-25 | 2020-02-18 | 中山大学 | A map representation system for visual robot and its construction method |
CN111857160A (en) * | 2020-08-17 | 2020-10-30 | 武汉中海庭数据技术有限公司 | Unmanned vehicle path planning method and device |
CN112180977A (en) * | 2020-09-30 | 2021-01-05 | 苏州臻迪智能科技有限公司 | Trajectory planning method and device, storage medium and aircraft |
CN113835443A (en) * | 2021-10-08 | 2021-12-24 | 重庆大学 | Trajectory planning method for quadrotor unmanned aerial vehicle based on non-traditional European distance field |
CN114355980A (en) * | 2022-01-06 | 2022-04-15 | 上海交通大学宁波人工智能研究院 | Four-rotor unmanned aerial vehicle autonomous navigation method and system based on deep reinforcement learning |
-
2022
- 2022-07-18 CN CN202210842336.7A patent/CN115097857B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110807782A (en) * | 2019-10-25 | 2020-02-18 | 中山大学 | A map representation system for visual robot and its construction method |
CN111857160A (en) * | 2020-08-17 | 2020-10-30 | 武汉中海庭数据技术有限公司 | Unmanned vehicle path planning method and device |
CN112180977A (en) * | 2020-09-30 | 2021-01-05 | 苏州臻迪智能科技有限公司 | Trajectory planning method and device, storage medium and aircraft |
CN113835443A (en) * | 2021-10-08 | 2021-12-24 | 重庆大学 | Trajectory planning method for quadrotor unmanned aerial vehicle based on non-traditional European distance field |
CN114355980A (en) * | 2022-01-06 | 2022-04-15 | 上海交通大学宁波人工智能研究院 | Four-rotor unmanned aerial vehicle autonomous navigation method and system based on deep reinforcement learning |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116774735A (en) * | 2023-08-24 | 2023-09-19 | 北京理工大学 | A UAV cluster trajectory planning method and system based on edge computing |
CN116774735B (en) * | 2023-08-24 | 2023-11-10 | 北京理工大学 | Unmanned aerial vehicle cluster track planning method and system based on edge calculation |
CN117870653A (en) * | 2024-03-13 | 2024-04-12 | 中国科学技术大学 | Method for establishing and updating two-dimensional differential Euclidean symbol distance field map |
CN117870653B (en) * | 2024-03-13 | 2024-05-14 | 中国科学技术大学 | A method for establishing and updating two-dimensional differential Euclidean signed distance field map |
CN118111447A (en) * | 2024-04-28 | 2024-05-31 | 南开大学 | UAV motion planning method, device and storage medium for narrow environment |
CN119223315A (en) * | 2024-12-02 | 2024-12-31 | 中科南京智能技术研究院 | Mobile terminal path planning method and system based on distance field |
Also Published As
Publication number | Publication date |
---|---|
CN115097857B (en) | 2024-04-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN115097857B (en) | Real-time trajectory planning method considering the shape of rotary-wing UAV in complex environment | |
CN111707269A (en) | A method of UAV path planning in 3D environment | |
Campos‐Macías et al. | Autonomous navigation of MAVs in unknown cluttered environments | |
Respall et al. | Fast sampling-based next-best-view exploration algorithm for a MAV | |
Ji et al. | Mapless-planner: A robust and fast planning framework for aggressive autonomous flight without map fusion | |
Chen et al. | Dynamic obstacle avoidance for uavs using a fast trajectory planning approach | |
CN113885567A (en) | Multi-unmanned aerial vehicle collaborative path planning method based on conflict search | |
Chen et al. | Multilayer mapping kit for autonomous UAV navigation | |
CN117270562A (en) | Single unmanned aerial vehicle obstacle avoidance path planning method based on RRT and VO in complex discrete environment | |
Xing et al. | Autonomous landing of a micro aerial vehicle on a moving platform using a composite landmark | |
Tsintotas et al. | The MPU RX-4 project: Design, electronics, and software development of a geofence protection system for a fixed-wing vtol uav | |
Chen et al. | Obstacle avoidance strategy for quadrotor UAV based on improved particle swarm optimization algorithm | |
CN117685953A (en) | UWB and vision fusion positioning method and system for multi-UAV collaborative positioning | |
CN116048120A (en) | An autonomous navigation system and method for a small quadrotor UAV in an unknown dynamic environment | |
Chronis et al. | Path planning of autonomous UAVs using reinforcement learning | |
CN114578824A (en) | Unknown environment autonomous exploration method suitable for air-ground dual-purpose robot | |
Lee et al. | Real‐time collision‐free landing path planning for drone deliveries in urban environments | |
Mao et al. | Cooperative 3D path planning of multi-UAV via improved fruit fly optimization | |
CN117270565A (en) | Airborne autonomous sensing and flight system based on vision | |
Scholer et al. | Configuration space and visibility graph generation from geometric workspaces for uavs | |
Kim et al. | Vision-based pose estimation of fixed-wing aircraft using you only look once and perspective-n-points | |
CN117452965A (en) | Track planning method for variable-configuration unmanned aerial vehicle to pass through long and narrow channel | |
CN116339347A (en) | A method, device and equipment for unmanned vehicle operation path planning | |
Chen et al. | Real-time efficient trajectory planning for quadrotor based on hard constraints | |
Chen et al. | Safer-splat: A control barrier function for safe navigation with online gaussian splatting maps |
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 |