A data processing method for the layout of drone hangars

By traversing pipelines in the digital model to determine the location of the hangar layout, the problems of incomplete coverage and waste of resources in the drone hangar layout are solved, and more efficient pipeline coverage and resource utilization are achieved.

CN117235870BActive Publication Date: 2024-11-29BEIJING BAOLONG HONGRUI TECH CO LTD +1
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202311486013.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-11-09
Publication Date
2024-11-29
Estimated Expiration
2043-11-09

AI Technical Summary

Technical Problem

The prior art is difficult to ensure full coverage of pipelines in the layout of drone hangars, which can easily cause waste of space resources, and rely on manual judgment to lead to incomplete coverage.

Method used

By obtaining the starting point of the pipeline in the digital model, traversing along the line determines the hangar layout position, using circular intersection points and pipeline length calculations to select the hangar layout point, and optimizing the hangar layout position to reduce resource waste.

Benefits of technology

The reasonable coverage of drone hangars has been achieved, the number of hangars has been reduced, the labor cost and space resource waste have been reduced, and the coverage efficiency has been improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117235870B_ABST
    Figure CN117235870B_ABST
Patent Text Reader

Abstract

The present disclosure discloses a data processing method for the layout of a drone hangar, comprising the following steps: S100: in a digital model corresponding to a target area for the layout of the drone hangar, obtaining the starting point of the pipeline where the hangar needs to be laid out; wherein the digital model includes pipelines; S200: starting from the starting point, by traversing along the pipelines in the digital model, the hangar layout position is determined along the line. The method uses the digital model corresponding to the target area for the layout of the drone hangar as the data source, and calculates the hangar layout points of the drone hangar for the pipelines in the digital model in a traversal manner, thereby changing the current problem of incomplete coverage and waste of space resources caused by manual judgment of the hangar layout position.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of computer-aided design, and in particular relates to a data processing method for the layout of a drone hangar. Background Art

[0002] In recent years, various pipeline inspections have increasingly used drones and drone hangars to improve intelligence. Currently, a large number of manufacturers have begun to develop hangars and apply them to the power grid industry, oil and gas pipeline industry, emergency rescue, and forestry security. The use of hangars allows relevant field personnel to perform related business without having to bring drones to the site, which can greatly improve work efficiency and reduce manpower waste. The hangar can protect the drone and charge it, avoiding the need for field personnel to carry it every time the operation is carried out. It can be seen that the hangar is suitable for man-machine operation projects with fixed objects and fixed businesses, and reducing repetitive operations is an important purpose of using a hangar.

[0003] The inspection of pipeline (line) networks is very suitable for hangar application scenarios, such as power line inspection and oil and gas pipeline inspection, but the communication range of the hangar and the range of the drone are limited. For example, DJI's airport operation range is 7km. Therefore, the pipeline (line) network in a region requires multiple hangars to work together to complete coverage.

[0004] The existing technical solutions, on the one hand, manually deploy drone hangars, and on the other hand, overly rely on manual judgment on where to place the hangars. This makes it difficult to ensure that all pipelines are covered with fewer drone hangars. Not only is it possible that some pipe sections are not covered, but it is even possible that too many hangars are used to achieve the purpose of covering the pipeline (line) network, resulting in a waste of space resources.

[0005] How to arrange multiple drone hangars to achieve reasonable coverage of pipelines, not only comprehensive coverage but also no waste of space resources, is a technical problem that needs to be solved urgently in this field. Summary of the invention

[0006] In order to solve the above problems, the present disclosure provides a data processing method for the deployment of drone hangars, comprising the following steps:

[0007] S100: In a digital model corresponding to a target area for the deployment of a drone hangar, a starting point of a pipeline where the hangar needs to be deployed is obtained; wherein the digital model includes the pipeline;

[0008] S200: Starting from the starting point, by traversing along the pipeline in the digital model, the hangar layout position is determined along the line;

[0009] Step S200 further includes the following steps:

[0010] S201: Draw a circle with the starting point as the center and L as the radius to obtain the intersection points P1, ..., pn with the pipeline, where n is an integer and not negative:

[0011] S202: When n=0, it indicates that the pipeline endpoint is traversed, and the endpoint is added as a hangar layout point, and the process ends; when n=1, P1 is a hangar layout point, and step S204 is executed; when n>1, step S203 is executed;

[0012] S203: draw circles with P1, ..., pn as centers and L as radii, calculate the length S1, ..., Sn of the pipelines in each circle, and select the center Pmax of the circle with the largest pipeline length as a hangar layout point;

[0013] S204: Draw a circle with the new hangar layout point obtained as the center and L as the radius, calculate the intersection of the circle and the pipeline, and use the intersection that has never been a starting point as a new starting point. If the new starting point is not the endpoint of the pipeline, continue to execute step S201 until the traversal is completed.

[0014] Through the above technical scheme, the digital model corresponding to the target area for the layout of the drone hangar is used as the data source, and the hangar layout points of the drone hangar are calculated for the pipelines in the digital model in a traversal manner, thereby changing the current problem of incomplete coverage and waste of space resources caused by manual judgment of the hangar layout position. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 It is a flow chart of a data processing method for the deployment of a drone hangar provided in one embodiment of the present disclosure;

[0016] Figure 2 This is a schematic diagram of determining the layout position of a hangar along a line when n=1 in one embodiment of the present disclosure;

[0017] Figure 3 This is a schematic diagram of determining the layout position of a hangar along a line when n>1 in one embodiment of the present disclosure;

[0018] Figure 4 It is a schematic diagram of finding the center of a circle with the largest pipeline length as a hangar layout point when n>1 in one embodiment of the present disclosure;

[0019] Figure 5 This is a schematic diagram of searching for a new starting point when n>1 in one embodiment of the present disclosure;

[0020] Figure 6 is a known pipeline data diagram in one embodiment of the present disclosure;

[0021] Figure 7is a rectangular schematic diagram of obtaining a starting point from a boundary of a pipeline in one embodiment of the present disclosure;

[0022] Figure 8 is a schematic diagram of a convex hull of obtaining a starting point from a boundary of a pipeline in one embodiment of the present disclosure;

[0023] Fig. 9 This is a schematic diagram of obtaining a starting point by weight in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0024] In order to make those skilled in the art understand the technical solutions disclosed in the present disclosure, the following will be combined with the embodiments and related appended Figures 1 to 9 , the technical solutions of various embodiments are described, and the described embodiments are part of the embodiments of the present disclosure, rather than all of the embodiments. The terms "first", "second", etc. used in the present disclosure are used to distinguish different objects, rather than to describe a specific order. In addition, "including" and "having" and any variations thereof are intended to cover and not exclude inclusion. For example, a process, or method, or system, or product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes steps or units that are not listed, or optionally also includes other steps or units inherent to these processes, methods, systems, products or devices.

[0025] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present disclosure. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It will be understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0026] In one embodiment, Figure 1 As shown, a data processing method for the deployment of a drone hangar is disclosed, comprising the following steps:

[0027] S100: In a digital model corresponding to a target area for the deployment of a drone hangar, a starting point of a pipeline where the hangar needs to be deployed is obtained; wherein the digital model includes the pipeline;

[0028] S200: Starting from the starting point, by traversing along the pipeline in the digital model, the hangar layout position is determined along the line;

[0029] Step S200 further includes the following steps:

[0030] S201: Draw a circle with the starting point as the center and L as the radius to obtain the intersection points P1, ..., pn with the pipeline, where n is an integer and not negative:

[0031] S202: When n=0, it indicates that the pipeline endpoint is traversed, and the endpoint is added as a hangar layout point, and the process ends; when n=1, P1 is a hangar layout point, and step S204 is executed; when n>1, step S203 is executed;

[0032] S203: draw circles with P1, ..., pn as centers and L as radii, calculate the length S1, ..., Sn of the pipelines in each circle, and select the center Pmax of the circle with the largest pipeline length as a hangar layout point;

[0033] S204: Draw a circle with the new hangar layout point obtained as the center and L as the radius, calculate the intersection of the circle and the pipeline, and use the intersection that has never been a starting point as a new starting point. If the new starting point is not the endpoint of the pipeline, continue to execute step S201 until the traversal is completed.

[0034] The above-mentioned embodiments of the present disclosure use a data processing method to determine the location of the drone hangar one by one along the line by traversing along the pipeline, and can further determine the starting point of the traversal by a bounding box or weighted method, which provides a basis for the on-site installation site selection of the hangar, so that when selecting a specific site, it is only necessary to survey near the determined location, which will reduce the difficulty of site selection and reduce labor costs. It can be understood that the digital model of the target area in the above-mentioned embodiment is generally three-dimensional, so that the three-dimensional digital information of the pipeline itself in the area can be accurately identified. It can be understood that if the pipeline is very horizontal and or vertically arranged and is always in one plane, then a two-dimensional digital model is also possible, and even in this case, a panoramic photo of the pipeline can also serve as a digital model. In short, due to the existence of the digital model, the pipeline therein can be easily identified through its own digital information. The digital model can generally be obtained from relevant natural resources departments, municipal management departments, and the original construction units of the pipeline. Even if the digital model cannot be obtained from the above sources, a digital model of the target area can be established by shooting videos with drones. At this time, it is also easy to identify the pipelines and their information in the corresponding digital model through existing target recognition technology.

[0035] Specifically, in one embodiment, the pipeline is traversed as follows: a circle is drawn with the starting point as the center and L as the radius to obtain n intersection points with the pipeline, p1, ..., pn. When n=0 is traversed, it means that the endpoint of the pipeline is traversed, the endpoint is added as a hangar layout point, and the current step ends; when n=1, p1 is a hangar layout point, such as Figure 2 as shown; Figure 3 As shown, when n>1, draw circles with p1, ..., pn as the center and L as the radius, such as Figure 4As shown, the length of the pipeline in each circle S1, ..., Sn is calculated, and the center pmax of the circle with the largest pipeline length is selected (pmax belongs to one of p1, ..., pn) as a hangar layout point. This selection can ensure that the hangar covers more pipelines, thereby reducing the number of hangar layouts; draw a circle with the new hangar layout point as the center and L as the radius to calculate the intersection of the circle and the pipeline, and use the intersection point that has never been a starting point as the new starting point, as shown Figure 5 As shown, if the new starting point is not the pipeline endpoint, the above steps are repeated. Wherein L is the maximum effective communication distance of the hangar, that is, the range of maintaining a good communication signal.

[0036] In another embodiment, the method for obtaining the starting point is to obtain the starting point from the boundary of the pipeline.

[0037] In another embodiment, the method of obtaining a starting point from a boundary of a pipeline comprises the following steps:

[0038] S1011: Obtaining an outer enclosing rectangle of the pipeline according to the digital model;

[0039] S1012: Exclude the points that are inflection points of the broken line, and the remaining points are the starting points.

[0040] For this embodiment, firstly, a known real pipeline data is required, such as Figure 6 As shown, and the starting point is obtained from the boundary of the pipeline: i) According to the digital model, the outer enclosing rectangle of the pipeline is obtained, such as Figure 7 As shown in . The reason for obtaining the outer enclosing rectangle is that it is a very simple method to obtain the boundary of the pipeline, and its calculation is simple. In addition to obtaining the outer enclosing rectangle, other graphics can also be obtained to obtain the boundary of the pipeline, such as directly obtaining the convex hull. Figure 8 As shown, the convex hull is a convex polygon. The method of finding the starting point after using the convex hull is the same as that of the rectangle. ii) Excluding P2, which is the turning point of the polyline, P1, P3, P4, and P5 can all be used as starting points. This step is to find the endpoint of the pipeline. The polyline is obviously the middle part of a section of the pipeline, so it needs to be excluded.

[0041] In another embodiment, the method for obtaining the starting point is to obtain the starting point according to weight.

[0042] Specifically, the method for obtaining the starting point according to the weight includes the following steps:

[0043] S1021: Calculate the weight of each point in the pipeline, where the value of the weight is the number of points connected to the current point;

[0044] S1022: Select the point with the largest weight as the first hangar layout point, and draw a circle with the first hangar layout point as the center and L as the radius to obtain the intersection points with the pipeline, and the intersection points are respectively used as starting points.

[0045] In this embodiment, Fig. 9 As shown, by weight: i) Calculate the weight of each point of the pipeline, and the value of the weight is the number of points connected to the current point. ii) Select the point with the largest weight as the first hangar layout point, and use this point as the center and L as the radius to draw a circle to obtain the intersection points P1, P2, P3, and P4 with the pipeline. These points are used as starting points to obtain hangar layout points in the corresponding directions. Among them, 1, 2, 3, and 4 all represent potential hangar layout points, 4 is the point with the largest weight, and L is the maximum effective communication distance of the hangar, that is, the range to maintain a good communication signal. Regarding point 4, it fully illustrates that the larger the weight, the more complex the pipeline at that location. See Fig. 9 , point 4, the number of different straight lines passing through this point is the largest, so the weight of this point is the largest. Directly selecting the point with the largest weight as a preferred hangar layout point can ensure that the hangar covers more pipelines, thereby reducing the number of hangar layouts.

[0046] In another embodiment, in step S1022, if there is more than one point with the largest weight, then any one of the points with the largest weight is selected as the first hangar layout point.

[0047] In another embodiment, after step S200, it is necessary to check whether there are any pipelines that are not covered. If there are any remaining pipelines, they are treated as new pipelines and steps S100 and S200 are repeated until all pipelines are covered.

[0048] In another embodiment, the pipeline includes an electric power pipeline and an oil and gas pipeline.

[0049] Although the embodiments of the present invention are described above in conjunction with the accompanying drawings, the present invention is not limited to the above specific embodiments and application fields, and the above specific embodiments are only illustrative and instructive, rather than restrictive. A person of ordinary skill in the art can also make many forms under the guidance of this specification and without departing from the scope of protection of the claims of the present invention, all of which belong to the protection of the present invention.

Claims

1. A data processing method for the deployment of drone hangars, characterized in that: The steps include: S100: in a digital model corresponding to a target area for the deployment of a drone hangar, obtaining a starting point of a pipeline where the hangar needs to be deployed; wherein the digital model includes the pipeline; S200: Starting from the starting point, by traversing along the pipeline in the digital model, the hangar layout position is determined along the line; Step S200 further includes the following steps: S201: Draw a circle with the starting point as the center and L as the radius to obtain the intersection points P1, ..., pn with the pipeline, where n is an integer and not negative, and L is the maximum effective communication distance of the hangar: S202: When n=0, it indicates that the pipeline endpoint is traversed, and the endpoint is added as a hangar layout point, and the process ends; when n=1, P1 is a hangar layout point, and step S204 is executed; when n>1, step S203 is executed; S203: draw circles with P1, ..., pn as centers and L as radii, calculate the length S1, ..., Sn of the pipelines in each circle, and select the center Pmax of the circle with the largest pipeline length as a hangar layout point; S204: Draw a circle with the new hangar layout point obtained as the center and L as the radius, calculate the intersection of the circle and the pipeline, and use the intersection that has never been a starting point as a new starting point. If the new starting point is not the endpoint of the pipeline, continue to execute step S201 until the traversal is completed; The method of obtaining the starting point is to obtain the starting point from the boundary of the pipeline or to obtain the starting point according to the weight. The method for obtaining a starting point from the boundary of a pipeline comprises the following steps: S1011: Obtaining an outer enclosing rectangle of the pipeline according to the digital model; S1012: exclude points that are inflection points of the broken line, and the remaining points are the starting points; The method for obtaining the starting point by weight comprises the following steps: S1021: Calculate the weight of each point in the pipeline, where the value of the weight is the number of points connected to the current point; S1022: Select the point with the largest weight as the first hangar layout point, and draw a circle with the first hangar layout point as the center and L as the radius to obtain the intersection points with the pipeline, and the intersection points are respectively used as starting points.

2. The method according to claim 1, characterized in that In step S1022, if there is more than one point with the largest weight, then any one of the points with the largest weight is selected as the first hangar layout point.

3. The method according to claim 1, characterized in that After step S200, it is necessary to check whether there are any pipelines that are not covered. If there are any remaining pipelines, they are treated as new pipelines and steps S100 and S200 are repeated until all pipelines are covered.

4. The method according to claim 1, characterized in that The pipelines include power pipelines and oil and gas pipelines.

Citation Information

Patent Citations

  • Site selection method for police UAV parking apron of expressway

    CN108446833A

  • Relay node optimal position selection method applied to Internet of Vehicles curve scene

    CN110446179A

  • Distributed nest charging station suitable for micro unmanned aerial vehicle

    CN115108038A

  • Unmanned aerial vehicle gridding inspection method and system for intelligent site selection of unmanned aerial vehicle nest

    CN115542935A

  • Method and apparatus for allocating beacon codes in unmanned aerial vehicle airport, and unmanned aerial vehicle landing method and apparatus

    WO2023134551A1