Unmanned aerial vehicle route planning method based on spatial geometrical characteristics
A track planning and geometric feature technology, applied in three-dimensional position/course control, non-electric variable control, instruments, etc., can solve problems such as difficult to accurately give the optimal track planning route
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0047] For a UAV, when it is assumed that its limited flight height is a fixed height, we can map the planning space to a two-dimensional space, such as image 3 shown. exist image 3 Among them, according to the algorithm provided by the present invention, first of all, we can easily imagine that the starting coordinates of the drone (x 1 ,y 1 ) changes to (0,0), and the coordinates of the end point change to (x m ,y m ), then the equation of the straight line connecting the start point to the end point is: y m x-x m y=0. Suppose (x m ,y m )=(5,6), the coordinates of the center of the threat area 1 are The coordinates of the center of the threat area 2 are And the radius of the threat area circle is r 1 = r 2 =2, then the straight line equation from the starting point to the end point is: 6x-5y=0. The distance from point (2,8) to line: 6x-5y=0 is: Similarly, the distance from point (4,4) to line: 6x-5y=0 is: Then according to Algorithm 1, the optimal path i...
Embodiment 2
[0049] For a UAV, when it is assumed that its limited flight height is a fixed height, we can map the planning space to a two-dimensional space, such as Figure 4 shown. exist Figure 4 Among them, according to the algorithm provided by the present invention, first of all, we can easily imagine that the starting coordinates of the drone (x 1 ,y 1 ) changes to (0,0), and the coordinates of the end point change to (x m ,y m ), then the equation of the straight line connecting the start point to the end point is: y m x-x m y=0. Suppose (x m ,y m )=(5,5), the coordinates of the center of the threat area 1 are The coordinates of the center of the threat area 2 are And the radius of the threat area circle is r 1 = r 2 =1, then the equation of the straight line from the start point to the end point is: x-y=0. The distance from the point (3.414,2)) to the line: x-y=0 is: Similarly, the distance from the point (2,3.414) to the line: x-y=0 is: Then according to Algori...
Embodiment 3
[0051] For a UAV, when it is assumed that its flight height is not fixed, its planning space is a 3-dimensional space, such as Figure 5 shown. exist Figure 5 Among them, according to the algorithm provided by the present invention, first of all, we can easily imagine that the starting coordinates of the drone (x 1 ,y 1 ,z 1 ) changes to (0,0,0), and the coordinates of the end point change to (x m ,y m ,z m ). Suppose (x m ,y m ,z m )=(5,5,5), r 1 = 2 =1. From the points (2.5,0.5,1) and (0.5,2.5,2) to the connection (x 1 ,y 1 ,z 1 ) and (x m ,y m ,z m ) distances of the straight lines are greater than 1, then the optimal path is the straight line from the starting point to the end point of the UAV, such as Figure 5 shown in the straight line. Similarly, for a threat area in three-dimensional space that covers a straight line from the starting point to the focal point, its optimal path calculation method can be imitated as shown in Embodiment 2.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


