UAV airport hopping scheduling method and system
By arranging physical and virtual airport nodes in the power line intersection area and using greedy algorithms to plan the drone jump inspection path, the problem of low drone inspection efficiency in the power line intersection area is solved, and cost reduction and utilization rate are achieved promote.
Patent Information
- Application Number
- CN202411080507.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-08
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-08-08
AI Technical Summary
In the power line intersection area, the existing drone inspection and scheduling methods cannot effectively reduce airport construction costs and implement the optimal drone inspection strategy, resulting in low drone utilization and waste of resources.
The drone airport jumping scheduling method is adopted, by arranging physical and virtual airport nodes on both sides of the intersection of power lines, and using greedy algorithms to plan the optimal jumping patrol path, so that the drone can efficiently complete patrols within the crossing line range. Inspection tasks.
It reduces the cost of airport construction, improves the utilization rate of drones, reduces manual operation processes, makes drone inspection more intelligent, and realizes efficient inspection of power line crossing areas.
Smart Images

Figure CN118609430B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of unmanned aerial vehicle inspection, and in particular to a method and system for dispatching unmanned aerial vehicle airport hopping. Background Art
[0002] The statements in this section merely provide background art related to the present invention and do not necessarily constitute prior art.
[0003] The fully autonomous inspection operation mode of intelligent control drone airports has been applied on a large scale in the power sector. Drone airports provide storage, charging and information exchange functions for drones. After the airport is deployed, drones in the airport can conduct autonomous inspections of power lines and towers within the coverage radius of their inspections. The intersection of two power lines is an area with intensive inspection tasks. Generally, multiple airports are set up to cooperate with the inspections. The on-site layout is mostly deployed in the form of one airport with one drone, and the drones are used in a round-trip operation mode. Each drone inspects a fixed area, and there is no connection between airports.
[0004] The regular inspection cycle of power lines is generally one month, and it takes less than 40 minutes for a drone to complete an inspection task. Therefore, the time it takes for a drone to complete the inspection tasks of all lines within its inspection range is much less than one month. This causes the drone to remain stationary for a long time after completing the inspection tasks in its fixed inspection area, making the utilization rate of the drone low. Therefore, densely deploying multiple drones in the same area will waste resources and increase inspection costs. At present, there is a study on the continuous flight inspection scheduling method of one drone corresponding to multiple airports, but the scheduling method studied does not consider the application details of the specific inspection scenario. If the existing technical solution is applied to the special inspection scenario of the intersection area of two power lines, it will not be able to achieve the purpose of significantly reducing the airport construction cost and realizing the optimal drone inspection strategy. Summary of the invention
[0005] In order to address the deficiencies in the prior art, the present invention provides a method and system for dispatching UAV airport hopping flights, which solves the actual inspection problem at the intersection of power lines. A single task can complete the inspection of all towers that meet the inspection conditions within the entire intersection range, thereby improving the utilization rate of UAVs.
[0006] In order to achieve the above object, the present invention adopts the following technical solution:
[0007] In a first aspect, the present invention provides a method for scheduling an airport hopping flight of a UAV.
[0008] A method for scheduling UAV airport hopping flight, wherein a physical airport is arranged on each side of the intersection of two inspection lines, and a physical airport is arranged in the direction of the extension lines of two power lines, with the two determined physical airports as the base points. When a physical airport is located on multiple inspection lines, a virtual airport corresponding to the airport is assigned. All physical airports and virtual airports constitute an airport node set, and the following hopping flight scheduling process is performed:
[0009] Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0010] Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously.
[0011] Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
[0012] In a second aspect, the present invention provides a drone airport hopping scheduling system.
[0013] A UAV airport skipping dispatching system is provided. A physical airport is arranged on each side of the intersection of two inspection lines. The two determined physical airports are used as base points. A physical airport is arranged in the direction of the extension lines of two power lines. When a physical airport is located on multiple inspection lines, a virtual airport corresponding to the airport is assigned. All physical airports and virtual airports constitute an airport node set. The skipping dispatching system includes:
[0014] The jump node selection unit is configured to: calculate the distance between the current airport node where the UAV is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0015] The skip route generation unit is configured to: add the selected next airport node to be skipped to the skip route and mark it as visited, and if there are multiple airport nodes with the shortest distance and the same constraints at the current airport node, then synchronously record another parallel route;
[0016] The inspection route generation unit is configured to: repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge repeated virtual nodes, and obtain the final inspection route.
[0017] In a third aspect, the present invention provides a computer device, comprising: a processor and a computer-readable storage medium;
[0018] a processor adapted to execute a computer program;
[0019] A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by the processor, the following process is implemented:
[0020] Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0021] Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously.
[0022] Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
[0023] In a fourth aspect, the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program is suitable for being loaded by a processor and executing the following process:
[0024] Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0025] Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously.
[0026] Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
[0027] In a fifth aspect, the present invention provides a computer program product, the computer program product comprising a computer program, and when the computer program is executed by a processor, the following process is implemented:
[0028] Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0029] Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously.
[0030] Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
[0031] Compared with the prior art, the present invention has the following beneficial effects:
[0032] The present invention innovatively proposes a method for scheduling UAV airport hopping, designs a method for arranging multiple airports for a single UAV in an inspection area of crossing power lines, and proposes a method for planning the optimal hopping inspection path for UAVs based on a greedy algorithm; the locations of hopping airports are arranged according to the direction of crossing power lines, the connection between the airports is established, the airports with UAVs and all airports suitable for hopping within the range of crossing power lines are retrieved, the optimal hopping inspection route for UAVs is planned based on the greedy algorithm, and the UAV completes the inspection tasks of all towers with inspection conditions within the entire crossing line range according to the optimal route; the actual inspection problem at the intersection of power lines is solved, the airport construction cost is reduced, the utilization rate of UAVs is improved, the manual operation process is reduced, and the UAV inspection is made more intelligent.
[0033] Advantages of additional aspects of the present invention will be given in part in the following description, and in part will become obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] The accompanying drawings in the specification, which constitute a part of the present invention, are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations on the present invention.
[0035] Figure 1 The airport layout diagram of the power line intersection area provided in Example 1 of the present invention;
[0036] Figure 2 A schematic diagram of a fly-by inspection route provided in Example 1 of the present invention;
[0037] Figure 3 A schematic diagram of the numbering of airfields for jumping off a plane provided in Example 1 of the present invention;
[0038] Figure 4 A schematic diagram of the transformation of the airport-hopping traveling salesman problem (TSP) provided in Example 1 of the present invention;
[0039] Figure 5A schematic diagram of the fly-by process provided in Example 1 of the present invention. DETAILED DESCRIPTION
[0040] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.
[0041] It should be noted that the following detailed descriptions are exemplary and are intended to provide further explanation of the present invention. Unless otherwise specified, all technical and scientific terms used herein have the same meanings as those commonly understood by those skilled in the art to which the present invention belongs.
[0042] In the absence of conflict, the embodiments of the present invention and the features of the embodiments may be combined with each other.
[0043] Embodiment 1:
[0044] According to actual inspection experience, when an airport cooperates with a drone to perform inspection tasks along power lines, the inspection radius is about 4 kilometers, that is, the drone's power just meets the endurance requirement of being able to fly back to the airport where it takes off after completing the 4-kilometer inspection task; the drone can achieve an endurance of more than 30 kilometers when flying in a straight line. Based on the above values, the layout of the airfield for jumps in the area where power lines intersect is as follows: Figure 1 As shown in the figure, first, the line intersection is taken as the midpoint, and a jump-fly airport is arranged on each side of it. The distance between the two airports is required to be 6 kilometers, and both airports meet the inspection requirements of all line towers within their inspection radius; then, the airport whose position is determined by the first two airports is taken as the base point, and an airport is set up in an area about 6 kilometers away from the base airport and less than 1.5 kilometers away from the extension lines of the two power lines. The layout location of the airport should give priority to the place with suitable geographical environment and closest to the power line in the area that meets the requirements. This layout method can basically meet the inspection requirements of most power lines. If there are special lines with a large tower density, the inspection requirements can be guaranteed by shortening the 6-kilometer distance or increasing the number of airports, and the changes made do not affect the overall inspection strategy.
[0045] It can be understood that the selection of the airport in the extension direction can be carried out in the following way: with the base point as the center, draw a circle with a radius of R1 (6 kilometers). This circle has an intersection with the extension line of the line. The airport can be set up near this intersection, based on the on-site environment, the closer the better. Specifically, with this intersection as the center, draw a circle with a radius of R2 (1.5 kilometers). The airport in the extension direction is located in the preferred location within this small circle (i.e. the circle with a radius of R2).
[0046] In this implementation, a drone is deployed in the airport. Figure 2As shown in the figure, during conventional inspection, the drone can complete the inspection task of the power lines within the inspection radius of the current airport 1, that is, the inspection of the AB and BC sections. Only one section of the line can be inspected in one mission, and it needs to fly back to the take-off point airport in a straight line after the inspection is completed. After the jump flight inspection is adopted, the drone can take off from Airport 1, complete the inspection task of a section of the line (BC section) within the inspection radius of the current airport, continue to inspect forward, complete the inspection task of another section of the same power line (DE section) within the inspection range of Airport 2, which is 6 kilometers away from the airport, and then land at Airport 2.
[0047] In this implementation, before formulating the jump inspection route planning, various parameters that need to be considered in the jump inspection process should be analyzed according to the inspection task requirements. Here, only the jump inspection lines in the power line intersection area are considered, and the lines that cannot be jumped for inspection are not within the scope of this planning.
[0048] Now Figure 1 Taking the planned 6 airport layout as an example, the airports involved in the jump flight planning in the power line intersection area are numbered, and the routes that the drone needs to complete the inspection task when jumping are marked. Figure 3 As shown, there is a single inspection route between Airport 1 and Airport 2, Airport 2 and Airport 3, Airport 4 and Airport 5, and Airport 4 and Airport 6; Airport 3 and Airport 4 are at the intersection of the routes, and the UAV cannot complete the inspection of two routes in a single jump, so two inspection routes are set here.
[0049] The inspection route requires the drone to start from an airport and complete all the marked inspection routes in the figure by hopping between airports. It should be noted that when performing the hopping mission, if there is an unexecuted inspection mission between the two airports, the drone will perform the inspection route flight; if the inspection mission between the two airports has been completed or there is no inspection route between the two airports, the drone will perform a straight flight route. For example, if the drone jumps from airport 1 to airport 3 for the first time, there is an inspection route between airport 1 and airport 3, and the drone executes the inspection route. After the mission is completed, if the drone jumps from airport 1 to airport 3, it will execute a straight flight route; if the drone jumps from airport 1 to airport 6, since there is no inspection route between the two airports, the drone will directly execute a straight flight route. Since the drone can achieve a range of more than 30 kilometers when flying in a straight line, the drone can hop between any two airports in the intersection area of the power lines when executing a straight flight route.
[0050] When planning the hopping inspection route, the drone is required to complete all inspection tasks in the power line crossing area with the shortest flight distance. Based on the above information, it is concluded that the hopping inspection path planning problem is similar to the traveling salesman problem (TSP).
[0051] Airports are vertex sets , ;
[0052] The distance between airports is defined as ;
[0053] set up ;
[0054] The mathematical model is established as follows:
[0055] (1);
[0056] Among them, K is all non-empty subsets of V, is the number of nodes contained in the set K.
[0057] Since there is a designated inspection route for hopping flights, and airports in the area can be visited repeatedly, the hopping inspection path planning problem is transformed into a traveling salesman problem (TSP). The constraints of the hopping flight path need to be adjusted. Figure 1 Taking the planned layout of 6 airports as an example, constraints are established.
[0058] In this implementation, there are 4 inspection routes connected to Airport 3 and Airport 4 respectively. To complete the entire inspection task, the drone needs to pass through Airport 3 and Airport 4 three times. Therefore, two virtual nodes 3', 3'' and 4', 4'' are added to Node 3 and Node 4 in the algorithm. Figure 4 shown.
[0059] A greedy algorithm is used to solve the TSP problem and plan the optimal path.
[0060] Airports are vertex sets , ;
[0061] In order to meet the constraints in the greedy algorithm and achieve the required planning purpose, the distance between airports in the algorithm is set to the defined distance, that is, the defined distance between each airport is , the actual distance is ;
[0062] The optimal path is based on the prerequisite of completing all inspection tasks. The inspection route must be selected first. According to the basic setting of the greedy algorithm, it is defined here ;
[0063] Constrain the spacing between the virtual nodes 3', 3'', 4', and 4'' that have inspection line relationships:
[0064] (2);
[0065] (3);
[0066] (4);
[0067] (5);
[0068] (6);
[0069] According to the greedy algorithm nearest neighbor strategy, list the node distance cost matrix:
[0070] (7);
[0071] The specific steps to solve the optimal fly-by inspection path problem based on the greedy algorithm are as follows:
[0072] (1) Select the airport where the current drone is located as the first take-off point node;
[0073] (2) Calculate the distances of all nodes that have not been flown to the current airport, and select the node with the closest distance as the next airport node to be flown to. The distance between two nodes that have not performed inspection tasks is defined as , that is, the distance is infinitely small, the current node will give priority to performing the inspection task;
[0074] (3) Add the selected next airport node to the hop route and mark it as visited;
[0075] (4) If there are multiple airport nodes with the shortest distance and the same constraints for the current airport node, another parallel route is recorded simultaneously;
[0076] (5) Repeat steps (2), (3) and (4) until all airport nodes are marked;
[0077] (6) Compare all calculated parallel route data and select the route with the shortest total distance;
[0078] (7) Merge duplicate virtual nodes and develop real inspection routes.
[0079] Here, we assume that Airport 1 is the first take-off point node. Using the above algorithm, we can calculate Figure 1 The optimal hop inspection route for the planned 6-airport layout is as follows:
[0080] Node 1 jumps to node 3, the distance ; Node 3 jumps to node 2, the distance ; Node 2 jumps to node 3', the spacing ; Node 3' jumps to node 4, spacing ; Node 4 jumps to node 5, the distance ; Node 5 jumps to node 4', the spacing ; Node 4' jumps to node 6, spacing ; Node 6 jumps to node 4'', spacing ; Node 4'' jumps to node 3'', spacing .
[0081] By merging the duplicate virtual nodes, the actual inspection route is as follows:
[0082] Airport 1 jumps off Airport 3 to perform inspection tasks; Airport 3 jumps off Airport 2 to perform inspection tasks; Airport 2 jumps off Airport 3 and flies in a straight line; Airport 3 jumps off Airport 4 to perform inspection tasks; Airport 4 jumps off Airport 5 to perform inspection tasks; Airport 5 jumps off Airport 4 and flies in a straight line; Airport 4 jumps off Airport 6 to perform inspection tasks; Airport 6 jumps off Airport 4 and flies in a straight line; Airport 4 jumps off Airport 3 to perform inspection tasks; The UAV completes all inspection tasks in the area and stays at Airport 3, waiting to perform the next inspection task.
[0083] Specific jump flight process, such as Figure 5 As shown, the following process is included:
[0084] (1) Before issuing a task.
[0085] A background control system is set up. Before the inspection task is issued, the control system searches for airports where drones are parked and the drone power meets the inspection requirements in the intersection area of power lines. At the same time, it determines the lines that need to be inspected, locks the available hop-off airports that need to be inspected in the intersection area of power lines, numbers all airports, and enables the greedy algorithm to complete the drone hop-off inspection path planning.
[0086] (2) Task execution.
[0087] The backend control system first sends the jump flight inspection task to the drone's take-off airport (Airport 1) and the second airport on the inspection route (Airport 2 for short). The take-off airport opens the cabin door, turns on the remote control, starts the drone, and returns to the center. The industrial computer sends the inspection task information to the remote control, which parses the inspection task information, sets task-related information, and the drone conducts self-inspection and starts taking off.
[0088] Based on the planned inspection route, the drone determines whether the current mission is an inspection mission or a straight-line flight to Airport 2;
[0089] During the flight of the drone, Airport 2 receives the route mission and monitors the status information of Airport 1 through MQTT;
[0090] Topic subscription between two airports:
[0091] Airport 1: Subscribe to the status of the door, platform, and centering pole of Airport 2;
[0092] Airport 2: subscribe to aircraft status, airport 1 remote controller status (landing, etc.);
[0093] The inspection task information sent includes the SN of airport 1, the SN of airport 2, the SN of the aircraft, the home point of airport 2, the alternate landing point of airport 1, the alternate landing point of airport 2, and the target airport for the drone to return to when arriving at each waypoint (the home point is changed only at one waypoint);
[0094] When the drone performs inspection tasks, it pushes the drone task status information and drone information through MQTT;
[0095] Airport 2 monitors the status of Airport 1. If it detects that the drone has arrived above the airport, Airport 2 starts to open the cabin and raise the platform. The remote controller in Airport 1 no longer notifies Airport 1 to open the cabin door. The remote controller in Airport 1 controls the drone to start descending and determines whether it has reached the visual landing altitude. When it reaches the visual landing altitude, it stops landing and determines whether it has received information from Airport 2 whether the cabin opening has been completed.
[0096] After the cabin opening of Airport 2 is completed, Airport 2 pushes the cabin opening completion information through MQTT. When the remote controller of Airport 1 detects that the cabin opening of Airport 2 is completed, it controls the drone to visually land at Airport 2.
[0097] After landing, Airport 2 will link with the drone and send a successful link message to the backend control system.
[0098] After the frequency binding is completed, the remote controller in Airport 2 starts downloading drone pictures, renaming them and sending them back;
[0099] After the image is uploaded, Airport 2 pushes the image upload completion message through MQTT. After Airport 1 receives the completion message, it enters the standby state, the hopping mission is completed, Airport 1 and Airport 2 return to the standby state, and notify the background control system to release the hopping binding between Airport 1 and Airport 2;
[0100] At this point, the hopping inspection mission between Airport 1 and Airport 2 is completed, and the drone stays in Airport 2 to charge;
[0101] When the drone's battery level meets the requirements for the next inspection, there is no need for manual re-issuance of the inspection task. The background control system will automatically repeat the above execution process. The drone will complete the hopping inspection tasks from airport 2 to airport 3 and finally to airport n in sequence according to the planned optimal inspection path.
[0102] Embodiment 2:
[0103] This implementation provides a UAV airport skipping dispatching system. A physical airport is arranged on each side of the intersection of two inspection lines. The two physical airports are used as base points. A physical airport is arranged in the direction of the extension lines of the two power lines. When a physical airport is located on multiple inspection lines, a virtual airport corresponding to the airport is assigned. All physical airports and virtual airports constitute an airport node set, including:
[0104] The jump node selection unit is configured to: calculate the distance between the current airport node where the UAV is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0105] The skip route generation unit is configured to: add the selected next airport node to be skipped to the skip route and mark it as visited, and if there are multiple airport nodes with the shortest distance and the same constraints at the current airport node, then synchronously record another parallel route;
[0106] The inspection route generation unit is configured to: repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge repeated virtual nodes, and obtain the final inspection route.
[0107] It is understandable that the above-mentioned units can be separately or completely combined into one or several other units, or some of the units can be further divided into multiple functionally smaller units, which can achieve the same operation without affecting the realization of the technical effects of the embodiments of the present application. The above-mentioned units are divided based on logical functions. In actual applications, the functions of one unit can also be implemented by multiple units, or the functions of multiple units can be implemented by one unit. In other embodiments of the present application, the drone airport hopping dispatch system may also include other units. In actual applications, these functions can also be implemented with the assistance of other units, and can be implemented by the collaboration of multiple units.
[0108] According to another embodiment of the present application, the system described in this embodiment and the drone airport hopping scheduling method of the embodiment of the present application can be constructed by running a computer program (including program code) capable of executing the steps involved in the corresponding method described in Example 1 on a general computing device such as a computer including processing elements and storage elements such as a central processing unit (CPU), random access memory (RAM), and read-only memory (ROM). The computer program can be recorded on, for example, a computer-readable recording medium, and loaded into the above-mentioned computing device through the computer-readable recording medium and run therein.
[0109] Embodiment 3:
[0110] This implementation provides an electronic device, which includes a processor, a communication interface, and a computer-readable storage medium, wherein the processor, the communication interface, and the computer-readable storage medium may be connected via a bus or other means.
[0111] Among them, the communication interface is used to receive and send data, the computer-readable storage medium can be stored in the memory of the electronic device, the computer-readable storage medium is used to store a computer program, the computer program includes program instructions, and the processor is used to execute the program instructions stored in the computer-readable storage medium.
[0112] A processor (or CPU (Central Processing Unit)) is the computing core and control core of an electronic device, which is suitable for implementing one or more instructions, and specifically suitable for loading and executing one or more instructions to implement corresponding method flows or corresponding functions.
[0113] The processor is configured to perform the following process:
[0114] Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0115] Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously.
[0116] Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
[0117] Embodiment 4:
[0118] This implementation provides a computer-readable storage medium (Memory), which is a memory device in an electronic device for storing programs and data. It is understandable that the computer-readable storage medium here can include both built-in storage media in the electronic device and, of course, extended storage media supported by the electronic device. The computer-readable storage medium provides a storage space that stores the processing system of the electronic device.
[0119] In addition, the storage space also stores one or more instructions suitable for being loaded and executed by the processor, and these instructions may be one or more computer programs (including program codes). It should be noted that the computer-readable storage medium here may be a high-speed RAM memory, or a non-volatile memory (non-volatile memory), such as at least one disk storage; optionally, it may also be at least one computer-readable storage medium located away from the aforementioned processor.
[0120] In one embodiment, the computer-readable storage medium stores one or more instructions; the processor loads and executes the one or more instructions stored in the computer-readable storage medium to implement the following process:
[0121] Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0122] Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously.
[0123] Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
[0124] Embodiment 5:
[0125] The present implementation provides a computer program product or a computer program, which includes computer instructions stored in a computer-readable storage medium. A processor of an electronic device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the electronic device performs the following process:
[0126] Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped;
[0127] Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously.
[0128] Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
[0129] A person skilled in the art can appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in this application can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. A person skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0130] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted through a computer-readable storage medium. The computer instructions can be transmitted from a website site, a computer, a server or a data center to another website site, a computer, a server or a data center by wired (e.g., coaxial cable, optical fiber, digital line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can access or a data processing device such as a server, a data center, etc. that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive (SSD)), etc.
[0131] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
Claims
1. A method for dispatching UAV airport hopping flight, characterized in that: A physical airport is arranged on each side of the intersection of the two inspection lines. Taking the two physical airports as the base points, a physical airport is arranged in the direction of the extension lines of the two power lines. When a physical airport is located on multiple inspection lines, a virtual airport corresponding to this airport is assigned. All physical airports and virtual airports constitute an airport node set, and the following hopping scheduling process is performed: Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped; Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously. Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route; The objective function of inspection route planning is: ,in, , , , , the airport is the vertex set V, , K is all non-empty subsets of V, is the number of nodes contained in the set K, ; The physical airports arranged on both sides of the intersection are defined as the third airport and the fourth airport respectively, the physical airports on the same side of the third airport are defined as the first airport and the second airport, and the physical airports on the same side of the fourth airport are defined as the fifth airport and the sixth airport; In order to complete the entire inspection task, there are four inspection routes connected to the third airport and the fourth airport respectively. The drone needs to pass through the third airport and the fourth airport three times. Two virtual airports are assigned to the third airport, which are defined as the first virtual airport and the second virtual airport respectively. Two virtual airports are assigned to the fourth airport, which are defined as the third virtual airport and the fourth virtual airport respectively. The final airport node set is ; The distance between airports is defined as , the actual distance is , , constrain the distance between the inspection lines of each virtual airport: ; ; ; ; ; Among them, the distance between two airport nodes that have not performed inspection tasks is defined as infinitesimal, the numbers 1, 2, 3, 4, 5, 6 represent the first airport, the second airport, the third airport, the fourth airport, the fifth airport and the sixth airport respectively, and the numbers 3', 3'', 4', 4'' represent the first virtual airport, the second virtual airport, the third virtual airport and the fourth virtual airport respectively.
2. The method for dispatching UAV airport hopping according to claim 1, characterized in that: A physical airport is arranged in the direction of the extension of the two power lines, including: With a certain base point as the center, draw a first circular area with a radius of R1. The first circular area and the two line extensions on the same side of the current base point each have an intersection point; For any extended line, take the intersection point on the extended line as the center and draw a second circular area with a radius of R2. The airport in the direction of the extended line is selected within the second circular area.
3. The method for dispatching UAV airport hopping according to claim 1, characterized in that: The node route with the shortest total distance is: the first airport jumps to the third airport, and the distance ; The third airport jumps to the second airport, the distance ; The second airport jumps to the first virtual airport, the distance ; The first virtual airport jumps to the fourth airport, the distance ; The fourth airport jumps to the fifth airport, the distance ; The fifth airport jumps to the third virtual airport, the distance ; The third virtual approach jumps to the sixth airport, the distance ; The sixth airport jumps to the fourth virtual airport, the distance ; The fourth virtual airport jumps to the second virtual airport, the distance ; The repeated virtual nodes are merged to obtain the final inspection route, including: the first airport jumps to the third airport to perform the inspection task; the third airport jumps to the second airport to perform the inspection task; the second airport jumps to the third airport and flies in a straight line; the third airport jumps to the fourth airport and performs the inspection task; the fourth airport jumps to the fifth airport and performs the inspection task; the fifth airport jumps to the fourth airport and flies in a straight line; the fourth airport jumps to the sixth airport and performs the inspection task; the sixth airport jumps to the fourth airport and flies in a straight line; the fourth airport jumps to the third airport and performs the inspection task; the drone completes all inspection tasks in the area, stays at the third airport, and waits for the next inspection task.
4. The method for dispatching a UAV to fly at an airport according to any one of claims 1 to 3, characterized in that: Airport i With the airport j The jumps between include: Send the flight inspection task to the airport i and airports on the inspection route j ,Airport i Open the door, turn on the remote control, start the drone, start the return, send the inspection task information to the remote control, so that the remote control can parse the inspection task information, set the task related information, the drone self-checks, and the drone starts to take off; The drone determines whether the current mission is an inspection mission or a straight flight to the airport based on the planned inspection route. j ; During the drone flight, the airport j Receive route tasks and monitor airports via MQTT i Status information; Airport i With the airport j Subscribe to the topic, airport i Subscribe to Airport j Door, platform and centering pole status, airport j Subscribe to the status of the drone and the status of the airport i-remote controller; Airport j Monitoring Airport i Status, if the drone is detected arriving over the airport, the airport j Start opening the cabin and raising the platform, airport i The remote controller no longer notifies the airport i Open the door, airport i The remote control controls the drone to start descending and determines whether it has reached the visual landing altitude. When it reaches the visual landing altitude, it stops landing and determines whether it has received the airport. j Information on whether the hatch opening is completed; Airport j After the cabin is opened, the airport j Push the cabin opening completion information through MQTT, airport i The remote controller monitors the airport j After the cabin is opened, control the drone to land at the airport visually j ; After landing, the airport j Bind with the drone and push the successful binding message to the backend; After the frequency is completed, the airport j The remote controller starts downloading drone images, renaming them and sending them back; After the picture is uploaded, the airport j Push pictures and transmit completed information via MQTT, airport i After receiving the completion message, it enters the standby state, the hopping mission is completed, and the airport i and Airport j Restore to standby mode and notify the backend to release the airport i and Airport j The jump fly binding; So far, the airport i To the Airport j The hopping inspection mission was completed and the drone stayed at the airport. j Charging.
5. The method for dispatching UAV airport hopping according to claim 4, characterized in that: Inspection mission information, including airports i SN, Airport j SN, drone SN, airport j Home point, airport i Alternate landing point, airport j Alternate landing point, when arriving at each waypoint, the drone returns to the target airport.
6. A drone airport hopping dispatching system, characterized in that: A physical airport is arranged on each side of the intersection of the two inspection lines. Taking the two physical airports as the base points, a physical airport is arranged in the direction of the extension lines of the two power lines. When a physical airport is located on multiple inspection lines, a virtual airport corresponding to this airport is assigned. All physical airports and virtual airports constitute an airport node set, including: The jump node selection unit is configured to: calculate the distance between the current airport node where the UAV is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped; The skip route generation unit is configured to: add the selected next airport node to be skipped to the skip route and mark it as visited, and if there are multiple airport nodes with the shortest distance and the same constraints at the current airport node, then synchronously record another parallel route; The inspection route generation unit is configured to: repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge repeated virtual nodes, and obtain the final inspection route; The objective function of inspection route planning is: ,in, , , , , the airport is the vertex set V, , K is all non-empty subsets of V, is the number of nodes contained in the set K, ; The physical airports arranged on both sides of the intersection are defined as the third airport and the fourth airport respectively, the physical airports on the same side of the third airport are defined as the first airport and the second airport, and the physical airports on the same side of the fourth airport are defined as the fifth airport and the sixth airport; In order to complete the entire inspection task, there are four inspection routes connected to the third airport and the fourth airport respectively. The drone needs to pass through the third airport and the fourth airport three times. Two virtual airports are assigned to the third airport, which are defined as the first virtual airport and the second virtual airport respectively. Two virtual airports are assigned to the fourth airport, which are defined as the third virtual airport and the fourth virtual airport respectively. The final airport node set is ; The distance between airports is defined as , the actual distance is , , constrain the distance between the inspection lines of each virtual airport: ; ; ; ; ; Among them, the distance between two airport nodes that have not performed inspection tasks is defined as infinitesimal, the numbers 1, 2, 3, 4, 5, 6 represent the first airport, the second airport, the third airport, the fourth airport, the fifth airport and the sixth airport respectively, and the numbers 3', 3'', 4', 4'' represent the first virtual airport, the second virtual airport, the third virtual airport and the fourth virtual airport respectively.
7. The drone airport hopping dispatching system as claimed in claim 6, characterized in that: The node route with the shortest total distance is: the first airport jumps to the third airport, and the distance ; The third airport jumps to the second airport, the distance ; The second airport jumps to the first virtual airport, the distance ; The first virtual airport jumps to the fourth airport, the distance ; The fourth airport jumps to the fifth airport, the distance ; The fifth airport jumps to the third virtual airport, the distance ; The third virtual approach jumps to the sixth airport, the distance ; The sixth airport jumps to the fourth virtual airport, the distance ; The fourth virtual airport jumps to the second virtual airport, the distance ; The repeated virtual nodes are merged to obtain the final inspection route, including: the first airport jumps to the third airport to perform the inspection task; the third airport jumps to the second airport to perform the inspection task; the second airport jumps to the third airport and flies in a straight line; the third airport jumps to the fourth airport and performs the inspection task; the fourth airport jumps to the fifth airport and performs the inspection task; the fifth airport jumps to the fourth airport and flies in a straight line; the fourth airport jumps to the sixth airport and performs the inspection task; the sixth airport jumps to the fourth airport and flies in a straight line; the fourth airport jumps to the third airport and performs the inspection task; the drone completes all inspection tasks in the area, stays at the third airport, and waits for the next inspection task.
8. A computer device, characterized in that: include: a processor and a computer readable storage medium; a processor adapted to execute a computer program; A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium. When the computer program is executed by the processor, the method for scheduling the airport hopping of a drone according to any one of claims 1 to 5 is used to implement the following process: Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped; Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously. Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is suitable for being loaded by a processor and executing the drone airport hopping scheduling method according to any one of claims 1 to 5, including: Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped; Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously. Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
10. A computer program product, characterized in that The computer program product includes a computer program. When the computer program is executed by a processor, the method for scheduling the airport hopping of a drone according to any one of claims 1 to 5 is used to implement the following process: Calculate the distance between the current airport node where the drone is located and all the airport nodes that have not been jumped, and select the airport node closest to the current airport node as the next airport node to be jumped; Add the next airport node selected to be jumped to the jump route and mark it as visited. If there are multiple airport nodes with the shortest distance and the same constraints as the current airport node, record another parallel route simultaneously. Repeat the above steps until all airport nodes are marked, compare all calculated parallel route data, select the route with the shortest total distance, merge the repeated virtual nodes, and obtain the final inspection route.
