Flight path planning method, device, aircraft and storage medium
By dividing the flight path into multiple sub-path segments in parallel, and using preset and shortest path algorithms to correct it, the problem of long-term aircraft path planning in the prior art is solved, and efficiency is improved.
Patent Information
- Application Number
- CN202011383495.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-12-01
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2040-12-01
AI Technical Summary
The flight path planning of existing aircraft takes a long time and cannot meet the rapid processing needs of complex tasks.
By dividing the path between the flight start point and the end point into multiple sub-path segments, planning obstacle avoidance in parallel, modifying the sub-path segments using preset algorithms and shortest path problem algorithms to form the target flight path.
It greatly improves the working efficiency of path planning and solves the problem of time-consuming aircraft flight path planning.
Smart Images

Figure CN114578843B_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of aircraft technology, and in particular to a flight path planning method, device, aircraft and storage medium. Background Art
[0002] At present, unmanned aerial vehicles play an important role in aerial photography, agriculture, plant protection, micro selfies, express delivery, disaster relief, wildlife observation, infectious disease monitoring, surveying and mapping, news reporting, power inspection, disaster relief, film and television shooting, etc. However, as the complexity of tasks continues to increase, path planning becomes crucial.
[0003] Existing path planning methods all use optimization or heuristic algorithms for planning. These methods can only run calculations one by one during the processing and calculation process, and path planning is time-consuming. Summary of the invention
[0004] The purpose of the embodiments of the present disclosure is to provide a flight path planning method, device, aircraft and storage medium, so as to at least solve the problem that the existing aircraft flight path planning is time-consuming.
[0005] The technical solution of the present disclosure is as follows:
[0006] According to a first aspect of an embodiment of the present disclosure, a flight path planning method is provided, including: obtaining a flight application airspace, a flight starting point, and a flight destination; determining a plurality of sub-path segments from the flight starting point to the flight destination according to a preset algorithm, wherein a starting point and an end point of each of the plurality of sub-path segments are outside a no-fly zone in the application airspace, the plurality of sub-path segments are sequentially connected to form a complete path from the flight starting point to the flight destination, and the length of each of the plurality of sub-path segments is less than a preset length; determining a target flight path from the flight starting point to the flight destination according to the plurality of sub-path segments.
[0007] Furthermore, multiple sub-path segments from the flight starting point to the flight endpoint are determined according to a preset algorithm, including: determining at least one first position point between the flight starting point and the flight endpoint that meets preset conditions according to a preset method; iteratively performing the following steps: determining a target position point that meets preset conditions between every two adjacent second position points between the flight starting point and the flight endpoint based on a preset method, until the distance between every two adjacent position points is less than a preset distance; the second position points include the first position point, the flight starting point, and the flight endpoint; and determining multiple sub-path segments based on every two adjacent second position points.
[0008] Furthermore, a target position point between the flight starting point and the flight end point that meets preset conditions is determined according to a preset method, specifically including: determining the midpoint between the flight starting point and the flight end point; judging whether the midpoint is within the no-fly zone; and determining the midpoint as the target position point based on the midpoint being outside the no-fly zone.
[0009] Furthermore, after determining whether the midpoint is within the no-fly zone, the method further includes: based on the midpoint being within the no-fly zone, translating the midpoint within the applied airspace to outside the no-fly zone to obtain a second position point.
[0010] Furthermore, based on the multiple sub-path segments, a target flight path from the flight starting point to the flight end point is determined, including: using a shortest path problem algorithm to correct each of the multiple sub-path segments to obtain multiple corrected sub-path segments; and connecting the multiple corrected sub-path segments in sequence to obtain the target flight path from the flight starting point to the flight end point.
[0011] Furthermore, before determining the multiple sub-path segments from the flight starting point to the flight end point according to a preset algorithm, the method also includes: obtaining an airspace restriction area; and updating a no-fly zone of the applied airspace according to the airspace restriction area.
[0012] Furthermore, before determining the multiple sub-path segments from the flight starting point to the flight end point according to a preset algorithm, the method also includes: acquiring an existing flight path; and updating a no-fly zone in the applied airspace according to the existing flight path.
[0013] According to a second aspect of an embodiment of the present disclosure, a flight path planning device is provided, which may include: an acquisition module, used to acquire a flight application airspace, a flight starting point and a flight destination; a sub-path segment division module, used to determine a plurality of sub-path segments from the flight starting point to the flight destination according to a preset algorithm, wherein a starting point and an end point of each of the plurality of sub-path segments are outside a no-fly zone in the application airspace, and the plurality of sub-path segments are sequentially connected to form a complete path from the flight starting point to the flight destination, and a length of each of the plurality of sub-path segments is less than a preset length; and a path planning module, used to determine a target flight path from the flight starting point to the flight destination according to the plurality of sub-path segments.
[0014] According to a fourth aspect of an embodiment of the present disclosure, an electronic device is provided, which may include: a processor; a memory for storing processor executable instructions; wherein the processor is configured to execute instructions to implement a flight path planning method as shown in any one of the embodiments of the first aspect.
[0015] According to the fourth aspect of an embodiment of the present disclosure, a storage medium is provided. When the instructions in the storage medium are executed by a processor of an information processing device or a server, the information processing device or the server can implement a flight path planning method as shown in any one of the embodiments of the first aspect.
[0016] The technical solution provided by the embodiments of the present disclosure brings at least the following beneficial effects:
[0017] The disclosed embodiment divides the flight path between the starting point and the end point into multiple sub-paths, thereby enabling parallel planning of multiple sub-paths for obstacle avoidance, greatly improving the efficiency of path planning, and thus solving the problem of time-consuming flight path planning for aircraft in the prior art.
[0018] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] The drawings herein are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the description are used to explain the principles of the present disclosure, and do not constitute improper limitations on the present disclosure.
[0020] Figure 1 is a schematic diagram of a flight path planning method flow chart according to an exemplary embodiment;
[0021] Figure 2 is a schematic diagram of a method for planning a flight path for a drone according to an exemplary embodiment;
[0022] Figure 3 is a schematic diagram of a sub-path generation process according to an exemplary embodiment;
[0023] Figure 4 is a schematic diagram of an aircraft structure according to an exemplary embodiment;
[0024] Figure 5 It is a schematic diagram of the aircraft hardware structure according to an exemplary embodiment. DETAILED DESCRIPTION
[0025] In order to enable ordinary persons in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings.
[0026] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.
[0027] like Figure 1 As shown, in a first aspect of an embodiment of the present disclosure, a flight path planning method is provided, characterized in that it includes:
[0028] Step 100: Obtain the flight application airspace, flight starting point and flight destination;
[0029] Step 200: determining a plurality of sub-path segments from the flight start point to the flight end point according to a preset algorithm, wherein the start point and the end point of each of the plurality of sub-path segments are outside the no-fly zone of the applied airspace, the plurality of sub-path segments are sequentially connected to form a complete path from the flight start point to the flight end point, and the length of each of the plurality of sub-path segments is less than a preset length;
[0030] Step 300: Determine a target flight path from a flight start point to a flight end point based on a plurality of sub-path segments.
[0031] The above-mentioned embodiment method divides the flight path between the starting point and the end point into multiple sub-paths, thereby realizing parallel planning of multiple sub-paths for obstacle avoidance, greatly improving the work efficiency of path planning, and thus solving the problem of time-consuming flight path planning of aircraft in the prior art.
[0032] In some optional embodiments of the present application, a plurality of sub-path segments from a flight start point to a flight end point are determined according to a preset algorithm, including:
[0033] Determine at least one first position point between the flight starting point and the flight end point that meets the preset conditions according to a preset method;
[0034] Iteratively perform the following steps: determine a target position point that meets a preset condition between every two adjacent second position points between a flight start point and a flight end point based on a preset method, until the distance between every two adjacent position points is less than a preset distance; the second position points include the first position point, the flight start point, and the flight end point;
[0035] A plurality of sub-path segments are determined according to every two adjacent second position points.
[0036] In some optional embodiments of the present application, determining a target location point between a flight start point and a flight end point that meets preset conditions according to a preset method specifically includes:
[0037] Determine the midpoint between the flight start and flight end;
[0038] Determine whether the midpoint is within the no-fly zone;
[0039] Based on the fact that the midpoint is outside the no-fly zone, the midpoint is determined to be the target location point.
[0040] In some optional embodiments of the present application, after determining whether the midpoint is within the no-fly zone, the method further includes:
[0041] Based on the fact that the midpoint is within the no-fly zone, the midpoint is translated to outside the no-fly zone within the applied airspace to obtain a second position point.
[0042] In some optional embodiments of the present application, determining a target flight path from a flight start point to a flight end point according to a plurality of sub-path segments includes:
[0043] Using the shortest path problem algorithm to correct each of the multiple sub-path segments, a plurality of corrected sub-path segments are obtained;
[0044] Multiple corrected sub-path segments are connected in sequence to obtain the target flight path from the flight start point to the flight end point.
[0045] In some optional embodiments of the present application, before determining the plurality of sub-path segments from the flight start point to the flight end point according to a preset algorithm, the method further includes:
[0046] Obtain airspace restricted areas;
[0047] Update the no-fly zone in the applied airspace according to the airspace restriction zone.
[0048] In some optional embodiments of the present application, before determining the plurality of sub-path segments from the flight start point to the flight end point according to a preset algorithm, the method further includes:
[0049] Get the existing flight path;
[0050] Update the no-fly zone of the requested airspace based on the existing flight path.
[0051] According to a second aspect of an embodiment of the present disclosure, a flight path planning device is provided, which may include:
[0052] The acquisition module is used to obtain the flight application airspace, flight starting point and flight destination;
[0053] A sub-path segment division module is used to determine a plurality of sub-path segments from a flight start point to a flight end point according to a preset algorithm, wherein a start point and an end point of each of the plurality of sub-path segments are outside a no-fly zone of the applied airspace, the plurality of sub-path segments are sequentially connected to form a complete path from the flight start point to the flight end point, and the length of each of the plurality of sub-path segments is less than a preset length;
[0054] The path planning module is used to determine the target flight path from the flight start point to the flight end point based on multiple sub-path segments.
[0055] In a specific embodiment of the present application, the path planning of the drone is carried out. First, the data storage design of the flight path planning device is introduced. Since the path planning of the drone cluster needs to consider obstacles, no-fly zone constraints, and the paths between drones do not conflict, it is necessary to design an airspace restriction table, an airspace application table, and a flight path table. The specific design is as follows:
[0056] Table 1 Airspace restrictions
[0057]
[0058] As shown in Table 1, the airspace restriction table stores information on areas where drones are prohibited from flying, such as building obstacles, no-fly zones, and dangerous areas. A status of 0 indicates valid, and -1 indicates invalid. The initial status value is 0. Once it is changed to -1, it means that the record is invalid and cannot be changed back to 0.
[0059] Table 2 Airspace Application Form
[0060]
[0061]
[0062] As shown in Table 2, the airspace application table stores the area information applied for by the drone to perform flight missions, where the status is 0 for valid and -1 for invalid. The initial status value is 0. Once it is changed to -1, it means that the record is invalid and cannot be changed back to 0. The restricted airspace field stores all restricted airspace IDs contained in the applied airspace. If the field is empty, it means that the applied airspace has no restricted airspace. Since no-fly zones may be added or changed, this field needs daily maintenance. In addition, the scope of the applied airspace can be adjusted, but the independence of the applied airspace must be guaranteed, that is, there is no intersection between the two applied airspaces.
[0063] Table 3 Flight path table
[0064]
[0065]
[0066] As shown in Table 3, the flight path table stores the flight path information of the drone, where the status is 0 for valid and -1 for invalid. The initial status value is 0. Once it is changed to -1, it means that the record is invalid and cannot be changed back to 0. The flight path is strongly associated with the applied airspace. If the applied airspace corresponding to the flight path is invalid, the flight path will also be automatically invalid. The flight path field uses a number of points in a tuple composed of latitude, longitude and altitude to represent the flight path of the drone. Each flight path corresponds to a unique applied airspace ID.
[0067] The above data storage design only contains essential information. In practice, other information can be added as needed, and the data format can also be different as long as the logic is consistent.
[0068] like Figure 2 As shown, specifically, the UAV flight path planning method includes:
[0069] 1) Enter the airspace you apply for, the starting point, and the end point.
[0070] 2) Obtain the no-fly zone by applying for airspace restriction information of the airspace.
[0071] 3) Update the no-fly zone based on the existing flight path.
[0072] 4) Convert the applied airspace and no-fly zone data into a three-dimensional coordinate system.
[0073] 5) Generate multiple sub-paths from the starting point to the end point through an algorithm.
[0074] 6) Use the MA-ESPO algorithm to correct all subpaths.
[0075] 7) Output the flight path.
[0076] The following is a detailed description of each step
[0077] 1. Enter the airspace, starting point and end point
[0078] Before planning the flight path, you need to enter the applied airspace, starting point, and end point. The applied airspace information should be entered into the system in advance.
[0079] 2. Obtain the no-fly zone by applying for airspace restriction information of the airspace
[0080] According to the restricted airspace field in the applied airspace table, search the restricted airspace ID in the airspace restriction table to obtain the corresponding restricted airspace range. If the applied airspace corresponds to multiple restricted airspace IDs, all restricted airspace ranges need to be found.
[0081] 3. Update no-fly zones based on existing flight paths
[0082] The ID of the applied airspace is searched in the flight path table according to the ID of the applied airspace to obtain all existing flight paths of the applied airspace.
[0083] 4. Convert the airspace application and no-fly zone data into a three-dimensional coordinate system
[0084] The data of applied airspace and no-fly zone are converted into a three-dimensional coordinate system, taking the starting point as the origin. The no-fly zone in step 2 is converted into an area in the three-dimensional coordinate system, and the points of the existing flight path are converted into points in the three-dimensional coordinate system in step 3.
[0085] 5. Generate multiple sub-paths from the starting point to the end point through the algorithm
[0086] Figure 3 The specific steps for the generated subpath are as follows:
[0087] (1) Enter the coordinates of the starting point and the end point.
[0088] (2) Calculate the midpoint coordinates between the starting point and the end point.
[0089] (3) Determine whether the midpoint is in the no-fly zone. The judgment rule is: the point is in the no-fly airspace, the distance between the point and the boundary of the no-fly airspace is less than a threshold a, and the distance between the point and the existing path is less than a threshold a. If any of these conditions are met, the point is in the no-fly zone and then proceeds to step (4). Otherwise, jump to step (5).
[0090] (4) The midpoint is translated along longitude and latitude for a certain distance. The translation logic is: when the point is in the no-fly airspace or the distance between the point and the boundary of the no-fly airspace is less than a threshold a, the point is translated along the longitude or latitude of the nearest boundary toward the direction outside the no-fly airspace until the distance from the boundary is equal to threshold a; when the distance between the point and an existing path is less than a threshold a, the point is translated along the longitude or latitude in the direction farther from the path until the distance from the path is equal to threshold a. If there are multiple objects to be avoided, multiple translations are required until all objects are avoided.
[0091] (5) The coordinates of the midpoint that does not need to be translated or after translation, the coordinates of the starting point, and the coordinates of the end point are saved as two sub-paths, one of which has the original starting point and the end point as the midpoint of this calculation; the other has the midpoint of this calculation and the end point as the original end point.
[0092] (6) Substitute the coordinates of the starting point and the end point of the generated subpath into steps (1) to (5) to generate new subpaths in a loop until the length of all subpaths is less than or equal to a threshold value b, and save all subpaths.
[0093] 6. Use the MA-ESPO algorithm to correct all subpaths
[0094] Take the intercepts of all subpaths generated in the previous step according to the coordinate axis, and each subpath will get its own subspace. The subspaces do not intersect each other and are adjacent, and the coordinate values of the subspaces are consistent with the original coordinate system. Then, the MA-ESPO algorithm needs to be used to correct all subpaths. MA-ESPO is a shortest path problem algorithm based on the grid-based Euclidean obstacle space. The subspace needs to be converted into a three-dimensional grid point set space, which is a rectangular structure i×j×k, i.e., i columns, j rows, and k layers, and each grid unit is a unit cube. Each subspace is converted based on its own coordinate value, and the result value of the grid point set space calculation can be converted back to the atomic space.
[0095] The following is an introduction to the law of distance propagation under the (2n+1)×(2n+1)×(2n+1) template: This template stores the scale basis between grids in the (2n+1)×(2n+1)×(2n+1) neighborhood grid space, that is, the grid distance, which is convenient for grid distance calculation; (0,0,0) is the coordinate origin in the (2n+1)×(2n+1)×(2n+1) neighborhood, Δ ijk Indicates the distance offset of point (i,j,k) from (0,0,0), expressed in d ijk represents the minimum distance between (i,j,k) and the starting point. The propagation distance from point (i,j,k) to point (0,0,0) is d. 000 The distance is d ijk +Δ ijk , considering the (2n+1)×(2n+1)×(2n+1) neighborhood around each point, in fact, the actual distance value of each point in space is determined by its neighborhood (2n+1) 3 The distance value of the -1 point is obtained by comparison and calculation. Therefore, d 000 =min(d ijk +Δ ijk ), (-n<=i<=n,-n<=j<=n,-n<=k<=n).
[0096] The implementation process of the MA-ESPO algorithm is as follows:
[0097] 1) Initialize the (2n+1)×(2n+1)×(2n+1) template;
[0098] 2) Initialize all nodes in the space: Scan the entire space from high to low, from front to back, and from left to right. Convert the value of each node into the DataInfo_3D structure. When encountering the starting point, set its distance value Power to 0, and the distance value Power of other points to a sufficiently large integer;
[0099] 3) Scan the DataInfo_3D of each node in the space from high to low, from front to back, and from left to right. For each node (x, y, z), examine the (2n+1)×(2n+1)×(2n+1) neighborhood structure around it. For each (i, j, k) in the template (-n<=i<=n, -n<=j<=n, -n<=k<=n), if there is no obstacle mark on the path from the node (x, y, z) to the point (x+i, y+j, z+k), assign Newd=d x+i,y+j,z+k +Δ ijk , compare Newd with the current distance value d x,y,z , if Newd <d x,y,z Then record the coordinates of (x+i, y+j, z+k) and update the d of the current point x,y,z For Newd:
[0100] DataInfo_3D[x][y][z].x=x+i;
[0101] DataInfo_3D[x][y][z].y=y+j;
[0102] DataInfo_3D[x][y][z].z=z+k;
[0103] DataInfo_3D[x][y][z].Power=Newd;
[0104] 4) Scan the DataInfo_3D of each node in the space in reverse order from low to high, from back to front, and from right to left. The comparison and calculation of the node data are similar to 3);
[0105] 5) If the value of a node in 3) or 4) has been modified, jump to 3) and scan the spatial data again until the distance value of the spatial data point no longer changes.
[0106] During the calculation process of the MA-ESPO algorithm, for each point in the space, the source point of its propagation has been recorded in the (2n+1)×(2n+1)×(2n+1) neighborhood centered on it. Therefore, in the end, it is possible to trace back from the end point to the starting point to obtain the shortest path from the starting point to the end point.
[0107] 7. Output flight path
[0108] First, convert the points of each sub-path to the original three-dimensional coordinate system, and then convert the node coordinates of all paths to longitude, latitude and altitude, and save them as output values in the flight path table.
[0109] The above specific embodiment proposes a data storage design for an airspace restriction table, an airspace application table, and a flight path table, which plays an important role in drone path planning:
[0110] First, the airspace application form specifies the flight range of the drone. At the same time, since there is no intersection between the applied airspaces, the flight paths between different applied airspaces do not intersect, ensuring the safety of drone flight.
[0111] Second, the airspace restriction table specifies the no-fly zones for drones, and the flight path table stores the planned flight paths for the applied airspace. When planning the path, obstacles can be avoided according to the corresponding restrictions.
[0112] Third, the areas in the airspace restriction table and airspace application form are set as regular areas, which is conducive to distance judgment in the path planning process and simplifies the complexity of calculation.
[0113] In addition, the above embodiment generates an algorithm for sub-paths according to the starting point and the end point of the path. The algorithm divides the original starting point and the end point into several sub-paths, and then uses the MA-ESPO algorithm to calculate the shortest path of the starting point and the end point of each sub-path. This has two advantages:
[0114] First, the problem that originally required grid division calculation in a large spatial area is transformed into grid division calculation in several small subspaces. In fact, even if all the subspaces are added together, they are much smaller than the original space. This greatly reduces the amount of calculation of the MA-ESPO algorithm and improves the calculation efficiency.
[0115] Second, since the subspaces where the subpaths are located do not intersect with each other and are independent of each other, the MA-ESPO algorithm can be used to calculate each subpath in parallel, thereby further improving the overall efficiency of the entire path calculation.
[0116] Compared with the manual marking method, the above-mentioned embodiment method saves labor costs to a great extent, and leaves a large amount of work to the system to complete, while avoiding the risk of errors that may occur in manual operation. In addition, the system work can be carried out during idle periods such as at night, thereby further improving work efficiency.
[0117] Compared with the path planning of a single UAV using only a path algorithm, the above embodiment realizes the planning of the flight path of a large-scale UAV cluster by combining data storage technology with the algorithm. On the other hand, the working efficiency of the original path algorithm is greatly improved through the sub-path algorithm. With the continuous development of UAV technology, UAVs are increasingly used in various industry applications. This method is of great significance to the future development and progress of UAVs.
[0118] The data storage design and sub-path algorithm of the above method are conducive to improving the parallelism of the system. On the one hand, because the application airspaces do not intersect, multiple paths can be planned simultaneously in different application airspaces; on the other hand, due to the mutual independence of the sub-paths, all sub-paths can also be planned at the same time.
[0119] Optional, such as Figure 4 As shown, an embodiment of the present application also provides an aircraft 400, including a processor 401, a memory 402, and a program or instruction stored in the memory 402 and executable on the processor 401. When the program or instruction is executed by the processor 401, each process of the above-mentioned spatiotemporal data processing method embodiment is implemented, and the same technical effect can be achieved. To avoid repetition, it will not be described here.
[0120] Figure 5 A schematic diagram of the hardware structure of an aircraft for implementing an embodiment of the present application.
[0121] The aircraft 500 includes but is not limited to components such as a radio frequency unit 501 , a network module 502 , an audio output unit 503 , an input unit 504 , a sensor 505 , a display unit 506 , a user input unit 507 , an interface unit 508 , a memory 509 , and a processor 510 .
[0122] Those skilled in the art will appreciate that the aircraft 500 may also include a power source (such as a battery) for supplying power to various components, and the power source may be logically connected to the processor 510 through a power management system, thereby implementing functions such as managing charging, discharging, and power consumption management through the power management system. Figure 5 The aircraft structure shown in the figure does not constitute a limitation of the aircraft. The aircraft may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently, which will not be described in detail here.
[0123] It should be understood that in the embodiment of the present application, the input unit 504 may include a graphics processor (GPU) 5041 and a microphone 5042, and the graphics processor 5041 processes the image data of the static picture or video obtained by the image capture device (such as a camera) in the video capture mode or the image capture mode. The display unit 506 may include a display panel 5061, and the display panel 5061 may be configured in the form of a liquid crystal display, an organic light emitting diode, etc. The user input unit 507 includes a touch panel 5071 and other input devices 5072. The touch panel 5071 is also called a touch screen. The touch panel 5075 may include two parts, a touch detection device and a touch controller. Other input devices 5072 may include but are not limited to a physical keyboard, a function key (such as a volume control button, a switch button, etc.), a trackball, a mouse, and a joystick, which will not be repeated here. The memory 509 can be used to store software programs and various data, including but not limited to applications and operating systems. The processor 510 can integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, the user interface, and the application program, and the modem processor mainly processes wireless communication. It is understandable that the above-mentioned modem processor may not be integrated into the processor 510.
[0124] An embodiment of the present application also provides a readable storage medium, on which a program or instruction is stored. When the program or instruction is executed by a processor, the various processes of the above-mentioned spatiotemporal data processing method embodiment are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.
[0125] The processor is the processor in the aircraft described in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.
[0126] An embodiment of the present application further provides a chip, which includes a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the various processes of the above-mentioned spatiotemporal data processing method embodiment, and can achieve the same technical effect. To avoid repetition, it will not be repeated here.
[0127] It should be understood that the chip mentioned in the embodiments of the present application can also be called a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.
[0128] It should be noted that, in this article, the terms "comprise", "include" or any other variant thereof are intended to cover non-exclusive inclusion, so that the process, method, article or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise one..." do not exclude the presence of other identical elements in the process, method, article or device including the element. In addition, it should be pointed out that the scope of the methods and devices in the embodiments of the present application is not limited to performing functions in the order shown or discussed, and may also include performing functions in a substantially simultaneous manner or in reverse order according to the functions involved, for example, the described method may be performed in an order different from that described, and various steps may also be added, omitted, or combined. In addition, the features described with reference to certain examples may be combined in other examples.
[0129] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, a magnetic disk, or an optical disk), and includes a number of instructions for a terminal (which can be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the methods described in each embodiment of the present application.
[0130] The embodiments of the present application are described above in conjunction with the accompanying drawings, but the present application is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the guidance of the present application, ordinary technicians in this field can also make many forms without departing from the purpose of the present application and the scope of protection of the claims, all of which are within the protection of the present application.
Claims
1. A flight path planning method, characterized in that: include: Obtain flight application airspace, flight starting point and flight destination; Determine a plurality of sub-path segments from the flight start point to the flight end point according to a preset algorithm, wherein the start point and the end point of each of the plurality of sub-path segments are outside the no-fly zone of the applied airspace, the plurality of sub-path segments are sequentially connected to form a complete path from the flight start point to the flight end point, and the length of each of the plurality of sub-path segments is less than a preset length; Determining a target flight path from the flight starting point to the flight end point according to the plurality of sub-path segments; The determining of the plurality of sub-path segments from the flight starting point to the flight end point according to a preset algorithm comprises: Determine at least one first position point between the flight starting point and the flight end point that meets a preset condition according to a preset method; Iteratively perform the following steps: determine a target position point that meets a preset condition between every two adjacent second position points between the flight starting point and the flight end point based on the preset method, until the distance between every two adjacent position points is less than a preset distance; the second position points include the first position point, the flight starting point, and the flight end point; Determine a plurality of sub-path segments according to each two adjacent second position points; The step of determining a target position point between the flight starting point and the flight end point that meets a preset condition according to a preset method specifically includes: Determine the midpoint between the flight start point and the flight end point; Determining whether the midpoint is within a no-fly zone; Based on the midpoint being outside the no-fly zone, determining the midpoint as a target location point; After determining whether the midpoint is within the no-fly zone, the method further includes: Based on the fact that the midpoint is within the no-fly zone, the midpoint is translated within the applied airspace to outside the no-fly zone to obtain a second position point.
2. The method according to claim 1, characterized in that The step of determining a target flight path from the flight starting point to the flight end point according to the plurality of sub-path segments comprises: Using a shortest path problem algorithm to correct each of the multiple sub-path segments to obtain multiple corrected sub-path segments; The multiple corrected sub-path segments are sequentially connected to obtain a target flight path from the flight starting point to the flight end point.
3. The method according to any one of claims 1 to 2, characterized in that: Before determining the plurality of sub-path segments from the flight starting point to the flight end point according to a preset algorithm, the method further includes: Obtain airspace restricted areas; The no-fly zone of the applied airspace is updated according to the airspace restriction zone.
4. The method according to any one of claims 1 to 2, characterized in that: Before determining the plurality of sub-path segments from the flight starting point to the flight end point according to a preset algorithm, the method further includes: Get the existing flight path; The no-fly zone of the applied airspace is updated according to the existing flight path.
5. A flight path planning device, characterized in that: include: The acquisition module is used to obtain the flight application airspace, flight starting point and flight destination; A sub-path segment division module, used for determining a plurality of sub-path segments from the flight starting point to the flight end point according to a preset algorithm, wherein the starting point and the end point of each of the plurality of sub-path segments are outside the no-fly zone of the applied airspace, the plurality of sub-path segments are sequentially connected to form a complete path from the flight starting point to the flight end point, and the length of each of the plurality of sub-path segments is less than a preset length; A path planning module, used to determine a target flight path from the flight starting point to the flight end point according to the plurality of sub-path segments; The path planning module is specifically used to determine at least one first position point between the flight starting point and the flight end point that meets the preset conditions according to a preset method; iteratively perform the following steps: determine a target position point between every two adjacent second position points between the flight starting point and the flight end point that meets the preset conditions based on the preset method, until the distance between every two adjacent position points is less than the preset distance; the second position points include the first position point, the flight starting point, and the flight end point; determine multiple sub-path segments according to every two adjacent second position points; A path planning module, specifically used to determine the midpoint between the flight start point and the flight end point; Determining whether the midpoint is within the no-fly zone; and determining that the midpoint is a target location point based on the midpoint being outside the no-fly zone; The path planning module is also used to, after determining whether the midpoint is within the no-fly zone, translate the midpoint within the applied airspace to outside the no-fly zone based on the midpoint being within the no-fly zone to obtain a second position point.
6. An aircraft, characterized in that: include: processor; a memory for storing instructions executable by the processor; The processor is configured to execute the instructions to implement the flight path planning method as described in any one of claims 1-4.
7. A storage medium, characterized in that: When the instructions in the storage medium are executed by a processor of an information processing device or a server, the information processing device or the server implements the flight path planning method as described in any one of claims 1 to 4.
