Unmanned aerial vehicle three-dimensional path planning method and system based on Beidou grid code
Through the combination of Beidou grid code and A* algorithm, the shortcomings of drones' positioning accuracy and path planning in complex environments are solved, efficient and safe three-dimensional path planning is achieved, and the drone is improved in complex environments. flight ability.
Patent Information
- Application Number
- CN202411005946.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-25
- Publication Date
- 2024-11-12
AI Technical Summary
The existing UAV path planning technology lacks positioning accuracy in complex environments, cannot fully consider the flight characteristics and obstacle avoidance requirements in three-dimensional space, and has weak anti-interference ability and cannot meet the real-time obstacle avoidance and path optimization requirements.
Adopt the three-dimensional path planning method of UAV based on Beidou grid code, and generate and optimize path information through the A* algorithm and particle swarm optimization algorithm, combine multiple sensors to obtain environmental data, dynamically adjust the path to avoid obstacles, and improve flight Safety and efficiency.
It realizes high-precision three-dimensional positioning, enhances anti-interference capabilities, ensures stable navigation and safe flight of the drone in complex environments, and improves the real-time and optimization capabilities of path planning.
Smart Images

Figure CN118938954A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data processing technology, and in particular to a method and system for three-dimensional path planning of an unmanned aerial vehicle based on Beidou grid code. Background Art
[0002] In modern applications, drones are widely used in logistics, disaster relief, geographic surveying, and agriculture. In these application scenarios, drones need to accurately navigate in complex three-dimensional space, avoid obstacles, and find the optimal path from the starting point to the end point. For example: in logistics and transportation scenarios, drones deliver packages in cities and need to avoid obstacles such as buildings and wires, and accurately locate and fly between high-rise buildings; in disaster relief scenarios, after natural disasters such as earthquakes or floods, drones need to quickly reach the disaster area for surveying and material delivery, and must plan safe and efficient flight paths in complex terrain; in agricultural scenarios, drones perform precise sowing, fertilization, and pesticide spraying over farmland, and need to consider the height and density of crops and plan efficient flight routes.
[0003] At present, the path planning technology of UAVs mainly relies on the Global Positioning System (GPS) and conventional two-dimensional path planning algorithms, such as the Dijkstra algorithm and the A* algorithm. These technologies have the following shortcomings in practical applications: (1) Insufficient positioning accuracy. The positioning accuracy of the GPS system is limited in complex environments (such as cities with tall buildings and mountainous areas covered with dense forests). It is easily affected by multipath effects and occlusions, resulting in inaccurate navigation of UAVs; (2) The limitations of two-dimensional path planning. Most existing path planning algorithms are based on two-dimensional planes and cannot fully consider the flight characteristics and obstacle avoidance requirements of UAVs in three-dimensional space, which can easily lead to unreasonable path planning, increase flight risks and energy consumption; (3) Weak anti-interference ability. GPS signals are easily affected by electromagnetic interference and bad weather, resulting in loss or instability of positioning signals, affecting the normal flight of UAVs; (4) Insufficient path optimization. Conventional path planning algorithms perform poorly in dealing with dynamic obstacles and real-time path adjustment, and cannot meet the real-time obstacle avoidance and path optimization requirements of UAVs in complex environments.
[0004] Therefore, a new UAV flight path planning scheme is needed. Summary of the invention
[0005] The present application provides a method and system for three-dimensional path planning of an unmanned aerial vehicle based on Beidou grid code, in an effort to solve or at least alleviate at least one of the above problems.
[0006] According to one aspect of the present application, a method for three-dimensional path planning of an unmanned aerial vehicle based on a Beidou grid code is provided, the method being suitable for execution in a computing device connected to a data acquisition module, the method comprising: generating a three-dimensional environment model based on the position data and environment data of the unmanned aerial vehicle from the data acquisition module, the position data comprising a position code of a starting point and a position code of a target point of the unmanned aerial vehicle; determining at least one initial path information between the starting point and the target point by an A* algorithm; optimizing the at least one initial path information by a particle swarm optimization algorithm to obtain planned path information, so that the unmanned aerial vehicle flies according to the planned path information; updating the three-dimensional environment model during the flight of the unmanned aerial vehicle according to current data transmitted in real time by the data acquisition module, the current data comprising current environment data and a position code of the unmanned aerial vehicle at a current position; when a path update condition is triggered, dynamically adjusting the planned path information according to the current three-dimensional environment model, generating new path information, and transmitting the new path information to the unmanned aerial vehicle, wherein the path information comprises the position code of each node in the path.
[0007] Optionally, in the method according to the present application, the environmental data includes the location code of the obstacle in the airspace environment and its attribute information, and the attribute information includes the obstacle height and obstacle type; the location code is the grid code of the Beidou grid corresponding to the location.
[0008] Optionally, in the method according to the present application, generating a three-dimensional environment model includes: preprocessing the position data and the environment data to generate data in a predetermined format; according to the position code, mapping the data in the predetermined format to a grid unit indicated by the position code, wherein the level of the grid unit is determined according to the type of the airspace environment.
[0009] Optionally, in the method according to the present application, at least one initial path information between the starting point and the target point is determined by the A* algorithm, including: when determining the path using the valuation function of the A* algorithm, the cost value of the path is determined based on the distance between corresponding grid units, and the distance between the grid units is determined based on the level of the grid units.
[0010] Optionally, in the method according to the present application, the at least one initial path information is optimized, including: taking the initial path information as an initial solution, and forming an initial particle swarm from the initial solution; updating the optimal position of the particle by determining the fitness value of each particle; updating the speed and position of each particle, wherein the position of the particle includes the position of each node in the path, and the speed of the particle includes the direction and amplitude of the path change; repeatedly iteratively updating the optimal position, updating the speed and position until the termination condition is reached, and determining the optimal position and the optimal solution, wherein the optimal solution indicates the planned path information.
[0011] Optionally, in the method according to the present application, the fitness value is expressed as:
[0012] f=w1·l length +w2·l obstacle +w3·l energy ,
[0013] Among them, l length is the path length, determined by the sum of the distances of all path segments; l obstacle The obstacle avoidance cost is determined by the path segment added to avoid obstacles in the path; energy is the flight energy consumption, which is determined by the energy consumed by the UAV on different path segments; w1, w2, and w3 represent the weight coefficients of path length, obstacle avoidance cost, and flight energy consumption, respectively.
[0014] Optionally, in the method according to the present application, the path update condition includes at least one of the following conditions: updating the path at predetermined intervals; updating the path if new obstacles are added to the current environmental data; updating the path if the state of the drone changes; and updating the path if the drone reaches a preset location.
[0015] Optionally, in the method according to the present application, dynamically adjusting the planned path information according to the current three-dimensional environment model includes: determining at least one path information between the current position and the target point through the A* algorithm according to the current three-dimensional environment model; optimizing the determined path information through the particle swarm optimization algorithm to obtain new path information.
[0016] Optionally, in the method according to the present application, the distance d between grid cells is determined as follows: d=dx·Δx+dy·Δy+dz·Δz, wherein Δx, Δy, Δz represent the number of grid cells spaced in longitude, latitude, and altitude directions, respectively, and dx, dy, and dz are the sizes of the grid cells.
[0017] According to another aspect of the present application, a three-dimensional path planning system for a UAV based on the Beidou grid code is provided, including: a data acquisition module, arranged on the UAV, suitable for collecting the position data of the UAV and the environmental data in the airspace environment; a path planning module, connected to the data acquisition module, suitable for generating the path information of the UAV by executing the method as described above; a display module, connected to the path planning module, suitable for displaying the path information.
[0018] Optionally, in the system according to the present application, the data acquisition module also includes: a Beidou navigation device, suitable for obtaining the current position of the drone and generating a location code corresponding to the current position, wherein the location code is represented by a Beidou grid code; a video acquisition device, suitable for collecting video image data in an airspace environment, and identifying obstacles and their types, as well as the locations of the obstacles in the video image data; a ranging device, suitable for collecting the distance and height of obstacles in the airspace environment, and determining the obstacle position and obstacle height.
[0019] Optionally, in the system according to the present application, the display module is also suitable for receiving user adjustment instructions for the path and sending the adjustment instructions to the path planning module; the path planning module is also suitable for dynamically adjusting the path information according to the adjustment instructions to generate new path information.
[0020] According to another aspect of the present application, a computing device is provided, comprising: one or more processor memories; one or more programs, wherein the one or more programs are stored in the memories and configured to be executed by one or more processors, and the one or more programs include instructions for executing any of the above methods.
[0021] According to another aspect of the present application, a computer-readable storage medium storing one or more programs is provided. The one or more programs include instructions. When the instructions are executed by a computing device, the computing device executes any of the methods described above.
[0022] According to another aspect of the present application, a computer program product is provided, comprising a computer program / instruction, wherein the computer program / instruction implements the steps of the above-mentioned method when executed by a processor.
[0023] In summary, according to the solution of this application, Beidou grid code is used for positioning, and each grid unit is subdivided to meters, centimeters or even millimeters according to the type of airspace environment in which the drone flies, so that the drone can obtain extremely high positioning accuracy. This high-resolution positioning is particularly important in complex urban environments and natural disaster areas, and can avoid multipath effects and signal blocking problems. At the same time, accurate location information helps drones effectively avoid obstacles and improve flight safety.
[0024] In addition, multiple sensors are used to obtain environmental data to improve data accuracy. In severe weather or electromagnetic interference environments, accurate environmental data can continue to be provided to generate a three-dimensional environmental model, thereby ensuring stable path planning services.
[0025] In addition, the A* algorithm is used for path search to determine the initial path information from the starting point to the target point. The flexibility and efficiency of the A* algorithm enable it to quickly find the approximate shortest path. Afterwards, the initial path information is used as the initial solution of the particle swarm optimization algorithm. By simulating the synergy and dynamic search characteristics of the particle swarm, the path is further optimized to reduce the path length and energy consumption.
[0026] In addition, when the path update conditions are triggered, the A* algorithm and particle swarm optimization algorithm are used to dynamically adjust the flight path to ensure that the drone avoids new obstacles and improve flight safety.
[0027] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] In order to achieve the above and related purposes, certain illustrative aspects are described herein in conjunction with the following description and accompanying drawings, which indicate various ways in which the principles applied herein can be practiced, and all aspects and their equivalents are intended to fall within the scope of the claimed subject matter. By reading the following detailed description in conjunction with the accompanying drawings, the above and other purposes, features and advantages of the present application will become more apparent. Throughout the application, the same reference numerals generally refer to the same parts or elements.
[0029] Figure 1 A schematic diagram of a UAV three-dimensional path planning system 100 based on Beidou grid code according to some embodiments of the present application is shown;
[0030] Figure 2 A schematic diagram of a computing device 200 according to some embodiments of the present application is shown;
[0031] Figure 3 A flowchart of a method 300 for three-dimensional path planning of a UAV based on Beidou grid code according to some embodiments of the present application is shown. DETAILED DESCRIPTION
[0032] The exemplary embodiments of the present application will be described in more detail below with reference to the accompanying drawings. Although the exemplary embodiments of the present application are shown in the accompanying drawings, it should be understood that the present application can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided in order to enable a more thorough understanding of the present application and to fully convey the scope of the present application to those skilled in the art.
[0033] In order to overcome the above-mentioned shortcomings of the prior art, this application proposes a three-dimensional path planning solution for UAVs based on Beidou grid code, aiming to solve the following key technical problems.
[0034] (1) Improve UAV positioning accuracy:
[0035] The existing GPS system has low positioning accuracy in complex environments and is easily affected by multipath effects and signal shielding. The solution of this application uses Beidou grid code and combines the high-precision positioning capability of the Beidou satellite navigation system to provide higher-precision three-dimensional positioning and reduce positioning errors.
[0036] (2) Realize three-dimensional path planning:
[0037] Traditional path planning algorithms are mainly based on two-dimensional planes and are difficult to adapt to the flight requirements of drones in three-dimensional space. This application proposes an improved three-dimensional path planning algorithm that can plan the optimal path for drones in three-dimensional space, taking into account height and obstacle information.
[0038] (3) Enhance the system's anti-interference ability:
[0039] GPS signals are susceptible to electromagnetic interference and bad weather, resulting in positioning signal loss or instability. This application uses the anti-interference characteristics of the Beidou system to ensure stable positioning and navigation in complex and harsh environments, and improve the reliability of UAV flight.
[0040] (4) Real-time obstacle avoidance and path optimization:
[0041] During the flight, drones may encounter dynamically changing obstacles and environmental conditions. The existing technology has deficiencies in handling real-time obstacle avoidance and path adjustment. This application proposes a path planning method that combines the A* algorithm and the particle swarm optimization algorithm, which can dynamically adjust the flight path, avoid obstacles in real time, and optimize the flight path to improve flight efficiency and safety.
[0042] (5) Efficient data processing and path planning:
[0043] Efficient path planning of drones in complex environments requires processing a large amount of geographic information and real-time data. This application designs a set of efficient data processing processes and algorithms to ensure efficiency and accuracy in data collection, preprocessing, path calculation and optimization.
[0044] Figure 1 FIG. 1 is a schematic diagram of a UAV three-dimensional path planning system 100 based on Beidou grid code according to some embodiments of the present application. Figure 1As shown, the system 100 includes: a data acquisition module 110, a path planning module 120 and a display module 130. The path planning module 120 is respectively connected to the data acquisition module 110 and the display module 130 for data transmission and communication.
[0045] The data collection module 110 is arranged on the UAV and is used to collect the location data of the UAV and the environmental data in the airspace environment.
[0046] In some embodiments, the data acquisition module 110 further includes: a Beidou navigation device 112, a video acquisition device 114, and a distance measuring device 116. The Beidou navigation device 112 is used to collect the position data of the drone, and the video acquisition device 114 and the distance measuring device 116 are used to collect the environmental data.
[0047] Specifically, the Beidou navigation device 112 obtains the current position of the drone and generates a location code corresponding to the current position. According to this embodiment, the location code is represented by a Beidou grid code (BDS-Grid Code). The Beidou grid code is a geographic location encoding method based on the Beidou Navigation Satellite System (BDS). By dividing the earth's surface into multiple three-dimensional grid cells, each grid cell represents a certain geographic space range, which can be represented by {longitude range, latitude range, altitude range}, and each grid cell has a unique code (i.e., Beidou grid code) for accurate positioning and navigation. In other words, the Beidou navigation device 112 obtains the current position of the drone, which is usually represented by longitude, latitude and altitude; afterwards, the Beidou navigation device 112 determines the grid cell to which it belongs based on the position, and uses the Beidou grid code of the grid cell as the location code of the current position.
[0048] In the Beidou grid code, the earth's surface is hierarchically divided into multiple grid cells, each of which represents a specific geographical area. The higher the grid division level, the smaller the area of a single grid cell and the more accurate the positioning. For example, the first-level grid cell represents a larger area division with a wide coverage; the second-level grid cell represents a subdivision of the first-level grid, providing medium accuracy; the third-level grid cell represents a further subdivision of the second-level grid to achieve high-precision positioning. In addition, the grid cells can be subdivided to the centimeter or millimeter level according to application requirements.
[0049] According to the implementation mode of the present application, the accuracy of grid division directly affects the accuracy and efficiency of path planning. Therefore, it is very important to reasonably select the level of grid division (or accuracy). When dividing the airspace range of drone operations into grid units, the level of the grid unit is determined according to the type of airspace environment. For example, in application scenarios for urban environments, if the airspace environment is a high-rise dense area, the division level of the grid unit is centimeter level to ensure accurate positioning and obstacle avoidance; if the airspace environment is an open area, the division level of the grid unit is decimeter level to balance accuracy and data processing performance. For agricultural application scenarios, if the airspace environment is between ridges and rows, the division level of the grid unit is centimeter level to ensure precise operation (such as sowing and fertilizing); if the airspace environment is open cultivated land, the division level of the grid unit is meter level, which is convenient for large-scale monitoring.
[0050] The video acquisition device 114 collects video image data in the airspace environment, and identifies obstacles and their types, as well as the locations of obstacles in the video image data. In an embodiment of the present application, obstacle types are obstacles formed by terrain such as mountains and rivers, buildings, and other obstacles such as birds, trees, and other drones. This embodiment does not limit the image processing algorithm used to identify obstacles (i.e., targets) in the image. In addition, the location of the obstacle is also mapped to a Beidou grid code to represent it.
[0051] The distance measuring device 116 collects the distance and height of obstacles in the airspace environment and determines the position and height of obstacles. In some embodiments, the distance measuring device 116 is implemented by a laser radar. The position and height of obstacles are detected by the laser radar. Similarly, the obstacle position is mapped to the Beidou grid code to represent it.
[0052] The image data captured by the video acquisition device 114 (such as a camera) and the ranging data of the laser radar are calibrated with each other. Among them, the camera provides visual information to facilitate the identification of the type of obstacles, while the laser radar provides accurate distance information. The two types of data can verify the accuracy of the data with each other. For example, when the laser radar detects an obstacle somewhere, its existence and type can be verified through the image captured by the camera, thereby improving the accuracy of recognition. In addition, when a sensor fails or is interfered by the environment (such as the camera is blurred due to rain), the other sensor can still provide valid data, thereby improving the robustness of the system.
[0053] In summary, environmental data includes: the location code of obstacles in the airspace environment and their attribute information, and the attribute information includes the height and type of obstacles. The location code is the grid code of the Beidou grid corresponding to the location. In this way, the geographic location data is simplified to the grid code, reducing the amount of data transmission and improving processing efficiency.
[0054] The path planning module 120 can be arranged as a server, receiving location data and environmental data from the data acquisition module 110 through a wireless communication unit (not shown), and executing the Beidou grid code-based drone three-dimensional path planning method of the present application to generate the drone's path information.
[0055] According to some embodiments, the path planning module 120 receives the environmental data from the video acquisition device 114 and the distance measuring device 116, and first performs a series of processing such as data cleaning and format conversion to fuse them; then, the position data and environmental data are pre-processed to generate data in a predetermined format. In this embodiment, a Kalman filter or a particle filter is used to fuse the laser radar data and the camera data. This embodiment does not limit the specific method used to process the environmental data. A set of examples of environmental data are shown below:
[0056] 1. Data detected by the distance measuring device 116:
[0057]
[0058] 2. Data collected by the video acquisition device 114:
[0059]
[0060] 3. Results after data fusion:
[0061]
[0062]
[0063] Among them, location indicates the location code, height indicates the obstacle height, and type indicates the obstacle type. In this example, the location code of the obstacle is N123456789013, the obstacle type is building, and the obstacle height is 30 meters.
[0064] At the same time, when the UAV flies in an urban area, the path planning module 120 also receives the current location data of the UAV, for example: current location: "N123456789012".
[0065] The path planning module 120 combines the current location data and environment data, and obtains data in a predetermined format after preprocessing, which is expressed as:
[0066]
[0067] Among them, position represents the position data of the drone, and obstacles represents the information of obstacles, including location, height, and type. The embodiment of the present application does not impose too many restrictions on the format of the predetermined format data, as long as it contains the above information and can accurately derive from it: at N123456789013 (indicating the next grid unit of the current position), if the side length of the grid unit in this direction is 50 meters, then there is a 30-meter-high building 50 meters ahead.
[0068] For the specific processing process of the path planning module 120, please refer to the specific description of the UAV three-dimensional path planning method 300 based on the Beidou grid code below, which will not be expanded here.
[0069] On the one hand, the path planning module 120 sends the generated path information to the drone so that it flies according to the path information, and on the other hand, sends the path information to the display module 130, which displays the path information. According to the present application, the path information includes the location code of each node in the path. According to other embodiments of the present application, the display module 130 can not only display the detailed information of the path, but also receive the user's adjustment of the path, and the display module 130 sends the user's adjustment instructions to the path planning module 120.
[0070] When the path planning module 120 receives the adjustment instruction, the path update condition is triggered. The path planning module 120 dynamically adjusts the path information according to the adjustment instruction to generate new path information. Of course, the path planning module 120 may also dynamically adjust the path information when other path update conditions are triggered. In short, the path planning module 120 will retransmit the new path information to the drone for execution, and at the same time send it back to the display module 130 for display.
[0071] For example, the path information initially displayed by the display module 130 is:
[0072] Path A1: N123456789012->N123456789013->S098765432109,
[0073] Afterwards, the user issues an adjustment instruction, the path planning module 120 recalculates the path, and the display module 130 displays the new path information:
[0074] Path A2: N123456789012->N123456789013->S098765432110.
[0075] According to the system 100 of the present application, Beidou grid code is used for positioning, and each grid unit is subdivided into meters, centimeters or even millimeters according to the type of airspace environment in which the drone flies, so that the drone can obtain extremely high positioning accuracy. This high-resolution positioning is particularly important in complex urban environments and natural disaster areas, and can avoid multipath effects and signal blocking problems. At the same time, accurate location information helps drones effectively avoid obstacles and improve flight safety.
[0076] In addition, multiple sensors such as the video acquisition device 114 and the distance measuring device 116 are used to obtain environmental data, thereby improving the accuracy of the data and being able to continue to provide accurate environmental data in severe weather or electromagnetic interference environments, thereby ensuring a stable path planning service.
[0077] In addition, the display module 130 makes operation easier through intuitive path display and feedback functions. Users can view and adjust the flight path and flexibly adjust tasks according to actual needs, thereby improving user satisfaction.
[0078] The path planning module 120 according to the present application may be implemented by a computing device. Figure 2 FIG. 2 shows a schematic diagram of a computing device 200 according to some embodiments of the present application. It should be noted that: Figure 2 The computing device 200 shown is only an example. In practice, the computing device used to implement the method of the present application can be any type of device, and its hardware configuration can be different from the above. Figure 2 The computing device 200 shown is the same as Figure 2 The computing device 200 shown is different. In practice, the computing device used to implement the embodiment of the present application can be Figure 2 The hardware components of the computing device 200 shown are increased or deleted, and the present application does not limit the specific hardware configuration of the computing device.
[0079] like Figure 2 In a basic configuration, computing device 200 includes at least one processing unit 202 and system memory 204. According to one aspect, depending on the configuration and type of computing device, processing unit 202 can be implemented as a processor. System memory 204 includes, but is not limited to, volatile storage (e.g., random access memory), non-volatile storage (e.g., read-only memory), flash memory, or any combination of such memories. According to one aspect, system memory 204 includes operating system 205 and program modules 206.
[0080] According to one aspect, operating system 205 is suitable for controlling the operation of computing device 200, for example. Furthermore, examples are practiced in conjunction with graphics libraries, other operating systems, or any other application programs, and are not limited to any particular application or system. Figure 2 This basic configuration is illustrated in FIG. 2 by those components within dashed line 208. According to one aspect, computing device 200 has additional features or functionality. For example, according to one aspect, computing device 200 includes additional data storage devices (removable and / or non-removable), such as magnetic disks, optical disks, or tapes. Such additional storage Figure 2 2 is illustrated by removable storage 209 and non-removable storage 210.
[0081] As stated above, according to one aspect, program modules are stored in the system memory 204. According to one aspect, the program modules may include one or more application programs, and the present application does not limit the types of application programs, for example, the application programs may include: email and contact applications, word processing applications, spreadsheet applications, database applications, slide show applications, drawing or computer-aided applications, web browser applications, etc.
[0082] According to one aspect, the examples may be practiced on a circuit comprising discrete electronic components, a packaged or integrated electronic chip containing logic gates, a circuit utilizing a microprocessor, or a single chip containing electronic components or a microprocessor. Figure 2 Each or many components shown in can be integrated in a system on chip (SOC) on a single integrated circuit to practice examples. According to one aspect, such a SOC device may include one or more processing units, a graphics unit, a communication unit, a system virtualization unit, and various application functions, all of which are integrated (or "burned") into a chip substrate as a single integrated circuit. When operated via SOC, the functions described in the present application can be operated via a dedicated logic integrated with other components of a computing device 200 on a single integrated circuit (chip). Other technologies that can perform logical operations (such as AND, OR, and NOT) can also be used to practice embodiments of the present application, including but not limited to mechanical, optical, fluid, and quantum technologies. In addition, embodiments of the present application can be practiced in a general-purpose computer or in any other circuit or system.
[0083] According to one aspect, the computing device 200 may also have one or more input devices 212, such as a keyboard, a mouse, a pen, a voice input device, a touch input device, a VR motion capture input device, etc. Output devices 214 may also be included, such as a display, a speaker, a printer, etc. The aforementioned devices are examples and other devices may also be used. The computing device 200 may include one or more communication connections 216 that allow communication with other computing devices 218. Examples of suitable communication connections 216 include, but are not limited to: RF transmitters, receivers and / or transceiver circuits; Universal Serial Bus (USB), parallel and / or serial ports.
[0084] The term computer-readable media as used in this application includes computer storage media. Computer storage media may include volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (e.g., computer-readable instructions, data structures, or program modules). System memory 204, removable storage 209, and non-removable storage 210 are all examples of computer storage media (i.e., memory storage). Computer storage media may include random access memory (RAM), read-only memory (ROM), electrically erasable read-only memory (EEPROM), flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical storage, cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other products that can be used to store information and can be accessed by computing device 200. According to one aspect, any such computer storage media may be part of computing device 200. Computer storage media do not include carrier waves or other propagated data signals.
[0085] According to one aspect, communication media is implemented by computer readable instructions, data structures, program modules, or other data in a modulated data signal (e.g., a carrier wave or other transport mechanism), and includes any information delivery media. According to one aspect, the term "modulated data signal" describes a signal that has one or more characteristics set or changed in a manner that encodes information in the signal. By way of example and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency (RF), infrared, and other wireless media.
[0086] In an embodiment according to the present application, the computing device 200 is configured to execute the method 300 for three-dimensional path planning of a UAV based on Beidou grid code according to the present application. Among them, the program module 206 includes a plurality of program instructions for executing the method 300 for three-dimensional path planning of a UAV based on Beidou grid code, and these program instructions can instruct the processing unit 202 to execute the method 300 of the present application.
[0087] Figure 3 A flowchart of a method 300 for three-dimensional path planning of a UAV based on Beidou grid code according to some embodiments of the present application is shown. It should be noted that the method 300 can be executed by the aforementioned path planning module 120, so the contents of the method 300 and the aforementioned system 100 complement each other, and the relevant parts are not repeated here.
[0088] like Figure 3 As shown, the method 300 starts at step S310 . In S310 , a three-dimensional environment model is generated based on the position data and environment data of the drone from the data acquisition module 110 .
[0089] Among them, before the drone takes off, the location data includes the location code of the starting point of the drone and the location code of the target point. During the flight of the drone, the location code of the starting point is the location code of the current position of the drone. The environmental data includes the location code of obstacles in the airspace environment and their attribute information, and the attribute information includes the height of the obstacle and the type of obstacle. In addition, the location codes are all represented by the grid code of the Beidou grid corresponding to the geographical location, and the level of the grid unit is determined according to the type of airspace environment. Regarding the location data and environmental data, please refer to the relevant description of the data acquisition module 110, which will not be repeated here.
[0090] According to an implementation of the present application, the location data and the environment data are first preprocessed to generate data in a predetermined format; then, based on the location code, the data in the predetermined format is mapped to the grid unit indicated by the location code.
[0091] In some embodiments, pre-processing includes but is not limited to:
[0092] -Data cleaning: remove noise and redundant data.
[0093] -Data format conversion: Convert the data from each sensor into a standard data format for subsequent processing.
[0094] For the processed data, please refer to the relevant description of the previous example. This embodiment is based on the Beidou grid code, and records the processed predetermined format data into the corresponding grid unit according to its corresponding location code (i.e., location in the example) to form a three-dimensional environmental model. The three-dimensional environmental model forms an accurate three-dimensional spatial image by mapping all environmental data (including terrain, buildings, obstacles, etc.) into a spatial grid. Each grid unit of the model contains detailed environmental information, such as the height, type and location of the obstacle.
[0095] The following is an exemplary illustration of a grid unit in a three-dimensional environment model:
[0096] {
[0097] "N123456789012":{"height":100,"type":"none"},
[0098] "N123456789013":{"height":30,"type":"building"},
[0099] "N123456789014":{"height":25,"type":"tree"},
[0100] / / More grid cells
[0101] }
[0102] According to the implementation of the present application, the three-dimensional environment model provides accurate location and height information of obstacles, providing effective data support for the subsequent path planning algorithm, improving the efficiency and accuracy of path planning. At the same time, the three-dimensional environment model can be used to evaluate the safety of the path and ensure that the drone avoids all potential obstacles during flight.
[0103] In S320, at least one initial path information between the starting point and the target point is determined by using the A* algorithm.
[0104] Typically, the path information includes the location of each node in the generated path. According to an embodiment of the present application, the path information includes a location code of each node in the path.
[0105] A* search algorithm, commonly known as A star algorithm, is a heuristic search algorithm, widely used in path search and graph search, using heuristic search methods to find the shortest path from the starting point to the target point (the path with the lowest cost). The core of the A* algorithm is the valuation function, as shown below:
[0106] f(n)=g(n)+h(n),
[0107] Among them, f(n) is the total valuation, g(n) is the path cost function, which is the actual cost from the starting point to the current node n, and h(n) is the heuristic valuation function, which is the heuristic valuation from the current node n to the target point.
[0108] The path returned by the standard A* algorithm is a single path. Generally, the purpose of the A* algorithm is to find the shortest or optimal path from the starting point to the target point. Therefore, through the comprehensive evaluation of the heuristic function and the path cost function, an optimal path is always returned.
[0109] The path returned by the extended A* algorithm is multiple paths (selected as suboptimal paths). In some implementations, the function of the A* algorithm can be extended to return suboptimal paths. This extension helps to cope with complex flight environments or provide backup paths. For example, a suboptimal path can be used as a backup when the optimal path is not feasible.
[0110] According to some embodiments of the present application, a standard A* algorithm or an extended A* algorithm may be used, and the present application does not limit the number of initial paths. Moreover, the A* algorithm is a common path planning algorithm in the prior art, so it will not be expanded here.
[0111] According to some embodiments of the present application, when the path is determined using the valuation function of the A* algorithm, the cost value of the path is determined based on the distance between the corresponding grid units, and the distance between the grid units is determined based on the level of the grid units. In other words, when the level of the grid unit is determined, the length, width, and height of each grid unit are fixed, so the standardized distance calculation can be directly performed through the grid coordinates to determine the cost value of the path.
[0112] Generally, for a path or path segment where the grid unit hierarchy is obvious and the path presents a horizontal or vertical grid shape, the distance d between the grid units is determined as follows:
[0113] d=dx·Δx+dy·Δy+dz·Δz,
[0114] Among them, Δx, Δy, Δz represent the number of grid cells spaced in the longitude, latitude, and altitude directions, respectively, and dx, dy, dz are the corresponding sizes of the grid cells in the longitude, latitude, and altitude directions.
[0115] Of course, you can also use the Euclidean distance to accurately calculate the straight-line distance d between two nodes. ′ :
[0116]
[0117] Wherein, (x1, y1, z1) and (x2, y2, z2) represent the grid coordinates of the grid cells indicated by the two nodes, respectively, and dx, dy, and dz are the sizes of the grid cells. The grid coordinates of the grid cells can be represented by the coordinates of the center point of the grid cells, and this application does not impose too many restrictions on this.
[0118] In S330, at least one initial path information is optimized by a particle swarm optimization algorithm to obtain planned path information, so that the UAV can fly according to the planned path information.
[0119] Particle Swarm Optimization (PSO) is an algorithm based on swarm intelligence optimization, which searches for the optimal solution by simulating the collaboration of individuals (particles) in a swarm.
[0120] According to an embodiment of the present application, all initial path information determined by the A* algorithm is optimized, including:
[0121] (1) The initial path information is used as the initial solution, and the initial solution constitutes the initial particle swarm. When there is more than one initial path information, there is more than one initial solution, and these initial solutions constitute the initial particle swarm. In the PSO algorithm, each particle represents a possible path solution.
[0122] (2) Update the optimal position of the particle by determining the fitness value of each particle.
[0123] In some embodiments, the fitness value is expressed as:
[0124] f=w1·l length +w2·l obstacle +w3·l energy ,
[0125] Among them, l length is the path length, l obstacle is the obstacle avoidance cost (obstacle avoidance cost), l energy is the flight energy consumption, w1, w2, w3 represent the weight coefficients of path length, obstacle avoidance cost and flight energy consumption respectively.
[0126] In some embodiments, a path can be divided into multiple path segments by using two nodes in the path. length Determined by the sum of the distances of all path segments. The obstacle avoidance cost l obstacle It is determined by the distance of the path segment added by avoiding obstacles in the path. energy The energy consumed by the drone on different path segments is determined, and optionally, the energy consumed on the path segment is positively correlated with the path segment length and the flight altitude change. As described above, the distance of the path segment is still calculated by the distance between grid cells.
[0127] Afterwards, the optimal position of the particle is updated according to the fitness value of the particle. The optimal position of the particle includes: the global optimal position g best , represents the optimal path solution found among all particles, and the historical optimal position p of particle i besti , represents the optimal path solution recorded by particle i. For each particle i, its fitness value is compared with its historical optimal position p besti For comparison, if the fitness value is better, then pbesti Replaced by the current position; its fitness value is compared with the global optimal position g best For comparison, if the fitness value is better, then g best Replaced by the current location.
[0128] (3) Update the speed and position of each particle, where the position of the particle includes the position of each node in the path, and the speed of the particle includes the direction and amplitude of the path change.
[0129] The speed update formula is:
[0130] v i (t+1)=w·v i (t)+c1·r1·(p besti -x i )+c2·r2·(g best -x i ),
[0131] The position update formula is:
[0132] x i (t+1)=x i (t)+v i (t+1),
[0133] In the formula, v i (t+1) is the velocity of particle i at time t+1, indicating the direction and magnitude of the change of the path node; similarly, v i (t) is the speed of particle i at time t; w is the inertia weight, which is used to retain the previous speed of the particle and control the balance between global and local search capabilities; c1 and c2 are acceleration coefficients, which represent the influence of the particle's own experience and the value group's experience on the speed change; r1 and r2 are random numbers with a value range of [0,1], which increase the randomness of the algorithm and avoid local optimality; p besti is the historical optimal position of particle i, indicating the optimal path solution recorded by particle i; g best is the global optimal position, indicating the optimal path solution found among all particles; x i (t) is the current position of particle i at time t, indicating the coordinate value of the current path point; x i (t+1) is the position of particle i at time t+1.
[0134] (4) Repeat the iterative updating of the optimal position (i.e., step (2)), the updating of the speed and the position (i.e., step (3)), until the termination condition is reached, and the optimal position and the optimal solution are determined, wherein the optimal solution indicates the planned path information. The termination condition may be, for example, reaching the maximum number of iterations, and this embodiment does not impose a multi-country restriction on this.
[0135] According to the implementation of the present application, the A* algorithm and the PSO algorithm are combined to determine the planned path information, and send it to the drone and the display module 130 respectively. An example of path information is shown below, and the path information from the starting point "N123456789012" to the target point "S098765432109" is represented as:
[0136] ["N123456789012","N123456789013","S098765432109"].
[0137] According to the implementation of the present application, by combining the A* algorithm and the particle swarm optimization algorithm, an optimal flight path is generated for a drone in three-dimensional space. The A* algorithm is responsible for preliminary path search, and the particle swarm optimization algorithm further optimizes the path to ensure the rationality of the path, the shortest distance, and the least energy consumption. On the one hand, the best path from the starting point to the target point is quickly found in three-dimensional space, achieving efficient path planning; on the other hand, the optimized path reduces unnecessary flight distance and energy consumption, which can save energy.
[0138] During the flight of the drone, the data acquisition module 110 collects current data in real time and transmits it to the path planning module 120. Therefore, in S340, during the flight of the drone, the three-dimensional environment model is updated according to the current data transmitted in real time by the data acquisition module 110. The current data includes the current environment data and the location code of the drone at the current location.
[0139] In some embodiments, updating the three-dimensional environment model includes: converting current data into data in a predetermined format, including the location code of the current drone, the location code of the obstacle, the type of obstacle, the height of the obstacle, etc.; then, mapping these data to corresponding grid cells according to the location code. In this way, the three-dimensional environment model can record environmental data in the airspace environment in real time. The updated three-dimensional environment model records the environmental changes and the position changes of the drone itself during the flight in real time, so as to adjust the path information, such as avoiding new obstacles to ensure flight safety.
[0140] In S350, when the path update condition is triggered, the planned path information is dynamically adjusted according to the current three-dimensional environment model, new path information is generated, and the new path information is transmitted to the UAV.
[0141] According to an embodiment of the present application, the path update condition includes at least one of the following conditions.
[0142] (1) The path is updated at predetermined intervals, for example, every 30 seconds, the path planning module 120 recalculates the path information. This is suitable for scenarios where the flight environment of the drone does not change frequently, ensuring that the path planning remains up to date in a relatively short period of time.
[0143] (2) If a new obstacle is added to the current environmental data, the path is updated. If there is a new obstacle in the current data (such as a temporary building, a vehicle parked, etc.), the path update is triggered. This method can quickly respond to environmental changes and ensure that the drone can adjust the flight path in time after a new obstacle appears to avoid collision risks. For example, if the drone finds a new building obstacle 50 meters ahead, the path planning module 120 will recalculate the path information.
[0144] (3) If the state of the drone changes, the path is updated. When the state of the drone changes (such as speed change, flight altitude change, insufficient energy, etc.), the path update is triggered. The state change of the drone can be determined by the data recorded in the three-dimensional environment model, or the drone can pass instructions to the path planning module 120. This method can ensure the adjustment of path planning after the drone state changes, and optimize flight efficiency and safety. For example, a sudden drop in the drone's flight speed or insufficient battery triggers path replanning.
[0145] (4) If the drone reaches the preset location, the path is updated. When the drone reaches a certain intermediate node (the intermediate node can be determined based on task switching, etc.) during the execution of the task, the path update is triggered. This method can ensure the path optimization at different stages of the task and enable the drone to complete complex task plans. For example, after the drone reaches a certain checkpoint, it replans the path to the next task point.
[0146] Of course, the path update condition may also be that the user initiates a request to trigger the update. For example, in some scenarios that require frequent manual intervention, the user manually initiates a path update request through the display module 130, and the path is replanned according to the user request.
[0147] In summary, according to the implementation of the present application, the dynamics of the environment, the state of the drone, and the needs of the user can be comprehensively considered to make real-time path adjustments. The path update conditions can be flexibly set according to the application scenario to ensure the real-time and sensitivity of the path planning.
[0148] In some embodiments, dynamically adjusting the planned path information according to the current three-dimensional environment model includes: first determining at least one path information between the current position and the target point through the A* algorithm according to the current three-dimensional environment model; then optimizing the determined path information through the particle swarm optimization algorithm to obtain new path information. In other words, after the path update condition is triggered, based on the current position and the target point, steps S320 and S330 are executed to generate updated path information.
[0149] Continuing with the above path information example, a new obstacle is found during the flight, and the obstacle location code is N123456789014. The path planning module 120 recalculates the new path information as follows: ["N123456789012","N123456789013","N123456789015","S098765432109"].
[0150] According to the implementation mode of the present application, during the flight of the drone, the path can be dynamically adjusted to ensure that the drone avoids newly emerging obstacles. In addition, the real-time obstacle avoidance function reduces the risk of collision and accidents, thereby improving the safety of drone flight.
[0151] According to the scheme of the present application, by combining Beidou grid code and path planning algorithm (such as A* algorithm and particle swarm optimization algorithm), an efficient and safe three-dimensional path planning method for unmanned aerial vehicles is provided, which has the following overall advantages: (1) Accurate positioning: Based on Beidou grid code, high-precision three-dimensional geographic location is provided, making the positioning of various obstacles in the unmanned aerial vehicle and airspace environment more accurate; (2) Path optimization: Combining A* algorithm and particle swarm optimization algorithm, the three-dimensional path is planned and optimized to improve the efficiency of path planning. At the same time, when planning the path, the path distance is determined based on the distance between corresponding grid units, which greatly reduces the complexity of calculation and effectively saves computing power; (3) Anti-interference: The excellent anti-interference characteristics of the Beidou system improve the stability of the system; (4) Real-time obstacle avoidance: Dynamically adjust the path to avoid new obstacles to ensure flight safety; (5) User-friendly: The intuitive display interface and adjustment function provide a good user experience. In summary, these advantages ensure the efficient and safe flight of unmanned aerial vehicles in complex environments and meet the mission requirements in various scenarios, such as logistics transportation, disaster relief and agricultural applications.
[0152] Optionally, the data acquisition module also includes: a Beidou navigation device, suitable for obtaining the current position of the drone and generating a position code corresponding to the current position, wherein the position code is represented by a Beidou grid code; a video acquisition device, suitable for acquiring video image data in an airspace environment and identifying obstacles and their types, as well as the locations of the obstacles in the video image data; a ranging device, suitable for acquiring the distance and height of obstacles in an airspace environment and determining the position and height of the obstacles.
[0153] Optionally, the display module is further adapted to receive a user's instruction to adjust the path, and send the adjustment instruction to the path planning module; the path planning module is further adapted to dynamically adjust the path information according to the adjustment instruction to generate new path information.
[0154] Optionally, a computing device comprises: one or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, and the one or more programs include instructions for executing the method described above.
[0155] Optionally, a computer-readable storage medium stores one or more programs, wherein the one or more programs include instructions, and when the instructions are executed by a computing device, the computing device performs the method as described above.
[0156] Optionally, a computer program product comprises a computer program / instructions, wherein the method is implemented when the computer program / instructions are executed by a processor.
[0157] The various techniques described herein may be implemented in combination with hardware or software, or a combination thereof. Thus, the method and apparatus of the present application, or certain aspects or portions of the method and apparatus of the present application may be in the form of program codes (i.e., instructions) embedded in a tangible medium, such as a removable hard disk, a USB flash drive, a floppy disk, a CD-ROM, or any other machine-readable storage medium, wherein when the program is loaded into a machine such as a computer and executed by the machine, the machine becomes a device for practicing the present application.
[0158] In the case where the program code is executed on a programmable computer, the computing device generally includes a processor, a storage medium readable by the processor (including volatile and non-volatile memory and / or storage elements), at least one input device, and at least one output device. The memory is configured to store the program code; the processor is configured to execute the method of the present application according to the instructions in the program code stored in the memory.
[0159] By way of example and not limitation, readable media include readable storage media and communication media. Readable storage media stores information such as computer readable instructions, data structures, program modules or other data. Communication media generally embody computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and include any information transfer medium. Any combination of the above is also included within the scope of readable media.
[0160] In the description provided herein, algorithms and displays are not inherently related to any particular computer, virtual system or other device. Various general purpose systems can also be used together with the examples of the present application. According to the above description, it is obvious to construct the structure required for such systems. In addition, the present application is not directed to any specific programming language either. It should be understood that the content of the present application described herein can be realized by various programming languages, and the description of the specific language above is to disclose the preferred implementation of the present application.
[0161] In the description provided herein, a large number of specific details are described. However, it is understood that the embodiments of the present application can be practiced without these specific details. In some instances, well-known methods, structures and techniques are not shown in detail so as not to obscure the understanding of this description.
[0162] Those skilled in the art will appreciate that the modules or units or components of the devices in the examples disclosed herein may be arranged in the devices described in the embodiment, or alternatively may be located in one or more devices different from the devices in the examples. The modules in the foregoing examples may be combined into one module or may be divided into multiple submodules.
[0163] Those skilled in the art will appreciate that the modules in the devices in the embodiments can be adaptively changed and arranged in one or more devices different from the embodiments. The modules or units or components in the embodiments can be combined into one module or unit or component, and in addition they can be divided into multiple submodules or subunits or subassemblies. Except that at least some of such features and / or processes or units are mutually exclusive, all features disclosed in this specification and all processes or units of any method or device disclosed in this manner can be combined in any combination. Unless otherwise clearly stated, each feature disclosed in this specification can be replaced by an alternative feature providing the same, equivalent or similar purpose.
[0164] Furthermore, those skilled in the art will appreciate that although some embodiments described herein include certain features included in other embodiments but not other features, the combination of features from different embodiments is meant to be within the scope of the present application and to form different embodiments.
[0165] In addition, some of the embodiments are described herein as methods or combinations of method elements that can be implemented by a processor of a computer system or by other devices that perform the functions. Therefore, a processor with necessary instructions for implementing the method or method elements forms a device for implementing the method or method elements. In addition, the elements described herein of the device embodiments are examples of devices that are used to implement the functions performed by the elements for the purpose of implementing the disclosure.
[0166] As used herein, unless otherwise specified, the use of ordinal numbers "first," "second," "third," etc. to describe common objects merely refers to different instances of similar objects and is not intended to imply that the objects so described must have a given order in time, space, order, or in any other manner. In addition, the quantifier "plurality" means "two" and / or "more than two."
[0167] Although the present application is described according to a limited number of embodiments, it will be appreciated by those skilled in the art, with the benefit of the above description, that other embodiments may be envisioned within the scope of the present application thus described. In addition, it should be noted that the language used in this specification is selected primarily for the purpose of readability and teaching, rather than for the purpose of explaining or limiting the subject matter of the present application. Therefore, many modifications and changes will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the appended claims. For the scope of the present application, the disclosure made to the present application is illustrative, not restrictive, and the scope of the present application is defined by the appended claims.
Claims
1. A three-dimensional path planning method for an unmanned aerial vehicle based on Beidou grid code, the method being suitable for execution in a computing device connected to a data acquisition module. include: Generate a three-dimensional environment model based on the position data and environment data of the drone from the data acquisition module, wherein the position data includes a position code of a starting point and a position code of a target point of the drone; Determine at least one initial path information between the starting point and the target point by using the A* algorithm; Optimizing the at least one initial path information by a particle swarm optimization algorithm to obtain planned path information, so that the UAV flies according to the planned path information; During the flight of the drone, the three-dimensional environment model is updated according to the current data transmitted in real time by the data acquisition module, wherein the current data includes current environment data and a location code of the drone at a current location; When the path update condition is triggered, the planned path information is dynamically adjusted according to the current three-dimensional environment model, new path information is generated, and the new path information is transmitted to the UAV. The path information includes the location code of each node in the path.
2. The method according to claim 1, in, The environmental data includes the location code of obstacles in the airspace environment and their attribute information, and the attribute information includes the obstacle height and obstacle type; The location code is the grid code of the Beidou grid corresponding to the location.
3. The method according to claim 1 or 2, in, Generating a three-dimensional environment model comprises: Preprocessing the location data and the environment data to generate data in a predetermined format; According to the location code, the predetermined format data is mapped to the grid unit indicated by the location code, wherein the level of the grid unit is determined according to the type of the airspace environment.
4. The method according to claim 3, in, Determining at least one initial path information between the starting point and the target point by using the A* algorithm includes: When determining a path using the evaluation function of the A* algorithm, the cost value of the path is determined based on the distance between corresponding grid cells, and the distance between grid cells is determined based on the level of the grid cells.
5. The method according to any one of claims 1 to 4, in, Optimizing the at least one initial path information includes: The initial path information is used as an initial solution, and an initial particle swarm is formed by the initial solution; By determining the fitness value of each particle, the optimal position of the particle is updated; Update the speed and position of each particle, where the position of the particle includes the position of each node in the path, and the speed of the particle includes the direction and magnitude of the path change; The optimal position, speed and position are updated repeatedly and iteratively until a termination condition is reached, and the optimal position and the optimal solution are determined, wherein the optimal solution indicates the planned path information.
6. The method according to claim 5, in, The fitness value is expressed as: f=w1·l length +w2·l obstacle +w3·l energy , Among them, l length is the path length, determined by the sum of the distances of all path segments; l obstacle The obstacle avoidance cost is determined by the path segment added to avoid obstacles in the path; energy is the flight energy consumption, which is determined by the energy consumed by the UAV on different path segments; w1, w2, and w3 represent the weight coefficients of path length, obstacle avoidance cost, and flight energy consumption, respectively.
7. The method according to any one of claims 1 to 6, in, The path update condition includes at least one of the following conditions: Update the path at predetermined intervals; If new obstacles are added to the current environment data, the path is updated; If the state of the drone changes, update the path; If the drone reaches the preset location, the path is updated.
8. The method according to any one of claims 1 to 7, in, The dynamically adjusting the planned path information according to the current three-dimensional environment model includes: According to the current three-dimensional environment model, at least one path information between the current position and the target point is determined by using the A* algorithm; The determined path information is optimized through the particle swarm optimization algorithm to obtain new path information.
9. The method according to claim 4, in, The distance d between grid cells is determined as follows: d=dx·Δx+dy·Δy+dz·Δz, Among them, Δx, Δy, Δz represent the number of grid cells spaced in longitude, latitude, and altitude directions, respectively, and dx, dy, and dz are the sizes of the grid cells.
10. UAV 3D path planning system based on Beidou grid code, include: A data acquisition module, arranged on the UAV, is suitable for collecting the location data of the UAV and the environmental data in the airspace environment; A path planning module, connected to the data acquisition module, adapted to generate path information of the UAV by executing the method according to any one of claims 1 to 9; The display module is connected to the path planning module and is suitable for displaying the path information.
Citation Information
Cited By
Intelligent Beidou pile foundation positioning control, algorithm and system
CN120103832A
Unmanned vehicle high-precision positioning method and system based on Beidou and LSTM network
CN122307612A
Low-altitude unmanned aerial vehicle three-dimensional airway network planning method
CN122360451A
