A method for planning the operation route of agricultural drones on irregular plots

By calculating the external quadrilateral and selecting diagonal lines to generate route intersections, the problem of difficulty in planning irregular and irregular plots in existing technology is solved, and efficient and accurate route planning of agricultural drones in special plots is realized, and operation efficiency and quality.

CN114721418BActive Publication Date: 2024-11-19SOUTH CHINA AGRICULTURAL UNIVERSITY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210150711.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-02-18
Publication Date
2024-11-19
Estimated Expiration
2042-02-18

AI Technical Summary

Technical Problem

The existing agricultural drone route planning methods are difficult to effectively deal with concave, convex or other irregular and irregular plots, resulting in increased operational complexity, reduced efficiency and poor quality.

Method used

By calculating the external quadrilateral of the target area, selecting the diagonal line as a fixed reference line segment, using its direction and length to calculate the route intersection point, generate route segments, and form an overall operating route through transition route connections, optimizing the route starting point to achieve accurate and flexible routes planning.

Benefits of technology

The rapid and intelligent route planning of any concave and convex special-shaped plot is realized, and the continuous operation capability and operation efficiency of agricultural drones in the special-shaped plot area is improved, and errors caused by coordinate system conversion are avoided.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114721418B_ABST
    Figure CN114721418B_ABST
Patent Text Reader

Abstract

The present invention discloses a method for planning an operation route of an agricultural UAV for a special-shaped plot, comprising the following steps: S1: preset operation route parameters; S2: selection of fixed reference line segments; S3: calculation of moving step length; S4: generation of boundary intersection points; S5: generation of route segments; S6: generation of overall operation route; S7: generation of overall operation route starting point; S8: overall operation route optimization. The present invention can realize fast and intelligent route planning for complex special-shaped plots such as concave, convex non-polygonal or other irregular plots, not only can realize route generation in any direction or angle, but also can avoid errors caused by frequent coordinate system conversion. The generated route has good accuracy and flexibility, can effectively improve the continuous operation capability of agricultural UAVs in special-shaped plot areas, and improve the operation efficiency and operation quality of agricultural UAVs in special-shaped plot areas.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to an agricultural unmanned aerial vehicle aerial operation method, and in particular to an agricultural unmanned aerial vehicle operation route planning method for a special-shaped plot of land. Background Art

[0002] In recent years, with the rapid development of agricultural drone-related technologies, the traditional manual flight operation of agricultural drones controlled by pilots through remote controls is gradually being replaced by fully autonomous operation. One of the core technologies for agricultural drones to achieve autonomous operation is accurate and reasonable route planning, but the existing route planning technology is mainly used for plots with regular shapes. In actual agricultural production, the shape of plots is usually irregular, especially in southern China. Due to obstacles, ponds, windbreaks, etc., concave, convex or other irregular shaped plots are common; in addition, in special application scenarios such as painted planting, it is necessary to control the different shapes of the falling area to present a specific pattern, and irregular shaped areas will also appear. Traditional route planning methods cannot easily and efficiently plan routes for irregular plots, and the use of routes obtained by such traditional route planning methods for autonomous operations not only increases the complexity of the operation but also easily causes overlapping and missing rows, which needs to be solved urgently.

[0003] Currently, the main methods for UAV route planning include coordinate system rotation method, parallel line movement method and grid method.

[0004] The invention patent application with application publication number CN109298720A discloses a route planning method for a crop protection UAV, which realizes route planning by decomposing the entire operating area into a set of several grid units and using a coordinate system conversion method; the invention patent with authorization announcement number CN105116913B proposes a method of fitting the image of the area to be operated into a convex polygon in a first coordinate system, with the starting point of the crop protection UAV as the origin, the straight line passing through the origin in the east-west direction as the horizontal axis, and the straight line passing through the origin in the north-south direction as the vertical axis, and then performing coordinate transformation on the convex polygon area corresponding to the convex polygon, thereby realizing route planning for the convex-edged operating area; the invention patent with authorization announcement number CN106568443B proposes a route planning method for a quadrilateral, which uses a certain operating boundary of the quadrilateral as a reference to generate several equally spaced straight lines, and then completes the route planning by sorting and connecting the intersection points of the straight lines with other boundaries. Although the above-mentioned UAV route planning methods can be used for route planning, they can only be used for convex polygonal or quadrilateral areas. Such route planning methods are not suitable for concave, convex non-polygonal or other irregular shaped plots. If such methods are still used, not only will overlapping and missing rows occur, but the complexity of agricultural UAV operations will also be increased, reducing operation efficiency and quality.

[0005] Regarding route planning for irregular plots of land, the invention patent with application publication number CN112313476A discloses a route planning method with a no-fly zone. When an obstacle area is set in the entire area, route detour planning is performed to ensure flight safety. This method can realize route planning for a part of the irregular area, but when faced with complex areas such as concave, convex non-polygonal or other irregular irregular plots, the setting of the obstacle area is not simple enough, and the complexity of route planning is high; the patent disclosure documents with authorization announcement number CN107860387B and application publication number CN109933091A both disclose a route planning method, which selects one of the boundaries of the area to be planned as the starting edge of the route planning, draws multiple line segments parallel to the starting edge and compares them with the line segments. The route planning is carried out after the boundary intersection is processed accordingly, and the route planning for the special-shaped area is realized. However, the direction of the route obtained by this method is determined by the boundary of the area to be planned. The optional route directions are limited and difficult to adjust, and it is difficult to meet the needs of free route direction setting; the invention patent application with application publication number CN113589841A proposes a route planning method using area segmentation for special-shaped areas. The entire operating area is first divided into several sub-areas, and then the sub-areas are route planned. The sub-areas are connected by transition routes to realize route planning in complex areas. However, this method requires frequent coordinate conversion. In the actual operation route planning process, the boundary coordinates are all longitude and latitude coordinates. Frequent coordinate system conversion will inevitably lose a certain amount of accuracy, resulting in operation errors. Summary of the invention

[0006] The purpose of the present invention is to overcome the shortcomings of the prior art and provide a method for planning the operation route of an agricultural UAV for special-shaped plots. The method can greatly simplify the process of generating routes for concave, convex non-polygonal or other irregular special-shaped plots, and realize fast and intelligent route planning. It can not only realize the generation of routes with arbitrary route directions and angles, but also avoid errors caused by frequent coordinate system conversions. The generated routes have good accuracy and flexibility, and can effectively improve the continuous operation capability of agricultural UAVs in special-shaped plot areas, and improve the operation efficiency and quality of agricultural UAVs in special-shaped plot areas.

[0007] The purpose of the present invention is achieved through the following technical solutions:

[0008] A method for planning an agricultural drone operation route for a special-shaped plot of land, characterized in that it comprises the following steps:

[0009] S1: Presetting of operation route parameters: obtaining the boundary coordinates of the target area A; the operation route parameters include width w, route angle d and feeding point H; according to the boundary coordinates of the target area A, calculating and planning the circumscribed quadrilateral of the target area A, and obtaining the four vertices of the circumscribed quadrilateral;

[0010] S2: Fixed reference line segment selection: According to the preset route angle d, select a diagonal line corresponding to the circumscribed quadrilateral as the fixed reference line segment s, and calculate the length l of the fixed reference line segment s, the angle d between the fixed reference line segment s and the true north direction. s Perform calculations;

[0011] S3: Calculation of moving step length: Based on the width w combined with the route angle d and the angle d calculated in step S2 s , calculate the moving step length w' used in the route planning process, where the calculation formula for the moving step length w' is as follows:

[0012]

[0013] S4: Boundary intersection generation: Take one end of the fixed reference line segment s as the starting point and move the length w i Then get point p i ; with p i As the midpoint, generate a line segment m with a direction angle of d i , line segment m i The length of the line segment m is 2l; calculate i The coordinates of the intersection point with the boundary of the target area A, and the intersection point is recorded as p ij(j=1,2,3…) , and for the intersection point p ij After sorting, it is recorded as the unit intersection set V i ; Among them, the moving length w i The calculation formula is as follows:

[0014]

[0015] S5: Route segment generation: Repeat step S4 until the moving length w i >l-w' / 2, the unit intersection set V obtained each time i Integrate into a set of all intersection points V; connect all the intersection points in the set of all intersection points V to form a route segment set L' k ;

[0016] S6: Generate the overall operation route: connect the route segment set L' in step S5 through the transition route k Each route segment L k , generate the overall operation route L of the agricultural UAV;

[0017] S7: Generate the starting point of the overall operation route: First, cut the overall operation route L according to the width w; then, according to the feeding point H, calculate the distance between the feeding point H and the first and last endpoints of the overall operation route L, and select the end closest to the feeding point H as the starting point of the overall operation route L; or manually specify one end as the starting point of the overall operation route L;

[0018] S8: Overall operation route optimization: Adopting the method of targeting the unit intersection set V i Medium ij Steps S4 to S7 are repeated in different intersection ordering methods to obtain different overall operation routes. The qualities of the different overall operation routes are compared, and the optimal overall operation route of the target area A is selected as the final operation route.

[0019] In a preferred embodiment of the present invention, in step S1, the four vertices of the circumscribed quadrilateral are respectively recorded as: A nw , A ne , A se and A sw In step S2, when the preset route angle d is greater than or equal to 0° and less than or equal to 90° or greater than or equal to -180° and less than or equal to -90°, select A nw , A se The diagonal line is used as the fixed reference line segment s; when the preset route angle d is greater than 90° and less than 180° or greater than -90° and less than 0°, select A ne and A sw The diagonal line serves as the fixed reference line segment s.

[0020] In a preferred embodiment of the present invention, in step S4, the i-th moving point p i Generate line segment m i The calculation steps include:

[0021] A1: According to Calculate the i-th moving distance w i Then, take one end of the fixed reference line segment s as the starting point and calculate the distance w from the starting point i Point p i ;

[0022] A2: According to step A1 i The coordinates (lat, lon) are calculated relative to p i Point q with direction angle d and distance l i1 The coordinates of (desLat, desLon), where desLat and desLon are calculated as follows:

[0023]

[0024] desLat=arcsin(sin(lat)*cos(radius)+cos(lat)*sin(radius)*cos(d))

[0025] a=sin(d)*sin(radius)*cos(lat)

[0026] β=cos(radius)-sin(lat)*sin(desLat)

[0027]

[0028]

[0029] A3: Use the same calculation method as step A2 to calculate the relative p i Point q with direction angle d' and distance l i2 , where d' is calculated as follows:

[0030]

[0031] A4: Based on the point q obtained in step A2 and step A3 i1 and q i2 To generate line segment m i .

[0032] In a preferred embodiment of the present invention, in step S6, the drawing of the overall operation route L includes the formation of route segments and the connection between the route segments, including the following steps:

[0033] B1: Take out a unit intersection point set V from all intersection point sets V in order i , and extract the unit intersection set V i Make a judgment; if the number of intersections is less than or equal to 1, delete the intersection coordinates in the unit intersection set, and update the unit intersection set number to the next unit intersection set, and re-execute step B1; if the unit intersection set V i If the number of intersections in is greater than or equal to 2, then proceed to step B2;

[0034] B2: The unit intersection set V i The number of intersections with the last unit intersection set V i-1 Compare the number of intersections:

[0035] B21: Determine whether there is route segment L k-1 ; If it does not exist, create a new route segment L k(k=1,2,3…) , if it exists, go to step B22;

[0036] B22: When the unit intersection set V i-1 The unit intersection set V does not exist or is taken out this time i The number of intersections and the last unit intersection set V taken out i-1If the number of intersections is equal, then the unit intersection set V taken out this time i Take out the first two intersection points p ij 、p i(j+1) The coordinates of the route segment L k The intersection point enters the route segment L k The method uses j as a reference, alternately adopts ascending or descending order and enters the route segment L with the previous intersection point k The opposite way.

[0037] B23: When the unit intersection set V extracted this time appears i The number of intersections and the last unit intersection set V taken out i-1 If the number of intersection points is not equal, it means that the concave area of ​​the target area A appears or disappears, and the unit intersection set V taken out this time is i The i value is recorded in the transition route position temporary storage set R' l(l=1,2,3…) At this time, calculate the last route segment L k-1 The last intersection coordinates of the last element in the intersection point set V of this unit i , and determine whether the midpoint of the line x is in the target area A:

[0038] If the midpoint of the line x is in the target area A, then the unit intersection set V i The first two intersection points p ij 、p i(j+1) The coordinates of the route segment L k The two intersection points enter L k The method uses j as a reference, alternately adopts ascending or descending order and enters the route segment L with the previous intersection point k The method is opposite to that of the previous one, and the unit intersection set sequence number is updated to the next unit intersection set; when the unit intersection set V i+1 If it still exists, repeat step B1, otherwise go to step B3;

[0039] If the midpoint of line segment x is outside target area A, then for all current route segments L k Save to route segment collection L' k(k=1,2,3…) and create a new route segment L k+1 ; At the same time, temporarily store the set R' from the transition route position l Take out the first set element i and convert it to the corresponding unit intersection set V i , and repeat step B1;

[0040] B3: After traversing all the intersection points V, save the last route segment L k To route segment set L'k And check the temporary set R' of transition route positions l Is it empty? If it is not empty, take out the first i value and convert it to the corresponding unit intersection set V i , create a new route segment L k+1 And repeat step B1;

[0041] B4: Set the route segment set L' k Follow the specified steps to connect the drone's overall operating route L.

[0042] Preferably, in step B4, the route segment set L' k The steps to connect the overall operation route L of the drone are:

[0043] C1: From the route segment set L' k Take out the first route segment L in order k(k=1) As the starting segment, the coordinates of each intersection point corresponding to the elements therein are sequentially put into the overall operation route L;

[0044] C2: When the route segment set L' k There is still a route segment L k , respectively calculate the current overall operation route L and route segment set L' k The remaining route segments L k The distance between the first intersection coordinate and the last intersection coordinate of the first element and the current overall operation route L and route segment set L' k The remaining route segments L k The distance between the first intersection coordinate and the last intersection coordinate of the last element is compared and the route segment L with the smallest distance is selected. k As the next route segment to be connected;

[0045] C3: Put the number of elements contained in the current overall operation route L into the position set R m(m=1,2,3..) In, R m(m=1,2,3..) It is used to record the position of the transition route in the overall operation route L, and then put the route segment to be connected confirmed in step C2 into the current overall operation route L;

[0046] C4: Repeat steps C2 to C3 until the route segment set L' k When all elements in are traversed, the final overall operation of connecting routes L is completed.

[0047] Preferably, in step S7, the entire operation route L is cut, and the L in the entire operation route L is determined by a recursive calculation method. n(n=1,3,5…) and L n+1Is the distance less than the preset parameter width w? If so, delete the corresponding L n and L n+1 , and refresh the position set R m The values ​​in are calculated recursively until L in the overall operation route L is n and L n+1 When the distances are all greater than the preset parameter width w, the cutting is completed; after the starting point of the overall operation route L is determined, if the starting point is the tail end of the overall operation route L, the points in the overall operation route L are reversed, that is, the original first point becomes the last point, the second point becomes the second to last point, and so on, and the length of the current starting point of the overall operation route L from the feeding point H and the total length of the overall operation route are recorded.

[0048] In a preferred embodiment of the present invention, in step S4, the unit intersection set V i There are four ways to sort the intersection coordinates: 1) from small to large latitude, 2) from large to small latitude, 3) from small to large longitude, 4) from large to small longitude.

[0049] In a preferred embodiment of the present invention, in step S8, the quality comparison of the overall operation route includes the following evaluation indicators: the distance between the starting point of the overall operation route and the feeding point, the length of the transition route, and the number of line changes.

[0050] In a preferred embodiment of the present invention, the boundary coordinates of the target area A are obtained by manual designation, ground station marking or flight marking.

[0051] Compared with the prior art, the present invention has the following beneficial effects:

[0052] 1. When planning the route, the present invention first calculates the circumscribed quadrilateral, then selects one of the diagonals according to preset parameters, and uses the direction and length of the diagonal to obtain the route intersection points in turn, and then quickly and accurately generates the overall operation route. It has good operation continuity and can realize the overall operation route planning for any concave and convex special-shaped plots and non-polygonal or other irregular and other complex special-shaped plots, which is beneficial to improving the continuous operation capability of agricultural drones in special-shaped plot areas and improving the operation efficiency and operation quality of agricultural drones in special-shaped plot areas.

[0053] 2. The present invention can preset the overall operation route parameters and realize the generation of routes in any direction or angle, and the generated routes have good flexibility.

[0054] 3. The present invention can realize route planning for multiple special-shaped areas without the need for coordinate system conversion, thus avoiding errors caused by frequent coordinate system conversion. The accuracy of the generated routes is improved, and multiple special-shaped areas can be operated continuously in sequence, thereby improving the operating efficiency of agricultural drones.

[0055] 4. The invention patent application with application publication number CN112789976A discloses a row-type seeding method and a row-type seeding drone using the method. The seeding drone can accurately sow in rows and holes, which is conducive to the planting of painted rice. However, the planting area corresponding to the pattern of painted rice is usually a special-shaped plot, and most of them are complex and special-shaped plots such as concave, convex non-polygonal or other irregular plots, so as to present complex graphic information in the rice field. However, the seeding drone currently lacks a supporting route planning method, and the manual planting of painted rice is costly. If combined with the route planning method of the present invention, it can realize fast and intelligent planning of routes at any angle for special-shaped areas, and the generated routes have good accuracy and flexibility, which can effectively improve the continuous operation ability of agricultural drones in special-shaped plot areas, and have good application prospects in the current expensive color pattern rice sowing. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] Figure 1 The present invention is a general flowchart of a method for planning an operation route for an agricultural UAV on a special-shaped plot of land.

[0057] Figure 2-Figure 3 is a schematic diagram of the process of obtaining the set of all unit intersections, where: Figure 2 A schematic diagram for planning the circumscribed quadrilateral and selecting fixed reference line segments. Figure 3 Schematic diagram of the boundary intersection generation process.

[0058] Figure 4 The flowchart is a process of forming route segments from a set of unit intersection points.

[0059] Figure 5 The flowchart is a process of forming an overall operation route from route segments.

[0060] Figure 6 The overall operation route map is generated.

[0061] Figure 7 This is the generated overall operation route map with starting point.

[0062] Figure 8 This is the overall operation route map generated after optimization.

[0063] Fig. 9 Route segments generated during route planning for irregular plots.

[0064] Fig.10 The transition route map generated during the route planning process for irregular plots.

[0065] Fig.11 The overall operation route map is generated after route planning for special-shaped plots.

[0066] Fig.12 The present invention is used to generate an overall operation route map after performing route planning on a semicircular irregular-shaped plot.

[0067] Fig.13 The present invention is used to generate an overall operation route map after performing route planning on polygonal and irregular-shaped plots. DETAILED DESCRIPTION

[0068] The present invention is further described below in conjunction with four embodiments and drawings, but the embodiments of the present invention are not limited thereto.

[0069] The angle values ​​used in the following embodiments are all expressed as the angle with the north direction. When the value is [-180, 0), it means counterclockwise; when the value is [0, 180], it means clockwise. The distance unit is meter and the angle unit is degree.

[0070] Example 1

[0071] This embodiment is a standard polygonal operation area, and the boundary coordinates of the specified target area A are [[23.165052, 113.35232], [23.165074, 113.352823], [23.164588, 113.352997], [23.164346, 113.352539], [23.164667, 113.352142]]. The specific implementation of the UAV operation route planning includes the following steps, see Figure 1-Figure 5 :

[0072] S1: Operation route parameter preset: preset route angle d = 60°, preset route spacing w = 5m and feeding point H (23.164664, 113.353197); calculate the four vertices of the circumscribed quadrilateral of the target area A: A nw (23.165074,113.352142),A ne (23.165074,113.352997),A se (23.164346,113.352997) and A sw (23.164346,113.352142); Figure 2 shown.

[0073] S2: Fixed reference line segment selection: According to the preset route angle d = 60°, select Anw , A se The diagonal line is used as the fixed reference line segment s[A nw , A se ]=[[23.165074,113.352142],[23.164346,113.352997]]. At the same time, the length l of the fixed reference line segment s and the angle d between the fixed reference line segment s and the true north are calculated. s Calculate the length l of the fixed reference line segment s and the angle d between the fixed reference line segment s and the true north. s The calculation is as follows:

[0074] Point A nw (lat nw ,lon nw ) is A in the embodiment nw (23.165074,113.352142),A se (lat se ,lon se ) is A in the embodiment se (23.164346,113.352997), where the unit is degrees, then the angle d between the fixed reference line segment s and the true north direction s and its length l, can be obtained by the following formula:

[0075] x=sin(lon se -lon nw )*cos(lat se )

[0076] y=cos(lat nw )*sin(lat se )-sin(lat nw )*cos(lat se )*cos(lon nw -lon se )

[0077] d s =a tan2(x,y)*180 / π

[0078]

[0079] The result obtained in the formula is d s ≈132.8, l≈119.1, such as Figure 2 shown.

[0080] S3: Calculate the moving step length: Calculate the moving step length w' according to the following formula:

[0081]

[0082] S4: Boundary intersection generation: Take one end of s as the starting point and move the length w i =2.615+(i-1)*5.23, (i=1,2...) to get point p i ; with p i As the midpoint, generate a line segment m with a direction angle of 60° i , line segment m i The length of the line segment m is 238.2; calculate the line segment m i The coordinates of the intersection point with the boundary of the target area A, and the intersection point is recorded as p ij(j=1,2,3…) , and for the intersection point p ij After sorting, it is recorded as the unit intersection set V i ,like Figure 3 As shown. Among them, i represents the number of moves, j represents the line segment m in this case. i The jth intersection point among the boundary intersection points with the target area A; i4 Indicates line segment m during the i-th movement i There are 4 intersection points with the boundary of target area A.

[0083] Among them, the i-th time is from the moving point p i Generate line segment m i The calculation steps include:

[0084] A1: According to Calculate the i-th moving distance w i , then take one end of the fixed reference line segment s as the starting point and calculate the distance w from the starting point i Point p i ;

[0085] A2: According to step A1 i The coordinates (lat, lon) are calculated relative to p i Point q with direction angle d and distance l i1 The coordinates of (desLat, desLon), where desLat and desLon are calculated as follows:

[0086]

[0087] desLat=arcsin(sin(lat)*cos(radius)+cos(lat)*sin(radius)*cos(d))

[0088] a=sin(d)*sin(radius)*cos(lat)

[0089] β=cos(radius)-sin(lat)*sin(desLat)

[0090]

[0091]

[0092] A3: Use the same calculation method as step A2 to calculate the relative p i Point q with direction angle d' and distance l i2 , where d' is calculated as follows:

[0093]

[0094] A4, based on the point q obtained in step A2 and step A3 i1 and q i2 To generate line segment m i .

[0095] S5: Route segment generation: Repeat step S4 until the moving length w i >l-w' / 2, the unit intersection set V obtained each time i (as shown in the following table) into a set of all intersection points V, and connect all the intersection points in the set of all intersection points V to form a route segment;

[0096]

[0097]

[0098] The formation of the route segment includes the following steps (such as Figure 4 ):

[0099] B1: Take out a unit intersection point set V from all intersection point sets V in order i , and extract the unit intersection set V i Make a judgment; if the number of intersections is less than or equal to 1, delete the intersection coordinates in the unit intersection set, and update the unit intersection set number to the next unit intersection set, and re-execute step B1; if the intersection set is greater than or equal to 2, enter step B2;

[0100] B2: The unit intersection set V i The number of intersections with the unit intersection set V i-1 Compare the number of intersections:

[0101] B21: Determine whether there is route segment L k-1 ; If it does not exist, create a new route segment L k(k=1,2,3…) , if it exists, go to step B22;

[0102] B22: When the unit intersection set V i-1 The unit intersection set V does not exist or is taken out this time i The number of intersections and the last unit intersection set V taken out i-1 When the number of intersection points is equal, take out V i The first two intersection points (i.e., the intersection coordinates p ij 、p i(j+1) ), the two intersection points are used as route segment L k The intersection point enters L k The method is to use j as a reference, alternately adopting ascending or descending order and in the opposite way to the previous intersection entry; otherwise, go to step B23;

[0103] B23: When the unit intersection set V extracted this time appears i The number of intersections and the last unit intersection set V taken out i-1 If the number of intersection points is not equal, it means that the concave area of ​​the target area A appears or disappears, and the unit intersection set V taken out this time is i The i value is recorded in the transition route position temporary storage set R' l(l=1,2,3…) (In the form of a stack, i.e. first in, last out); at this time, calculate the last route segment L k-1 The last intersection coordinates of the last element in the intersection point set V of this unit i , and determine whether the midpoint of the line x is in the target area A:

[0104] If the midpoint of the line x is in the target area A, then the unit intersection set V i The first two intersection points p ij 、p i(j+1) The coordinates of the route segment L k The two intersection points enter L k The method uses j as a reference, alternately adopts ascending or descending order and is opposite to the method of the previous intersection entry, and updates the unit intersection set number to the next unit intersection set; when the unit intersection set V i+1 If it still exists, repeat step B1, otherwise go to step B3;

[0105] If the midpoint of line segment x is outside target area A, then for all current route segments L k Save to route segment collection L' k(k=1,2,3…) and create a new route segment L k+1 ; At the same time, temporarily store the set R' from the transition route position l Take out the first set element i and convert it to the corresponding unit intersection set V i, and repeat step B1;

[0106] B3: After traversing all the intersection points V, save the last route segment L k To route segment set L' k And check the temporary set R' of transition route positions l Is it empty? If it is not empty, take out the first i value and convert it to the corresponding intersection set V i , create a new route segment L k+1 And repeat step B1;

[0107] B4: Set the route segment set L' k Follow the specified steps to connect the drone's overall operating route L.

[0108] In this implementation example, only one route segment L1 is obtained.

[0109] L1=[[23.1650343,113.3523118],[23.1650532,113.3523474],[23.1650579,113.3524540],[23.1649655,113.35228 00],[23.1648967,113.3522482],[23.1650625,113.3525606],[23.1650672,113.3526672],[23.1648279,113.352216 4],[23.1647591,113.3521846],[23.1650718,113.3527738],[23.1650505,113.3528314],[23.1646903,113.3521528],[23.1646463,113.3521676],[23.1650069,113.3528470],[23.1649633,113.3528626],[23.1646149,113.3522064 ],[23.1645836,113.3522452],[23.1649196,113.3528783],[23.1648760,113.3528939],[23.1645522,113.3522839],[23.1645209,113.3523227],[23.1648324,113.3529095],[23.1647887,113.3529251],[23.1644895,113.3523615] ,[23.1644582,113.3524002],[23.1647451,113.3529408],[23.1647015,113.3529564],[23.1644269,113.3524390],[23.1643955,113.3524778],[23.1646578,113.3529720],[23.1646142,113.3529876],[23.1643642,113.3525165]]

[0110] S6: Generate the overall operation route: connect the route segments described in S5, where the route segments are connected to each other through transition routes to generate the overall operation route L of the agricultural drone; where the route segment set L' k The overall operation route L of the UAV is connected to include the following steps (such as Figure 5 ):

[0111] C1: From the route segment set L' kTake out the first route segment L' in order k(k=1) As the starting segment, the coordinates of each intersection point corresponding to the elements therein are sequentially put into the overall operation route L;

[0112] C2: When the route segment set L' k If there are still route segments, calculate the current operating route L and the route segment set L' respectively k The remaining route segments L k The distance between the first intersection coordinate and the last intersection coordinate of the first element and the current operation route L and the route segment set L' k The remaining route segments L k The distance between the first intersection coordinate and the last intersection coordinate of the last element is compared and the route segment L with the smallest distance is selected. k As the next route segment to be connected;

[0113] C3: Put the number of elements contained in the current overall operation route L into the position set R m(m=1,2,3..) In, R m(m=1,2,3..) It is used to record the position of the transition route in the overall operation route L, and then put the route segment to be connected confirmed in step C2 into the current overall operation route L;

[0114] C4: Repeat C2 to C3 until the route segment set L' k When all elements in are traversed, the connection of the overall operation route L is completed. In this embodiment, L is L1, R m is empty, the overall operation route generated is as follows Figure 6 shown.

[0115] S7: Generate the starting point of the overall operation route: First, cut the overall operation route L according to the width w; then calculate the distance between the feeding point H and the first and last endpoints of the overall operation route L according to the coordinates of the feeding point H, and select the end closest to the feeding point H as the starting point of the overall operation route L, or manually specify one end as the starting point of the route (such as Figure 7 ).

[0116] S8: Overall operation route optimization: Adopting the method of targeting the unit intersection set V i Medium ij Repeat steps S4 to S7 for different intersection ordering methods to obtain different overall operation routes, compare the quality of different overall operation routes, and select the optimal overall operation route of the target area A as the final operation route (e.g. Figure 8 ).

[0117] Example 2

[0118] In this embodiment, the target area is an irregular polygon, and the boundary coordinates of the specified target area A are [[23.164709,113.352512], [23.164712,113.352772], [23.164196,113.352776], [23.164199,113.352955], [23.164714,113.352968], [23.164714,113.353626], [23.164515,113.353628], [23.164506,113.3532 09], [23.164383, 113.353208], [23.164386, 113.353626], [23.163965, 113.353634], [23.163961, 113.353374], [23.164252, 113.353366], [23.164248, 113.353179], [23.163966, 113.353181], [23.163968, 113.352516]], the specific implementation of the UAV operation route planning includes the following steps:

[0119] S1: Operation route parameter preset: preset route angle d = 0°, preset route spacing w = 6m and feeding point H (23.16443, 113.352863); calculate the four vertices of the circumscribed quadrilateral of the target area A: A nw (23.164714,113.352512),A ne (23.164714,113.353634),A se (23.163961,113.353634) and A sw (23.163961,113.352512);

[0120] S2: Fixed reference line segment selection: According to the preset route angle d = 0°, select A nw [23.164714,113.352512], A se [23.163961,113.353634] diagonal as a fixed reference line segment; and the same calculation method as in Example 1 is used to calculate the length l≈142.01 of the fixed reference line segment s, the angle d between the fixed reference line segment s and the true north direction s ≈126.13;

[0121] S3: Calculation of moving step length: According to the formula, the moving step length w'≈7.43 is calculated;

[0122] S4: Boundary intersection generation: Take one end of s as the starting point and move the length w i=3.71+(i-1)*7.43, (i=1,2...) to get point p i ; with p i As the midpoint, generate a line segment m with a direction angle of 0° i , line segment m i The length of the line segment m is 284.02; calculate the line segment m i The coordinates of the intersection point with the boundary of area A, and the intersection point is recorded as p ij(j=1,2,3…) , and for the intersection point p ij After sorting, it is recorded as V i ;

[0123] S5: Route segment generation: Repeat step S4 until the moving length w i >l-w' / 2 ends; the corresponding unit intersection set V i , as shown in the following table:

[0124]

[0125]

[0126] The unit intersection set V obtained each time i Put them into all the intersection points set V in turn, connect all the intersection points in the intersection point set V, and form a route segment set L k In this embodiment, three route segments are formed, specifically, route segments L1, L2 and L3. Fig. 9 shown.

[0127] The following are the specific data for each route segment:

[0128] <h2 style=";text-align:left;direction:ltr">L1=[[23.1647093,113.3525413],[23.1639679,113.3525413],[23.1639677,113.35260 00],[23.1647100,113.3526000],[23.1647107,113.3526587],[23.1639676,113.352658 7],[23.1639674,113.3527174],[23.1647114,113.3527174],[23.1641960,113.3527761],[23.1639672,113.3527761],[23.1639670,113.3528348],[23.1641970,113.3528348 ],[23.1641980,113.3528935],[23.1639669,113.3528935],[23.1639667,113.3529522],[23.1641990,113.3529522],[23.1647140,113.3530109],[23.1639665,113.3530109] ,[23.1639663,113.3530696],[23.1647140,113.3530696],[23.1647140,113.3531283],[23.1639662,113.3531283],[23.1642482,113.3531869],[23.1647140,113.3531869]]<h2 style=";text-align:left;direction:ltr"> <h2 style=";text-align:left;direction:ltr">

[0129] <h2 style=";text-align:left;direction:ltr"> L2=[[23.1643833,113.3532456],[23.1642494,113.3532456],[23.1642507,113.3533043],[23.1643837,113.3533043],[23.1643841,113.3533630],[23.1642519,113.3533630],[23.1639617,113.3534217 ],[23.1643845,113.3534217],[23.1643850,113.3534804],[23.1639626,113.3534804],[23.1639635,113.3535391],[23.1643854,113.3535391],[23.1643858,113.3535978],[23.1639644,113.3535978]]<h2 style=";text-align:left;direction:ltr">

[0130] L3=[[23.1647140,113.3532456],[23.1645068,113.3532456],[23.1645080,113.3533043],[23.16471 40,113.3533043],[23.1647140,113.3533630],[23.1645093,113.3533630],[23.1645106,113.3534217 ],[23.1647140,113.3534217],[23.1647140,113.3534804],[23.1645118,113.3534804],[23.1645131,113.3535391],[23.1647140,113.3535391],[23.1647140,113.3535978],[23.1645144,113.3535978]];

[0131] S6: Generate the overall operation route: The route segments are connected to each other through transition routes. According to the route segment connection method in Example 1, it can be obtained that the next route segment to be connected to L1 should be L3, and finally the route segment L2 is connected to form the overall operation route L. The route segments are connected through transition routes and the corresponding transition points are stored in the set R. m In (such as Fig.10 ); The following are the specific data of the overall operation route:

[0132] L=[[23.1647093,113.3525413],[23.1639679,113.3525413],[23.1639677,113.3526000],[23.1647100,113.3526000],[23.1647107,113.3526587],[23.1639676,113.3526587],[23.1639674,113.3527174],[23.1647114,113.3527174],[23.1641960,113.3527761],[23.1639672,113.3527761],[23.1639670,113.3528348],[23.1641970,113.3528348],[23.1641980,113.3528935],[23.1639669,113.3528935],[23.1639667,113.3529522],[23.1641990,113.3529522],[23.1647140,113.3530109],[23.1639665,113.3530109],[23.1639663,113.3530696],[23.1647140,113.3530696],[23.1647140,113.3531283],[23.1639662,113.3531283],[23.1642482,113.3531869],[23.1647140,113.3531869],[23.1647140,113.3532456],[23.1645068,113.3532456],[23.1645080,113.3533043],[23.1647140,113.3533043],[23.1647140,113.3533630],[23.1645093,113.3533630],[23.1645106,113.3534217],[23.1647140,113.3534217],[23.1647140,113.3534804],[23.1645118,113.3534804],[23.1645131,113.3535391],[23.1647140,113.3535391],[23.1647140,113.3535978],[23.1645144,113.3535978],[23.1643833,113.3532456],[23.1642494,113.3532456],[23.1642507,113.3533043],[23.1643837,113.3533043],[23.1643841,113.3533630],[23.1642519,113.3533630],[23.1639617,113.3534217],[23.1643845,113.35342 17],[23.1643850,113.3534804],[23.1639626,113.3534804],[23.1639635,113.3535391],[23.1643854,113.3535391],[23.1643858,113.3535978],[23.1639644,113.3535978]];.

[0133] R m =[24,38].

[0134] S7: Generate the starting point of the overall operation route: According to the coordinate H of the feeding point, calculate the distance between H and the first and last endpoints of the overall operation route L, and select the end closest to the feeding point H as the starting point of the route;

[0135] S8: Overall operation route optimization: In this embodiment, the operation route finally generated is determined by comparing different intersection point sorting methods. Fig.11 shown.

[0136] Example 3

[0137] Example 3 is to use the method of the present invention to plan routes at different angles for a semicircular hollow circular operation area, and the generated operation routes are as follows: Fig.12 shown.

[0138] Example 4

[0139] Example 4 is to use the method of the present invention to plan routes at different angles for a multi-angled irregular plot, and the generated operation routes are as follows: Fig.13 shown.

Claims

1. A method for planning the operation route of an agricultural drone on a special-shaped plot, characterized in that: The following steps are involved: S1: Presetting of operation route parameters: obtaining the boundary coordinates of the target area A; the operation route parameters include width w, route angle d and feeding point H; according to the boundary coordinates of the target area A, calculating and planning the circumscribed quadrilateral of the target area A, and obtaining the four vertices of the circumscribed quadrilateral; S2: Fixed reference line segment selection: According to the route angle d, select a diagonal line corresponding to the circumscribed quadrilateral as the fixed reference line segment s, and calculate the length l of the fixed reference line segment s, the angle d between the fixed reference line segment s and the true north direction. s Perform calculations; S3: Calculation of moving step length: Based on the width w combined with the route angle d and the angle d calculated in step S2 s , calculate the moving step length w' used in the route planning process, where the calculation formula for the moving step length w' is as follows: S4: Boundary intersection generation: Take one end of the fixed reference line segment s as the starting point and move the length w i Then get point p i ; with p i As the midpoint, generate a line segment m with a direction angle of d i , line segment m i The length of the line segment m is 2l; calculate i The coordinates of the intersection point with the boundary of the target area A, and the intersection point is recorded as p ij , j = 1, 2, 3…, and for the intersection point p ij After sorting, it is recorded as the unit intersection set V i ; Among them, the moving length w i The calculation formula is as follows: S5: Route segment generation: Repeat step S4 until the moving length w i >l-w' / 2, the unit intersection set V obtained each time i Integrate into a set of all intersection points V; connect all the intersection points in the set of all intersection points V to form a route segment set L' k ; S6: Generate the overall operation route: connect the route segment set L' in step S5 through the transition route k Each route segment L k , generate the overall operation route L of the agricultural UAV; S7: Generate the starting point of the overall operation route: First, cut the overall operation route L according to the width w; then, according to the feeding point H, calculate the distance between the feeding point H and the first and last endpoints of the overall operation route L, and select the end closest to the feeding point H as the starting point of the overall operation route L; or manually specify one end as the starting point of the overall operation route L; S8: Overall operation route optimization: Adopting the method of targeting the unit intersection set V i Medium ij With different intersection ordering methods, steps S4 to S7 are repeated to obtain different overall operation routes. The qualities of the different overall operation routes are compared, and the optimal overall operation route L of the target area A is selected as the final operation route.

2. The method for planning the operation route of an agricultural drone for an irregular plot of land according to claim 1, characterized in that: In step S1, the four vertices of the circumscribed quadrilateral are recorded as: A nw , A ne , A se and A sw In step S2, when the preset route angle d is greater than or equal to 0° and less than or equal to 90° or greater than or equal to -180° and less than or equal to -90°, select A nw , A se The diagonal line is used as the fixed reference line segment s; when the preset route angle d is greater than 90° and less than 180° or greater than -90° and less than 0°, select A ne and A sw The diagonal line serves as the fixed reference line segment s.

3. The method for planning the operation route of an agricultural drone for an irregular plot of land according to claim 1, characterized in that: In step S4, the i-th moving point p i Generate line segment m i The calculation steps include: A1: According to Calculate the i-th moving distance w i Then, take one end of the fixed reference line segment s as the starting point and calculate the distance w from the starting point i Point p i ; A2: According to step A1 i The coordinates (lat, lon) are calculated relative to p i Point q with direction angle d and distance l i1 The coordinates of (desLat, desLon), where desLat and desLon are calculated as follows: desLat=arcsin(sin(lat)*cos(radius)+cos(lat)*sin(radius)*cos(d)) α=sin(d)*sin(radius)*cos(lat) β=cos(radius)-sin(lat)*sin(desLat) A3: Use the same calculation method as step A2 to calculate the relative p i Point q with direction angle d' and distance l i2 , where d' is calculated as follows: A4: Based on the point q obtained in step A2 and step A3 i1 and q i2 To generate line segment m i .

4. The method for planning the operation route of an agricultural drone for an irregular plot of land according to claim 1, characterized in that: In step S6, the drawing of the overall operation route L includes the formation of route segments and the connection between the route segments, including the following steps: B1: Take out a unit intersection point set V from all intersection point sets V in order i , and extract the unit intersection set V i Make a judgment; if the number of intersections is less than or equal to 1, delete the intersection coordinates in the unit intersection set, and update the unit intersection set number to the next unit intersection set, and re-execute step B1; if the unit intersection set V i If the number of intersections in is greater than or equal to 2, then proceed to step B2; B2: The unit intersection set V i The number of intersections with the last unit intersection set V i-1 Compare the number of intersections: B21: Determine whether there is route segment L k-1 ; If it does not exist, create a new route segment L k , k=1,2,3…, if exists, go to step B22; B22: When the unit intersection set V i-1 The unit intersection set V does not exist or is taken out this time i The number of intersections and the last unit intersection set V taken out i-1 When the number of intersection points is equal, take out V i The first two intersection points p ij 、p i(j+1) The coordinates of the route segment L k The intersection point enters the route segment L k The method uses j as a reference, alternately adopts ascending or descending order and enters the route segment L with the previous intersection point k The opposite way. B23: When the unit intersection set V extracted this time appears i The number of intersections and the last unit intersection set V taken out i-1 If the number of intersection points is not equal, it means that the concave area of ​​the target area A appears or disappears, and the unit intersection set V taken out this time is i The i value is recorded in the transition route position temporary storage set R' l In the example, l = 1, 2, 3…; at this time, calculate the last route segment L k-1 The last intersection coordinates of the last element in the intersection point set V of this unit i , and determine whether the midpoint of the line x is in the target area A: If the midpoint of the line x is in the target area A, then the unit intersection set V i The first two intersection points p ij 、p i(j+1) The coordinates of the route segment L k The two intersection points enter L k The method uses j as a reference, alternately adopts ascending or descending order and enters the route segment L with the previous intersection point k The method is opposite to that of the previous one, and the unit intersection set sequence number is updated to the next unit intersection set; when the unit intersection set V i+1 If it still exists, repeat step B1, otherwise go to step B3; If the midpoint of line segment x is outside target area A, then for all current route segments L k Save to route segment collection L' k In the example, k = 1, 2, 3, ..., and a new route segment L is created. k+1 ; At the same time, temporarily store the set R' from the transition route position l Take out the first set element i and convert it to the corresponding unit intersection set V i , and repeat step B1; B3: After traversing all the intersection points V, save the last route segment L k To route segment set L' k And check the temporary set R' of transition route positions l Is it empty? If it is not empty, take out the first i value and convert it to the corresponding unit intersection set V i , create a new route segment L k+1 And repeat step B1; B4: Set the route segment set L' k Follow the specified steps to connect the drone's overall operating route L.

5. The method for planning the operation route of an agricultural drone for an irregular plot of land according to claim 4, characterized in that: In step B4, the route segment set L' k The steps to connect the overall operation route L of the drone are: C1: From the route segment set L' k Take out the first route segment L in order k As the starting segment, at this time k = 1, the coordinates of each intersection point corresponding to the elements therein are sequentially put into the overall operation route L; C2: When the route segment set L' k There is still a route segment L k , respectively calculate the current overall operation route L and route segment set L' k The remaining route segments L k The distance between the first intersection coordinate and the last intersection coordinate of the first element and the current overall operation route L and route segment set L' k The remaining route segments L k The distance between the first intersection coordinate and the last intersection coordinate of the last element is compared and the route segment L with the smallest distance is selected. k As the next route segment to be connected; C3: Put the number of elements contained in the current overall operation route L into the position set R m In the formula, m=1,2,3…, R m It is used to record the position of the transition route in the overall operation route L, and then put the route segment to be connected confirmed in step C2 into the current overall operation route L; C4: Repeat steps C2 to C3 until the route segment set L' k When all elements in are traversed, the final overall operation of connecting routes L is completed.

6. The method for planning the operation route of an agricultural drone for a special-shaped plot of land according to claim 5, characterized in that: In step S7, the entire operation route L is cut, and the L in the entire operation route L is determined by a recursive calculation method. n and L n+1 Is the distance less than the preset parameter width w, where n = 1, 3, 5..., if it is less than, delete the corresponding L n and L n+1 , and refresh the position set R m The values ​​in are calculated recursively until L in the overall operation route L is n and L n+1 When the distances are all greater than the preset parameter width w, the cutting is completed; after the starting point of the overall operation route L is determined, if the starting point is the tail end of the overall operation route L, the points in the overall operation route L are reversed, that is, the original first point becomes the last point, the second point becomes the second to last point, and so on, and the length of the current starting point of the overall operation route L from the feeding point H and the total length of the overall operation route are recorded.

7. The method for planning the operation route of an agricultural drone for a special-shaped plot of land according to claim 1, characterized in that: In step S4, the unit intersection set V i There are four ways to sort the intersection coordinates: 1) from small to large latitude, 2) from large to small latitude, 3) from small to large longitude, 4) from large to small longitude.

8. The method for planning the operation route of an agricultural drone for a special-shaped plot of land according to claim 1, characterized in that: In step S8, the quality comparison of the overall operation route includes the following evaluation indicators: the distance between the starting point of the overall operation route and the feeding point, the length of the transition route, and the number of line changes.

9. The method for planning the operation route of an agricultural drone for a special-shaped plot of land according to claim 1, characterized in that: The boundary coordinates of the target area A are obtained by manual designation, ground station marking or flight marking.