CN114528623A

CN114528623A - Pile repair position determining method and device

Info

Publication number: CN114528623A
Application number: CN202210133297.3A
Authority: CN
Inventors: 杨淼中; 张纯笑; 孙德亮
Original assignee: Sungrow Renewables Development Co Ltd
Current assignee: Sungrow Renewables Development Co Ltd
Priority date: 2022-02-11
Filing date: 2022-02-11
Publication date: 2022-05-24

Abstract

The application discloses a pile repair position determining method and device. Wherein, the method comprises the following steps: acquiring square matrix data of a power station, wherein the square matrix data at least comprises: the position coordinates of the box transformer substation, the multiple confluence boxes, the bridge path and the multiple pile base points; determining the shortest path from each combiner box to the box transformer substation along the bridge path, and constructing a tree structure; for each tree structure path, vertically mapping a plurality of pile foundation points into the tree structure path, determining a target bridge span of the tree structure path, determining a first distance between each pair of adjacent pile foundation points on the tree structure path, and taking the adjacent pile foundation points with the first distances larger than the target bridge span as pile foundation point pairs to be repaired; and for each pair of pile foundation pairs to be repaired, equally dividing paths between the pile foundation pairs to be repaired, and determining the positions of pile repairing points at least based on the positions of equally divided points. The method and the device solve the technical problems that manual calculation cost is high when pile filling calculation is carried out on the water surface pile type power station in the related technology, and the calculation accuracy of existing software is poor.

Description

Pile repair position determining method and device

Technical Field

The application relates to the technical field of water surface power station design, in particular to a pile repair position determining method and device.

Background

In surface of water stake formula power station work progress, because the cable needs adopt the mode of laying of crane span structure, when the same crane span structure of cable specification sharing of difference, the gravity of crane span structure can't be lived to current pile foundation, and the time overlength can lead to the crane span structure to warp or even damage, can bring unpredictable loss and risk for the power station. Therefore, how to accurately and efficiently calculate the pile repair position and the pile repair cost becomes one of the problems that must be faced in the construction process of various water surface pile type power stations.

In the current photovoltaic industry, the pile repairing position and the pile repairing cost are usually determined by adopting a manual calculation mode, the calculation cost is high, the period is long, and the calculated pile repairing result is possibly not optimal, so that the cost is increased; however, the existing software can only solve the pile-filling calculation in a simple scene, and the calculation result in a complex scene may have the situations of multiple pile-filling, wrong pile-filling position and the like.

In view of the above problems, no effective solution has been proposed.

Disclosure of Invention

The embodiment of the application provides a pile-repairing position determining method and device, and aims to at least solve the technical problems that in the related art, the manual calculation cost is high when pile-repairing calculation is carried out on a water surface pile type power station, and the calculation accuracy of existing software is poor.

According to an aspect of the embodiments of the present application, there is provided a method for determining a pile repair position, which is applied to a water surface pile power station, and includes: the method comprises the steps of obtaining square matrix data of the power station, wherein the square matrix data at least comprise the following data: the position coordinates of the box transformer substation, the plurality of confluence boxes, the bridge path and the plurality of pile base points; determining the shortest path from each combiner box to the box transformer substation along the bridge path, and constructing a tree structure; for each tree structure path, vertically mapping the pile foundation points into the tree structure path, determining a target bridge span of the tree structure path, determining a first distance between each pair of adjacent pile foundation points on the tree structure path, and taking the adjacent pile foundation points with the first distance larger than the target bridge span as pile foundation point pairs to be repaired; and for each pair of pile foundation pairs to be repaired, equally dividing paths between the pile foundation pairs to be repaired, and determining the positions of pile repairing points at least based on the positions of equally divided points.

Optionally, after acquiring square matrix data of the power station, preprocessing the square matrix data, connecting each junction box T to the bridge path, and taking the obtained position coordinates of each junction box T as the position coordinates of each junction box; and filtering out the position coordinates of the bridge path without the T connection of the combiner box in the square matrix data.

Optionally, the position coordinates of the box transformer substation are used as a root node, the position coordinates of each combiner box are used as leaf nodes, all the leaf nodes are circularly traversed, the shortest path from each leaf node to the root node along the bridge path is determined to be the tree structure path, and the tree structure is constructed.

Optionally, filtering out position coordinates of pile base points in the square matrix data, where a second distance between the square matrix data and the tree structure path is greater than half of a bridge support width; and for each residual pile base point, vertically mapping the pile foundation point to the bridge path closest to the pile foundation point in the tree structure path, and taking the position coordinate of the mapping point as the position coordinate of the pile base point.

Optionally, all the tree structure paths are traversed circularly, a bridge type included in each tree structure path is determined, and a target bridge span of each tree structure path is determined based on the bridge type.

Optionally, for each tree structure path, sorting all the stub points on the tree structure path based on a preset sorting rule; determining a first distance for each pair of adjacent stub points on the tree structure path; and for each pair of adjacent pile base points, comparing a first distance between the adjacent pile base points with a target bridge span of the tree structure path, and when the first distance is greater than the target bridge span, taking the adjacent pile base points as pile foundation point pairs to be repaired.

Optionally, determining a third distance between each pile foundation point on the tree structure path and a combiner box on the tree structure path, and ordering all pile foundation points on the tree structure path based on the third distance; or, sorting all pile base points on the tree structure path from small to large based on the abscissa of each pile base point, and sorting pile base points with the same abscissa based on the ordinate of the pile base points from small to large.

Optionally, an equal-fraction quantity is determined based on the first distance of the pile foundation point pair to be repaired and the target bridge span, and paths between the pile foundation point pair to be repaired are equally divided based on the equal-fraction quantity to determine the position of an equal-fraction point; determining the position of the equal division point as the position of the pile repairing point

Optionally, for each pair of pile foundation points to be repaired, determining whether an intersection point exists between bridge paths where the two pile foundation points to be repaired are located; and when an intersection point exists, determining a fourth distance between the intersection point position and the dividing point position, and when the fourth distance is greater than a preset distance, determining the intersection point position as the pile repair point position.

Optionally, after determining pile repair point positions on all the tree structure paths, circularly traversing all the obtained pile repair point positions, filtering out overlapped pile repair point positions, and calculating a pile repair total cost.

According to another aspect of the embodiments of the present application, there is also provided a pile repair position determining apparatus, including: the acquisition module is used for acquiring square matrix data of the power station, wherein the square matrix data at least comprises: the position coordinates of the box transformer substation, the plurality of confluence boxes, the bridge path and the plurality of pile base points; the construction module is used for determining the shortest path from each confluence box to the box transformer substation along the bridge path and constructing a tree structure; a first determining module, configured to vertically map the multiple pile foundation points to each tree structure path, determine a target bridge span of the tree structure path, determine a first distance between each pair of adjacent pile foundation points on the tree structure path, and use an adjacent pile foundation point, where the first distance is greater than the target bridge span, as a pile foundation point pair to be repaired; and the second determining module is used for equally dividing paths between the pile foundation pairs to be repaired for each pair of the pile foundation pairs to be repaired and determining the positions of the pile repairing points at least based on the positions of the equally divided points.

According to another aspect of the embodiments of the present application, a non-volatile storage medium is further provided, where the non-volatile storage medium includes a stored program, and when the program runs, the device where the non-volatile storage medium is located is controlled to execute the patch position determination method described above.

According to another aspect of the embodiments of the present application, there is also provided a processor, configured to execute a program, where the program executes the method for determining a patch position as described above.

In the embodiment of the application, firstly, square matrix data of a power station are obtained, and position coordinates of a box transformer substation, a plurality of confluence boxes, a bridge path and a plurality of pile base points are obtained; then determining the shortest path from each combiner box to the box transformer substation along the bridge path, and constructing a tree structure; for each tree structure path, vertically mapping a plurality of pile foundation points into the tree structure path, determining a target bridge span of the tree structure path, determining a first distance between each pair of adjacent pile foundation points on the tree structure path, and taking the adjacent pile foundation points with the first distances larger than the target bridge span as pile foundation point pairs to be repaired; and for each pair of pile foundation pairs to be repaired, equally dividing paths between the pile foundation pairs to be repaired, and determining the positions of pile repairing points at least based on the positions of equally divided points. The pile supplementing positions on the paths of each tree structure are calculated by constructing the tree structures of the junction boxes from the bridge paths to the box transformer substation, repeated pile supplementing points are filtered, not only is the calculation complexity low, but also the obtained pile supplementing positions are more accurate, and therefore the technical problems that in the related technology, the manual calculation cost is high when pile supplementing calculation is carried out on a water surface pile type power station, and the calculation accuracy of existing software is poor are solved.

Drawings

The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:

fig. 1 is a schematic flowchart of a method for determining a pile repair position according to an embodiment of the present application;

FIG. 2a is a schematic diagram of a method for determining pile repair points according to an embodiment of the present application;

FIG. 2b is a schematic diagram of another method for determining patch points according to an embodiment of the present disclosure;

FIG. 3 is a schematic flow chart illustrating a process for determining a position of a pile repair point according to an embodiment of the present disclosure;

FIG. 4 is a schematic flowchart of a process of determining whether a tree structure path requires pile repair according to an embodiment of the present disclosure;

fig. 5 is a schematic structural diagram of a patch position determination device according to an embodiment of the present application.

Detailed Description

In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Example 1

According to an embodiment of the present application, there is provided a patch position determination method applied to a surface pile power plant, it should be noted that the steps shown in the flowchart of the drawings may be executed in a computer system such as a set of computer executable instructions, and that although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in an order different from that here.

Fig. 1 is a schematic flowchart of an alternative method for determining a patch position according to an embodiment of the present application, where as shown in fig. 1, the method at least includes steps S102-S108, where:

step S102, square matrix data of the power station are obtained, wherein the square matrix data at least comprise: the position coordinates of the box transformer substation, the plurality of confluence boxes, the bridge path and the plurality of pile base points.

In some optional embodiments of the present application, when determining the pile repair position of the power station, it is first necessary to pre-process the square matrix data of the power station. Specifically, after square matrix data are obtained, firstly, whether a power station corresponding to the square matrix data belongs to a water surface pile type + bridge power station type is judged, if not, subsequent pile supplement calculation is not carried out, if yes, bridge inventory data are obtained, and position coordinates of a box transformer substation, a plurality of confluence boxes, a bridge path and a plurality of pile base points in the power station are determined; then, connecting each bus box T to the bridge path, and using the obtained position coordinates of each T joint as the position coordinates of each bus box; and then filtering out the position coordinates of the bridge path without the T connection of the combiner box in the square matrix data.

And step S104, determining the shortest path from each combiner box to the box transformer substation along the bridge path, and constructing a tree structure.

In some optional embodiments of the present application, when constructing the tree structure, the position coordinates of the box transformer may be used as a root node, the position coordinates of each combiner box may be used as leaf nodes, all the leaf nodes are circularly traversed, and a shortest path from each leaf node to the root node along the bridge path is determined to be a tree structure path, so as to construct a complete tree structure.

Optionally, the bridge type selection may be performed by circularly traversing all the tree structure paths, determining the bridge type corresponding to each tree structure path, and storing the type selection result. The common bridge may exist between different tree structure paths, the common bridge has a larger load bearing capacity, the selection type is different from that of the unshared bridge, and the common bridge and the unshared bridge may exist in one tree structure path at the same time, that is, a plurality of bridge types may exist in one tree structure path.

And S106, for each tree structure path, vertically mapping a plurality of pile foundation points into the tree structure path, determining a target bridge span of the tree structure path, determining a first distance between each pair of adjacent pile foundation points on the tree structure path, and taking the adjacent pile foundation points with the first distances larger than the target bridge span as pile foundation point pairs to be repaired.

And S108, for each pair of pile foundation pairs to be repaired, equally dividing paths between the pile foundation pairs to be repaired, and determining positions of pile repairing points at least based on positions of equally divided points.

After the tree structure is constructed, the positions of the pile repairing points on each tree structure path can be determined in sequence. In some optional embodiments of the present application, for any one tree structure path, the respective pile foundation points are first vertically mapped into the tree structure path.

Specifically, when the second distance between the pile foundation point and the tree structure path exceeds one-half bridge support width, the pile foundation point is repeatedly mapped, so that the position coordinates of a pile foundation point, of which the second distance between the square matrix data and the tree structure path is greater than one-half bridge support width, can be filtered out first; for each of the remaining pile base points, the pile base point may then be vertically mapped to the bridge path closest to the pile base point in the tree structure path, and the position coordinates of the mapped point may be taken as the position coordinates of the pile base point.

In determining the target bridge span for the tree structure path, all tree structure paths may be traversed in a loop, a bridge type included in each tree structure path may be determined, and the target bridge span for each tree structure path may be determined based on the bridge type.

Generally, when only one bridge type is included in a certain tree structure path, the maximum bridge span (maxPileSpan) corresponding to the bridge type can be directly determined as a target bridge span; and when a shared bridge exists in the tree structure path, namely a plurality of bridge types exist, the bridge span corresponding to the suitable bridge type can be selected as the target bridge span according to the principle of minimum pile repairing quantity and minimum cost.

And then, judging whether pile repairing is needed between the pile base points according to the determined target bridge span.

Specifically, for each tree structure path, all the stub points on the tree structure path may be sorted based on a preset sorting rule, where the following two optional sorting rules are provided in the embodiment of the present application for illustration, and naturally, a user may also set the sorting rule according to needs.

In the first sort rule, a third distance between each pile foundation point on the tree structure path and the combiner box on the tree structure path may be determined, and then all pile foundation points on the tree structure path may be sorted based on the third distance, for example, sorting may be performed from near to far or from far to near according to the third distance between each pile foundation point and the combiner box.

In the second sort rule, for all pile base points on the tree structure path, sorting is performed from small to large based on the abscissa of each pile base point, and for pile foundation points with the same abscissa, sorting is performed from small to large based on the ordinate of the pile base point. Naturally, the ordinate may be sorted first, and then the abscissa may be sorted, or sorted in a descending manner.

After all pile foundation points are sequenced, a first distance between each pair of adjacent pile foundation points on a tree structure path can be determined; and for each pair of adjacent pile base points, comparing the first distance between the pair of adjacent pile base points with the target bridge span of the tree structure path, determining that pile repair is not needed when the first distance is smaller than the target bridge span, determining that pile repair is needed when the first distance is larger than the target bridge span, and taking the pair of adjacent pile base points as pile foundation point pairs to be repaired.

Then, when the pile repairing position is determined, an equal fraction quantity can be determined based on a first distance of a pile foundation point pair to be repaired and a target bridge span, paths between the pile foundation point pair to be repaired are equally divided based on the equal fraction quantity, and an equal division point position is determined; and then determining the positions of the equal division points as pile repairing points.

For example, if the first distance between a pair of pile foundation points to be pile-repaired is D and the target bridge span of the corresponding tree structure path is S, the number of equal fractions is determined to be N (D/S) (N is rounded upward), the path between the pair of pile foundation points to be pile-repaired may be equally divided by N, and the obtained positions of N-1 equal division points may be used as the positions of the pile-repaired points.

In some optional embodiments of the present application, a scheme for determining positions of pile repairing points based on the positions of equal division points is further optimized, and for each pair of pile foundation points to be repaired, whether an intersection point exists between bridge paths where the two pile foundation points to be repaired are located is determined; and when the intersection point exists, determining a fourth distance between the intersection point position and the bisection point position, and when the fourth distance is greater than the preset distance, determining the intersection point position as the pile repairing point position. Through filling the pile in the crossing point, the stability of the bridge frame can be effectively improved.

For example, an intersection point C exists between bridge paths where a pile foundation point pair to be repaired AB is located, and the bisection point is set to be D, a fourth distance between CDs is compared with a preset distance (which can be set by a user according to engineering experience), and if the fourth distance is smaller than the preset distance, it is indicated that the intersection point is adjacent to the bisection point, and at this time, two pile repairing points do not need to be set, so that only the bisection point D is reserved as an optimal pile repairing point, as shown in fig. 2 a; if the fourth distance is greater than the preset distance, the intersection point C and the bisector D may be both used as pile repairing points to improve the stability of the bridge, as shown in fig. 2 b.

Fig. 3 shows an optional complete process for determining positions of pile-repairing points, where the square matrix data of the power station is preprocessed, then a tree structure from the combiner box to the box transformer along the bridge path is constructed, for each tree structure path, it is determined whether the tree structure path needs pile repairing, when pile repairing is needed, positions of pile-repairing points are determined based on positions of equal dividing points or positions of intersection points according to the above process, and the process is ended if pile repairing is not needed.

Fig. 4 shows an optional complete process for determining whether a tree structure path needs to be supplemented, specifically, the pile foundation points are filtered, the pile foundation points are vertically mapped into the tree structure path, a target bridge span S of the tree structure path is determined, the pile foundation points on the tree structure path are sorted, then a first distance D between adjacent pile foundation points is circularly calculated, the first distance D is compared with the target bridge span S, the pile needs to be supplemented when D > S, and the position of the pile supplementing point can be determined based on the position of an equal division point or the position of an intersection point according to the above process

After the pile repairing point positions on all the tree structure paths are determined, the problem of repeated pile repairing possibly occurs in consideration of the situation that different tree structure paths share a bridge, so that all the pile repairing point positions obtained through cyclic traversal can be filtered, the overlapped pile repairing point positions can be filtered, and the total pile repairing cost can be calculated.

In the embodiment of the application, firstly, square matrix data of a power station are obtained, and position coordinates of a box transformer substation, a plurality of confluence boxes, a bridge path and a plurality of pile base points are obtained; then determining the shortest path from each combiner box to the box transformer substation along the bridge path, and constructing a tree structure; for each tree structure path, vertically mapping a plurality of pile foundation points into the tree structure path, determining a target bridge span of the tree structure path, determining a first distance between each pair of adjacent pile foundation points on the tree structure path, and taking the adjacent pile foundation points of which the first distances are greater than the target bridge span as pile foundation point pairs to be repaired; and for each pair of pile foundation pairs to be repaired, equally dividing paths between the pile foundation pairs to be repaired, and determining the positions of pile repairing points at least based on the positions of equally divided points. Wherein, through the tree structure that the case becomes along crane span structure route to case of building the collection flow box, calculate the benefit stake position on every tree structure route, refilter and fall repeated benefit stake point, not only the computational complexity is lower, and the benefit stake position that obtains is also more accurate to manual computation cost is higher when having solved among the correlation technique to the stake calculation of surface of water stake formula power station, current software calculates the relatively poor technical problem of rate of accuracy.

Example 2

According to an embodiment of the present application, there is also provided a patch position determining apparatus for implementing the patch position determining method, as shown in fig. 5, the apparatus at least includes an obtaining module 50, a constructing module 52, a first determining module 54 and a second determining module 56, where:

an obtaining module 50, configured to obtain square matrix data of the power station, where the square matrix data at least includes: the position coordinates of the box transformer, the plurality of confluence boxes, the bridge path and the plurality of pile base points.

In some optional embodiments of the present application, when determining a patch pile position of a power station, it is first required to pre-process square matrix data of the power station. Specifically, after square matrix data are obtained, firstly, whether a power station corresponding to the square matrix data belongs to a water surface pile type + bridge power station type is judged, if not, subsequent pile supplement calculation is not carried out, if yes, bridge inventory data are obtained, and position coordinates of a box transformer substation, a plurality of confluence boxes, a bridge path and a plurality of pile base points in the power station are determined; then, connecting each bus box T to the bridge path, and using the obtained position coordinates of each T joint as the position coordinates of each bus box; and then filtering out the position coordinates of the bridge path without the T connection of the combiner box in the square matrix data.

And the building module 52 is used for determining the shortest path from each combiner box to the box transformer along the bridge path to build a tree structure.

The first determining module 54 is configured to, for each tree structure path, vertically map a plurality of pile foundation points into the tree structure path, determine a target bridge span of the tree structure path, determine a first distance between each pair of adjacent pile foundation points on the tree structure path, and use, as a pile foundation point pair to be repaired, the adjacent pile foundation points whose first distance is greater than the target bridge span.

And the second determining module 56 is configured to, for each pair of pile foundation pairs to be repaired, equally divide a path between the pile foundation pairs to be repaired, and determine a position of the pile repairing point based on at least the position of the equally divided point.

After the tree structure is constructed, the positions of the pile repairing points on each tree structure path can be determined in sequence. In some optional embodiments of the present application, for any one tree structure path, the respective pile foundation points are first vertically mapped into the tree structure path. Specifically, when the second distance between the pile foundation point and the tree structure path exceeds one-half bridge support width, the pile foundation point is repeatedly mapped, so that the position coordinates of a pile foundation point, of which the second distance between the square matrix data and the tree structure path is greater than one-half bridge support width, can be filtered out first; for each of the remaining pile base points, the pile base point may then be vertically mapped to the bridge path closest to the pile base point in the tree structure path, and the position coordinates of the mapped point may be taken as the position coordinates of the pile base point.

In determining the target bridge span for the tree structure path, all tree structure paths may be traversed in a loop, a bridge type included in each tree structure path may be determined, and the target bridge span for each tree structure path may be determined based on the bridge type. Generally, when only one bridge type is included in a certain tree structure path, the maximum bridge span (maxPileSpan) corresponding to the bridge type can be directly determined as a target bridge span; and when a shared bridge exists in the tree structure path, namely a plurality of bridge types exist, the bridge span corresponding to the suitable bridge type can be selected as the target bridge span according to the principle of minimum pile repairing quantity and minimum cost.

And then, judging whether pile repairing is needed between the pile base points according to the determined target bridge span. Specifically, for each tree structure path, all the stub points on the tree structure path may be sorted based on a preset sorting rule, where the following two optional sorting rules are provided in the embodiment of the present application for illustration, and naturally, a user may also set the sorting rule according to needs.

It should be noted that, in the embodiment of the present application, each module in the pile repair position determining device corresponds to each implementation step of the pile repair position determining method in embodiment 1 one to one, and since the detailed description has been already made in embodiment 1, details that are not partially shown in this embodiment may refer to embodiment 1, and are not described herein again.

Example 3

According to an embodiment of the application, a nonvolatile storage medium is further provided, and the nonvolatile storage medium includes a stored program, wherein, when the program runs, a device in which the nonvolatile storage medium is located is controlled to execute the method for determining the position of the patch stub in embodiment 1.

According to an embodiment of the present application, there is also provided a processor configured to run a program, where the program executes the method for determining a patch position in embodiment 1 when running.

Specifically, when the program runs, the following steps can be executed: acquiring square matrix data of the power station, wherein the square matrix data at least comprises: the position coordinates of the box transformer substation, the multiple confluence boxes, the bridge path and the multiple pile base points; determining the shortest path from each combiner box to the box transformer substation along the bridge path, and constructing a tree structure; for each tree structure path, vertically mapping a plurality of pile foundation points into the tree structure path, determining a target bridge span of the tree structure path, determining a first distance between each pair of adjacent pile foundation points on the tree structure path, and taking the adjacent pile foundation points with the first distances larger than the target bridge span as pile foundation point pairs to be repaired; and for each pair of pile foundation pairs to be repaired, equally dividing paths between the pile foundation pairs to be repaired, and determining the positions of pile repairing points at least based on the positions of equally divided points.

The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.

In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

In the embodiments provided in the present application, it should be understood that the disclosed technical content can be implemented in other manners. The above-described embodiments of the apparatus are merely illustrative, and for example, a division of a unit may be a division of a logic function, and an actual implementation may have another division, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or may not be executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit may be implemented in the form of hardware, or may also be implemented in the form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.

The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.

Claims

1. A pile repair position determining method is applied to a water surface pile type power station and is characterized by comprising the following steps:

the method comprises the steps of obtaining square matrix data of the power station, wherein the square matrix data at least comprise the following data: the position coordinates of the box transformer substation, the plurality of confluence boxes, the bridge path and the plurality of pile base points;

determining the shortest path from each combiner box to the box transformer substation along the bridge path, and constructing a tree structure;

for each tree structure path, vertically mapping the pile foundation points into the tree structure path, determining a target bridge span of the tree structure path, determining a first distance between each pair of adjacent pile foundation points on the tree structure path, and taking the adjacent pile foundation points with the first distance larger than the target bridge span as pile foundation point pairs to be repaired;

and for each pair of pile foundation pairs to be repaired, equally dividing paths between the pile foundation pairs to be repaired, and determining the positions of pile repairing points at least based on the positions of equally divided points.

2. The method of claim 1, wherein after obtaining the square matrix data for the power station, the method further comprises:

preprocessing the square matrix data, connecting each junction box T to the bridge path, and taking the position coordinates of each T junction as the position coordinates of each junction box;

and filtering out the position coordinates of the bridge path without the T connection of the combiner box in the square matrix data.

3. The method of claim 1, wherein determining a tree structure path for each of the combiner boxes along the bridge path to the box transformer, constructing a tree structure, comprises:

and taking the position coordinates of the box transformer substation as root nodes, taking the position coordinates of each confluence box as leaf nodes, circularly traversing all the leaf nodes, determining the shortest path from each leaf node to the root nodes along the bridge path as a tree structure path, and constructing the tree structure.

4. The method of claim 1, wherein vertically mapping the plurality of stub points into the tree structure path comprises:

filtering out position coordinates of pile base points, of which the second distance from the square matrix data to the tree structure path is larger than half of the width of the bridge support;

and for each residual pile base point, vertically mapping the pile foundation point to the bridge path closest to the pile foundation point in the tree structure path, and taking the position coordinate of the mapping point as the position coordinate of the pile base point.

5. The method of claim 1, wherein determining the target bridge span of the tree structure path comprises:

and circularly traversing all the tree structure paths, determining a bridge type included in each tree structure path, and determining a target bridge span of each tree structure path based on the bridge type.

6. The method of claim 1, wherein determining a first distance for each pair of adjacent pile base points on the tree structure path, and wherein using adjacent pile base points for which the first distance is greater than the target bridge span as a pile pair to be repaired comprises:

for each tree structure path, sequencing all pile base points on the tree structure path based on a preset sequencing rule;

determining a first distance for each pair of adjacent stub points on the tree structure path;

and for each pair of adjacent pile base points, comparing a first distance between the adjacent pile base points with a target bridge span in the tree structure path, and when the first distance is greater than the target bridge span, taking the adjacent pile base points as pile foundation point pairs to be repaired.

7. The method of claim 6, wherein sorting all stub points on the tree structure path based on a preset sorting rule comprises:

determining a third distance between each pile foundation point on the tree structure path and a header box on the tree structure path, and sequencing all pile base points on the tree structure path based on the third distance; or the like, or, alternatively,

and sequencing all pile base points on the tree structure path from small to large based on the abscissa of each pile base point, and sequencing pile base points with the same abscissa based on the ordinate of the pile base points from small to large.

8. The method according to claim 1, wherein for each pair of the pile foundation pairs to be repaired, equally dividing the path between the pile foundation pairs to be repaired, and determining pile repair point positions based at least on the equally divided point positions comprises:

determining equal-fraction quantity based on the first distance of the pile foundation point pair to be repaired and the target bridge span, equally dividing paths between the pile foundation point pair to be repaired based on the equal-fraction quantity, and determining the positions of equal-fraction points; and determining the position of the equal division point as the position of the pile repairing point.

9. The method of claim 8, further comprising:

for each pair of pile foundation points to be repaired, determining whether an intersection point exists between bridge paths where the two pile foundation points to be repaired are located;

and when an intersection point exists, determining a fourth distance between the intersection point position and the dividing point position, and when the fourth distance is greater than a preset distance, determining the intersection point position as the pile repair point position.

10. The method of claim 1, further comprising:

and after determining pile repairing point positions on all the tree structure paths, circularly traversing all the pile repairing point positions, filtering out the superposed pile repairing point positions, and calculating the total pile repairing cost.

11. A pile repair position determining apparatus, comprising:

the acquisition module is used for acquiring square matrix data of the power station, wherein the square matrix data at least comprises: the position coordinates of the box transformer substation, the plurality of confluence boxes, the bridge path and the plurality of pile base points;

the construction module is used for determining the shortest path from each confluence box to the box transformer substation along the bridge path and constructing a tree structure;

a first determining module, configured to vertically map the multiple pile foundation points to each tree structure path, determine a target bridge span of the tree structure path, determine a first distance between each pair of adjacent pile foundation points on the tree structure path, and use an adjacent pile foundation point, where the first distance is greater than the target bridge span, as a pile foundation point pair to be repaired;

and the second determining module is used for equally dividing paths between the pile foundation pairs to be repaired for each pair of the pile foundation pairs to be repaired and determining the positions of the pile repairing points at least based on the positions of the equally divided points.

12. A non-volatile storage medium, characterized in that the non-volatile storage medium comprises a stored program, wherein when the program runs, a device in which the non-volatile storage medium is located is controlled to execute the patch position determination method according to any one of claims 1 to 10.

13. A processor, characterized in that the processor is configured to run a program, wherein the program is configured to execute the patch position determination method according to any one of claims 1 to 10 when running.