Automatic cable laying method, terminal equipment and storage medium

Abstract

The invention relates to an automatic cable laying method, terminal equipment and a storage medium. The method comprises the following steps: acquiring bridge information of each bridge corresponding to a to-be-laid cable; constructing a bridge network adjacency matrix A, a maximum plot ratio matrix V, a laying mode matrix L and a maximum cable accommodating number matrix M based on the bridge information of all bridges; acquiring cable information of each cable in the to-be-laid cables; screening a feasible bridge network adjacency matrix Ac corresponding to each cable from the bridge network adjacency matrix A according to the priority of each configured cable from high to low in combination with the cable information of each cable, the maximum plot ratio matrix V, the laying mode matrix L and the maximum cable accommodating number matrix M; and solving the laying paths of all the to-be-laid cables through a shortest path algorithm. The invention provides an intelligent and efficient cable automatic laying scheme.

Description

Technical Field

[0001] The present invention relates to the field of cable laying, and in particular to an automatic cable laying method, terminal equipment and storage medium. Background Art

[0002] Cable laying is an indispensable part of the factory power design system. The original manual laying method is not only inefficient but also prone to errors, and has gradually been eliminated. The automatic laying method realized by intelligent algorithms has gradually become the mainstream method of cable laying due to its intelligent and efficient characteristics. A good automatic cable laying method can not only save the design time of designers, but also save the total purchase cost of cables.

[0003] When laying cables, special power equipment is usually needed as support or external protection, such as bridges, buried pipes, and pipes (for convenience, these materials are uniformly referred to as bridges in the following text). The topological network composed of interconnected bridges is called a bridge network, which determines the actual path that the cables can take. Since the bridge is limited by the structure inside the factory and the space occupied by other equipment during actual installation, it cannot be placed arbitrarily, so the design of the cable bridge network needs to be completed before automatic cable laying.

[0004] The essence of automatic cable laying is to find a feasible shortest path between the starting equipment and the end equipment corresponding to all cables in the cable list in the established bridge network. Since each cable needs to consider the voltage level, maximum volume ratio, partition, maximum number of cables, single / multi-layer laying and other constraints of each bridge itself when selecting the laying path, only the bridge path that meets all constraints can be used as a feasible path. The shortest path of the current cable to be laid can be solved by using the shortest path algorithm on the feasible bridge network composed of all feasible paths. In summary, for each cable to be laid, the feasible bridge network must be obtained from the complete bridge network, and then the shortest path algorithm is used to solve the shortest path. However, as more and more cables are laid, the volume ratio and the number of laid cables of the bridge involved in the laying will continue to increase until the maximum volume ratio upper limit and the maximum number of cables can be reached, so that it cannot participate in the subsequent cable laying process. This also means that the feasible bridge network is constantly changing.

[0005] The shortest path algorithm undoubtedly has a great impact on the solution quality and efficiency of automatic cable laying. However, there are a large number of mature algorithms of different types on the market that can be used directly. However, there is no unified and mature solution for the recording form and acquisition method of feasible bridge networks, which will also have a great impact on the overall solution quality and efficiency of automatic cable laying. Summary of the invention

[0006] In order to solve the above problems, the present invention proposes an automatic cable laying method, terminal equipment and storage medium.

[0007] The specific plan is as follows:

[0008] A method for automatic cable laying comprises the following steps:

[0009] S1: Obtaining bridge information of each bridge corresponding to the cables to be laid;

[0010] S2: construct the bridge network adjacency matrix A, the maximum volume ratio matrix V, the laying mode matrix L and the maximum cable capacity matrix M based on the bridge information of all bridges;

[0011] S3: Obtaining cable information of each cable in the cables to be laid;

[0012] S4: Based on the priorities of the configured cables, in descending order of priority, combined with the cable information of each cable and the maximum volume ratio matrix V, the laying mode matrix L and the maximum cable holding number matrix M, the feasible bridge network adjacency matrix A corresponding to each cable is selected from the bridge network adjacency matrix A. c , and then solve the laying paths of all cables to be laid through the shortest path algorithm.

[0013] Furthermore, the bridge information includes: the height and width of the bridge section, the starting coordinates and the ending coordinates of the bridge, the maximum volume ratio of the bridge, the length of the bridge, the voltage level corresponding to the bridge, the laying method of the bridge and the maximum number of cables that the bridge can accommodate.

[0014] Furthermore, the dimensions of the bridge network adjacency matrix A, the laying mode matrix L and the maximum cable holding number matrix M are all N×N×count_v, where N represents the total number of nodes contained in the bridge network, count_v represents the total number of voltage levels, the first dimension index index1 and the second dimension index index2 both represent the node sequence number, and the third dimension index index3 represents the voltage level; the value of each element in the bridge network adjacency matrix A represents the length of the bridge between two nodes; the laying mode matrix L represents the laying mode of the bridge between two nodes; the maximum cable holding number matrix M represents the maximum number of cables that can be held in the bridge between two nodes;

[0015] The dimension of the maximum volume ratio matrix V is N×N×count_v×3, the first dimension index index1 and the second dimension index index2 both represent the node number, the third dimension index index3 represents the voltage level, and the fourth dimension index contains three index values, which are the maximum volume ratio, height and width corresponding to the bridge section; the value of each element in the maximum volume ratio matrix V represents the maximum volume ratio of the bridge section when the fourth dimension index is the maximum volume ratio, represents the height of the bridge section when the fourth dimension index is high, and represents the width of the bridge section when the fourth dimension index is width.

[0016] Furthermore, the feasible bridge network adjacency matrix A corresponding to each cable is selected from the bridge network adjacency matrix A c The process includes the following steps:

[0017] S401: Based on the cable information of the cable, determine the third dimension index index3 of the cable corresponding to the bridge network adjacency matrix A according to the voltage level therein;

[0018] S402: Calculate the floor area ratio judgment result matrix T according to the following formulas V , Laying method judgment result matrix T L And the maximum number of roots to be accommodated judgment result matrix T M :

[0019]

[0020] T L ={L[:,:,index3]==l j}

[0021] T M ={M[:,:,index3]≥R c [:,:,index3,1]+1}

[0022] Among them, Π represents bitwise multiplication; V[:,:,index3,α] represents the matrix with the third dimension index as index3 and the fourth dimension index as α in the maximum volume ratio matrix V; ≥ represents bitwise determination of whether it is greater than or equal to; == represents bitwise determination of whether it is equal to; R c R represents a record matrix with a dimension of N×N×count_v×2. Its first dimension index index1 and second dimension index index2 both represent node numbers, and the third dimension index index3 represents voltage level. c [:,:,index3,0] represents the record matrix R c The matrix with the third dimension index as index3 and the fourth dimension index as 0, R c The value of each element in [:,:,index3,0] represents the threshold value for judging the floor area ratio;c [:,:,index3,1] represents the record matrix R c The matrix with the third dimension index as index3 and the fourth dimension index as 1, R c The value of each element in [:,:,index3,1] represents the maximum root number judgment threshold; d j represents the diameter of the jth cable; L[:,:,index3] represents the matrix with the third dimension index index3 in the laying mode matrix L; l j Indicates the laying method of the jth cable; M[:,:,index3] indicates the matrix with the third dimension index index3 in the maximum cable accommodating matrix M;

[0023] S403: Calculate the floor area ratio judgment result matrix T V , Laying method judgment result matrix T L And the maximum number of roots to be accommodated judgment result matrix T M After the result matrix T of the bitwise AND of these three matrices is obtained, the feasible bridge network adjacency matrix A is calculated by the following formula c :

[0024] A c =A[T,index3]

[0025] Among them, A[T] means that in the matrix with the third dimension index index3 in the bridge network adjacency matrix A, only the values ​​of the elements corresponding to the indexes with the value of 1 in the result matrix T are retained, and the values ​​of the elements corresponding to other indexes are changed to ∞.

[0026] Furthermore, record the matrix R c The values ​​of each element in are initially filled with 0, and then updated according to the cable laying order. The update method is:

[0027] The matrix R used when laying the jth cable c The sum of the values ​​of each element in [:,:,index3,0] and the square of the diameter of the jth cable is used as the matrix R for laying the j+1th cable. c The value of the corresponding element in [:,:,index3,0];

[0028] The matrix R used when laying the jth cable c The sum of the values ​​of each element in [:,:,index3,1] and 1 is used as the matrix R for laying the j+1th cable c The value of the corresponding element in [:,:,index3,1].

[0029] Furthermore, the priority of each cable is configured in such a way that the larger the cable, the higher the priority.

[0030] Furthermore, the shortest path algorithm adopts Dijkstra algorithm.

[0031] A cable automatic laying terminal device comprises a processor, a memory and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps of the method described above in the embodiment of the present invention are implemented.

[0032] A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method described above in an embodiment of the present invention are implemented.

[0033] The present invention adopts the above technical solution to provide an intelligent and efficient automatic cable laying solution. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 Shown is a flow chart of a method according to a first embodiment of the present invention. DETAILED DESCRIPTION

[0035] To further illustrate various embodiments, the present invention provides drawings. These drawings are part of the disclosure of the present invention, which are mainly used to illustrate the embodiments and can be used in conjunction with the relevant descriptions in the specification to explain the operating principles of the embodiments. With reference to these contents, ordinary technicians in this field should be able to understand other possible implementations and advantages of the present invention.

[0036] The present invention will now be further described with reference to the accompanying drawings and specific implementation methods.

[0037] Embodiment 1:

[0038] The embodiment of the present invention provides a method for automatically laying cables. Figure 1 As shown, the method comprises the following steps:

[0039] S1: Obtain the bridge information of each bridge corresponding to the cables to be laid.

[0040] In this embodiment, the bridge information of each bridge (i.e. each bridge section) is represented by an array r, i.e., the bridge information r of the i-th bridge section is: i =[id i ,size i (h i ,w i ),volume i ,s_p i (x i1 ,y i1 ,z i1 ),e_p i (x i2 ,y i2 ,zi2 ),length i ,voltage i ,method i ,maxnumber i ], where i∈[1,m2] represents the i-th bridge, m2 represents the total number of bridges; id represents the bridge identification name, which is identified by a globally unique string; size i (h i ,w i ) represents the cross section of the bridge, h, w∈(0,∞) represents the height and width of the cross section of the bridge; volume∈(0,1) represents the maximum volume ratio of the bridge, s_p i (x i1 ,y i1 ,z i1 ) and e_p i (x i2 ,y i2 ,z i2 ) respectively represent the coordinates of the starting point and the end point of the bridge, x, y, z∈(-∞,∞); length∈(0,∞) represents the length of the bridge, voltage∈[0,count_v-1] represents the voltage level corresponding to the bridge, which can only be an integer, count_v represents the total number of voltage level types included in the power design system; method∈{single-layer laying, multi-layer laying} represents the laying method of the bridge; maxnumber∈(0,∞) represents the maximum number of cables that the bridge can accommodate.

[0041] S2: Based on the bridge information of all bridges, construct the bridge network adjacency matrix A, the maximum volume ratio matrix V, the laying method matrix L and the maximum cable capacity matrix M.

[0042] In this embodiment, the above four matrices are constructed by the following steps:

[0043] S201: Initialize the voltage level type counter count_v to be equal to the number of voltage types, initialize the index count n=0, A, L and M are empty matrices of order n×n×count_v, V is an empty matrix of order n×n×count_v×3, initialize the coordinate index dictionary CIM to be empty, initialize the index coordinate dictionary ICM to be empty, initialize the first dimension index index1, the second dimension index index2 and the third dimension index index3 to be 0.

[0044] S202: traverse the information of each bridge frame in turn i .

[0045] S203: Judgment Is it true? If so, set {s_p i(x i1 ,y i1 ,z i1 ):n} into CIM, and {n:s_p i (x i1 ,y i1 ,z i1 )} is stored in ICM; at the same time, Is it true? If so, set {e_p i (x i2 ,y i2 ,z i2 ):n} into CIM, and {n:e_p i (x i2 ,y i2 ,z i2 )} deposited into ICM. s_p i (x i1 ,y i1 ,z i1 ):n represents a key-value pair, s_p i (x i1 ,y i1 ,z i1 ) is the key, n is the value; n:e_p i (x i2 ,y i2 ,z i2 ) also represents a key-value pair, n is the key, s_p i (x i1 ,y i1 ,z i1 ) as the value.

[0046] S204: Let n be incremented by 1 to obtain matrices A, V, L, and M with increasing order. All newly added elements in A are assigned a value of ∞, except for the diagonal elements, which are assigned a value of 0. All newly added elements in V, L, and M are assigned a null value of null.

[0047] S205: Acquisition index2 = CIM[e_p i (x i2 ,y i2 ,z i2 )],

[0048] index3=voltage i , update matrices A, V, L and M according to the following formula;

[0049]

[0050] S206: Steps S202 to S205 are continuously repeated until i=m2, that is, all bridge information is traversed, and the matrices A, V, L and M at this time are output.

[0051] The dimensions of the bridge network adjacency matrix A, laying mode matrix L and maximum cable capacity matrix M finally obtained through the above steps are N×N×count_v, and the dimension of the maximum volume ratio matrix V is N×N×count_v×3, where N represents the total number of nodes contained in the bridge network.

[0052] S3: Obtain cable information of each cable to be laid.

[0053] In this embodiment, the cable information of each cable is represented by an array c, that is, the cable information c of the jth cable is j ={d j ,l j ,v j ,s j (x j1 ,y j1 ,z j1 ),e j (x j2 ,y j2 ,z j2 )}, where j∈[1,m1], m1 represents the total number of cables to be laid. d∈(0,∞) represents the cable diameter. l∈{single-layer laying, multi-layer laying} represents the cable laying method. v∈[0,count_v-1] represents the voltage level, which can only be an integer. s j (x j1 ,y j1 ,z jj ) and e j (x j2 ,y j2 ,z j2 ) represent the coordinates of the starting point and the end point of the cable, x, y, z∈(-∞,∞).

[0054] S4: Based on the priorities of the configured cables, in descending order of priority, combined with the cable information of each cable and the maximum volume ratio matrix V, the laying mode matrix L and the maximum cable holding number matrix M, the feasible bridge network adjacency matrix A corresponding to each cable is selected from the bridge network adjacency matrix A. c , and then solve the laying paths of all cables to be laid through the shortest path algorithm.

[0055] Due to the limitations of cable trays such as volume ratio and maximum number of cables, each section of the tray cannot accommodate unlimited cables. The cables laid first may occupy the space of the tray, which may force the cables laid later to take a long detour, making it impossible to lay them according to the theoretical shortest path. Therefore, in this embodiment, the priority of each cable is pre-configured, and the cables are laid in order from high to low priority.

[0056] In this embodiment, the cable laying priority array is defined as: Where p1 represents the first priority, that is, the cable number corresponding to the first cable to be laid, and the subscript m1 represents the total number of cables to be laid. The cable laying priority array P can be manually specified or the default value can be used, which is not limited here. When the default value is used, considering that the cable diameter has a greater impact on the price per unit length of the cable, the default value is set in this embodiment in such a way that the larger the cable diameter, the higher the priority. This can avoid the situation where the higher-cost cables are forced to take a detour due to the lower priority, thereby saving the cable procurement cost.

[0057] In this embodiment, the feasible bridge network adjacency matrix A corresponding to each cable is selected from the bridge network adjacency matrix A. c The process includes the following steps:

[0058] S401: The information of the jth cable to be laid is recorded as c j ={d j ,l j ,v j ,s j (x j1 ,y j1 ,z j1 ),e j (x j2 ,y j2 ,z j2 )}, where j∈[1,m1]. d∈(0,∞) represents the cable diameter. l∈{single-layer laying,multi-layer laying} represents the cable laying method. v∈[0,count_v-1] represents the voltage level index, which can only be an integer. s j (x j1 ,y j1 ,z j1 ) and e j (x j2 ,y j2 ,z j2 ) represent the coordinates of the starting point and the end point of the cable, x, y, z∈(-∞,∞). Initialize the record matrix R of the bridge c The order is n×n×count_v×2, and the filling values ​​are all 0.

[0059] S402: Based on the current cable information to be laid c j , get the first dimension index index1 corresponding to its starting point coordinates = CIM[s(x j1 ,y j1 ,z j1 )], the second dimension index corresponding to the end point coordinate index2 = CIM[e(x j2 ,y j2 ,z j2)] and the third dimension index index3 corresponding to the voltage level.

[0060] Calculate the floor area ratio judgment result matrix T according to the following V , Laying method judgment result matrix T L And the maximum number of roots to be accommodated judgment result matrix T M :

[0061]

[0062] T L ={L[:,:,index3]==l j}

[0063] T M ={M[:,:,index3]≥R c [:,:,index3,1]+1}

[0064] Among them, Π represents bitwise multiplication; V[:,:,index3,α] represents the matrix with the third dimension index as index3 and the fourth dimension index as α in the maximum volume ratio matrix V; ≥ represents bitwise determination of whether it is greater than or equal to; == represents bitwise determination of whether it is equal to; R c [:,:,index3,0] represents the record matrix R c The matrix with the third dimension index as index3 and the fourth dimension index as 0, R c The value of each element in [:,:,index3,0] represents the threshold value for judging the floor area ratio; c [:,:,index3,1] represents the record matrix R c The matrix with the third dimension index as index3 and the fourth dimension index as 1, R c The value of each element in [:,:,index3,1] represents the maximum root number judgment threshold; d j represents the diameter of the jth cable; L[:,:,index3] represents the matrix with the third dimension index index3 in the laying mode matrix L; l j Indicates the laying method of the j-th cable; M[:,:,index3] represents the matrix with the third dimension index index3 in the maximum cable accommodating matrix M.

[0065] The final T V 、T L and T M Both are Boolean matrices filled with True or False, with a size of N×N.

[0066] S403: Calculate the floor area ratio judgment result matrix T V , Laying method judgment result matrix TL And the maximum number of roots to be accommodated judgment result matrix T M After the result matrix T of the bitwise AND of these three matrices is obtained, the feasible bridge network adjacency matrix A is calculated by the following formula c :

[0067] A c =A[T,index3]

[0068] T=T V &&T L &&T M

[0069] Among them, A[T] means that in the matrix with the third dimension index index3 in the bridge network adjacency matrix A, only the values ​​of the elements corresponding to the indexes with the value of 1 in the result matrix T are retained, and the values ​​of the elements corresponding to other indexes are changed to ∞.

[0070] The shortest path algorithm used in this embodiment is the Dijkstra algorithm, and the specific implementation process includes the following steps:

[0071] Step 1: Initialize the record matrix B as an empty matrix of order n×n, assign True to all positions except the diagonal and False to all other positions; initialize the path matrix P as an n×n matrix with all values ​​-1.

[0072] Step 2: Use Dijkstra algorithm to find the adjacency matrix A of the feasible bridge network c Find the shortest path of the current cable to be laid. The specific process is as follows:

[0073] Step 2.1: If B[index1,index2] is equal to True, then exit the loop and execute step 2.5;

[0074] Step 2.2: Traverse A c [index1][1-B[index1]], take the column index corresponding to the smallest value and record it as cur, and assign True to M[index1,cur];

[0075] Step 2.3: Traverse the True position in [1-B[index1]] and record its index as ad_node i If A c [index1,ad_node i ] satisfies the following formula, then A c [index1,ad_node i ] is assigned to A c [index1,cur]+A c [cur,ad_node i], P[index1,ad_node i ]Assign the value to cur;

[0076] A c [index1,ad_node i ]>A c [index1,cur]+A c [cur,ad_node i ]

[0077] Step 2.4: Continuously loop steps 2.1 to 2.3 until the corresponding condition of step 2.1 is met, and then exit the loop;

[0078] Step 2.5: If A c If [index1, index2] is equal to ∞, it means that there is no path between the starting device and the end device of the cable to be laid. Otherwise, the corresponding shortest path length is A. c [index1,index2].

[0079] Step 3: If A c If [index1, index2] is not equal to ∞, the bridge routes it passes through can be obtained through the path matrix P, and the bridge record matrix R can be updated. c The specific process is as follows:

[0080] Step 3.1: Initialize the path node list path = [index1], initialize the path index index4 = index2;

[0081] Step 3.2: If P[index1,index4] is not equal to -1, insert index4 after index1 of path and assign index4 to P[index1,index4]. Then repeat step 6.2). Otherwise, exit the loop and execute step 3.3;

[0082] Step 3.3: The nodes recorded in the path are connected from beginning to end to form the current cable laying path. The i-th node in the path is node i From the first node to the second to last node, R can be updated according to the following formula c :

[0083] R c [node i ,node i+1 ,index3,0]=R c [node i ,node i+1 ,index3,0]+dj 2

[0084] R c [node i ,node i+1 ,index3,1]=R c [node i ,node i+1 ,index3,1]+1

[0085] Step 4: Repeat steps 1 to 3 until all cables to be laid are completed.

[0086] As more and more cables are laid, the status of the bridge network is constantly changing and updating. When the current cable to be laid is looking for the shortest circuit on the existing bridge network, it is necessary not only to consider the voltage level matching and the laying method matching, but also to consider that the maximum volume ratio and the maximum number of roots that can be accommodated after the laying is completed cannot be exceeded. How to efficiently record and update this information, and efficiently obtain the feasible bridge network of the current cable through this information is crucial to the overall operating efficiency of the automatic cable laying method. Compared with the previous storage of all attribute information of the bridge network through lists and dictionaries, the feasible bridge network adjacency matrix of the current cable to be laid can only be obtained through continuous loop iteration and combination of various logical judgments. This embodiment first defines the adjacency matrix, maximum volume ratio matrix, laying method matrix, maximum cable holding number matrix and record matrix of the bridge network, and records all attribute information of the bridge network in the form of a matrix; then, in the actual laying process, the feasible bridge network adjacency matrix of the current cable to be laid is directly and efficiently obtained through matrix operations, and the calculation efficiency is greatly improved. In particular, as the scale of the power system expands, the number of bridge nodes will increase proportionally, and the efficiency gap between ordinary iterative loops and matrix operations will become more and more obvious. In addition, mainstream programming languages ​​such as C, C++, and Python have dedicated toolkits specifically for matrix operations, and have accelerated the underlying compilation process to further improve their computing efficiency.

[0087] After obtaining the feasible bridge network adjacency matrix of the current cable to be laid, the shortest laying path can be obtained by using the existing mature shortest path algorithm. The Dijkstra algorithm used in the present invention is a classic shortest path algorithm that can obtain the theoretical shortest path between two nodes. Other commonly used shortest path algorithms, such as the A* algorithm, the ant colony algorithm, and the SPFA algorithm, have different focuses and advantages and disadvantages, but they can all be directly used on the feasible bridge network adjacency matrix obtained by the present invention, and are not limited here.

[0088] Embodiment 2:

[0089] The present invention also provides a cable automatic laying terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps in the above method embodiment of the first embodiment of the present invention are implemented.

[0090] Further, as an executable solution, the automatic cable laying terminal device can be a computing device such as a desktop computer, a notebook, a PDA, and a cloud server. The automatic cable laying terminal device may include, but is not limited to, a processor and a memory. Those skilled in the art can understand that the composition structure of the automatic cable laying terminal device is only an example of the automatic cable laying terminal device, and does not constitute a limitation on the automatic cable laying terminal device. It may include more or less components than the above, or a combination of certain components, or different components. For example, the automatic cable laying terminal device may also include input and output devices, network access devices, buses, etc., and the embodiments of the present invention do not limit this.

[0091] Further, as an executable solution, the processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the automatic cable laying terminal device, and uses various interfaces and lines to connect various parts of the entire automatic cable laying terminal device.

[0092] The memory can be used to store the computer program and / or module, and the processor realizes various functions of the automatic cable laying terminal device by running or executing the computer program and / or module stored in the memory, and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system and at least one application required for a function; the data storage area can store data created according to the use of the mobile phone, etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0093] The present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the above method in the embodiment of the present invention are implemented.

[0094] If the module / unit integrated in the automatic cable laying terminal equipment is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory) and software distribution medium, etc.

[0095] Although the present invention has been specifically shown and described in conjunction with the preferred embodiments, it should be understood by those skilled in the art that various changes may be made to the present invention in form and details without departing from the spirit and scope of the present invention as defined by the appended claims, all of which are within the scope of protection of the present invention.

Claims

1. A method for automatic cable laying, characterized in that: The following steps are involved: S1: Obtaining bridge information of each bridge corresponding to the cables to be laid; S2: construct the bridge network adjacency matrix A, the maximum volume ratio matrix V, the laying mode matrix L and the maximum cable capacity matrix M based on the bridge information of all bridges; S3: Obtaining cable information of each cable in the cables to be laid; S4: Based on the priorities of the configured cables, in descending order of priority, combined with the cable information of each cable and the maximum volume ratio matrix V, the laying mode matrix L and the maximum cable holding number matrix M, the feasible bridge network adjacency matrix A corresponding to each cable is selected from the bridge network adjacency matrix A. c , and then solve the laying paths of all cables to be laid through the shortest path algorithm.

2. The automatic cable laying method according to claim 1, characterized in that: The bridge information includes: the height and width of the bridge section, the starting and ending coordinates of the bridge, the maximum volume ratio of the bridge, the length of the bridge, the voltage level corresponding to the bridge, the laying method of the bridge and the maximum number of cables that the bridge can accommodate.

3. The automatic cable laying method according to claim 1, characterized in that: The dimensions of the bridge network adjacency matrix A, the laying mode matrix L and the maximum cable holding number matrix M are all N×N×count_v, where N represents the total number of nodes contained in the bridge network, count_v represents the total number of voltage levels, the first dimension index index1 and the second dimension index index2 both represent the node number, and the third dimension index index3 represents the voltage level; the value of each element in the bridge network adjacency matrix A represents the bridge length between two nodes; The laying mode matrix L represents the laying mode of the bridge between two nodes; the maximum cable capacity matrix M represents the maximum cable capacity of the bridge between two nodes; The dimension of the maximum volume ratio matrix V is N×N×count_v×3, the first dimension index index1 and the second dimension index index2 both represent the node number, the third dimension index index3 represents the voltage level, and the fourth dimension index contains three index values, which are the maximum volume ratio, height and width corresponding to the bridge section; the value of each element in the maximum volume ratio matrix V represents the maximum volume ratio of the bridge section when the fourth dimension index is the maximum volume ratio, represents the height of the bridge section when the fourth dimension index is high, and represents the width of the bridge section when the fourth dimension index is width.

4. The automatic cable laying method according to claim 3, characterized in that: Select the feasible bridge network adjacency matrix A corresponding to each cable from the bridge network adjacency matrix A c The process includes the following steps: S401: Based on the cable information of the cable, determine the third dimension index index3 of the cable corresponding to the bridge network adjacency matrix A according to the voltage level therein; S402: Calculate the floor area ratio judgment result matrix T according to the following formulas V , Laying method judgment result matrix T L And the maximum number of roots to be accommodated judgment result matrix T M : T L {L[:,:,index3]:l j } T M ={M[:,:,index3]≥R c [:,:,index3,1]+1} Wherein, Π represents bitwise multiplication; V[:,:,index3,α] represents the matrix with the third dimension index as index3 and the fourth dimension index as α in the maximum volume ratio matrix V; ≥ represents bitwise determination of whether it is greater than or equal to; == represents bitwise determination of whether it is equal to; R c R represents a record matrix with a dimension of N×N×count_v×2. Its first dimension index index1 and second dimension index index2 both represent node numbers, and the third dimension index index3 represents voltage level. c [:,:,index3,0] represents the matrix with the third dimension index as index3 and the fourth dimension index as 0 in the record matrix Rc. c The value of each element in [:,:,index3,0] represents the threshold value for judging the floor area ratio; R c [:,:,index3,1] represents the record matrix R c The matrix with the third dimension index as index3 and the fourth dimension index as 1, R c The value of each element in [:,:,index3,1] represents the maximum accommodating root number judgment threshold; d j represents the diameter of the jth cable; L[:,:,index3] represents the matrix with the third dimension index index3 in the laying mode matrix L; l j represents the laying method of the jth cable; M[:,:,index3] represents the matrix with the third dimension index index3 in the maximum cable accommodating matrix M; S403: Calculate the floor area ratio judgment result matrix T V , Laying method judgment result matrix T L And the maximum number of roots to be accommodated judgment result matrix T M After the result matrix T of the bitwise AND of these three matrices is obtained, the feasible bridge network adjacency matrix A is calculated by the following formula c : A c =A[T,index3] Among them, A[T] means that in the matrix with the third dimension index index3 in the bridge network adjacency matrix A, only the values ​​of the elements corresponding to the indexes with the value of 1 in the result matrix T are retained, and the values ​​of the elements corresponding to other indexes are changed to ∞.

5. The automatic cable laying method according to claim 4, characterized in that: Record matrix R c The values ​​of each element in are initially filled with 0, and then updated according to the cable laying order. The update method is: The matrix R used when laying the jth cable c [:, The sum of the values ​​of each element in [index3,0] and the square of the diameter of the jth cable is used as the matrix R for laying the j+1th cable. c The value of the corresponding element in [:,:,index3,0]; The matrix R used when laying the jth cable c The sum of the values ​​of each element in [:,:,index3,1] and 1 is used as the matrix R used when laying the j+1th cable c The value of the corresponding element in [:,:,index3,1].

6. The automatic cable laying method according to claim 1, characterized in that: The priority of each cable is configured in such a way that the larger the cable, the higher the priority.

7. The automatic cable laying method according to claim 1, characterized in that: The shortest path algorithm uses Dijkstra algorithm.

8. A cable automatic laying terminal device, characterized in that: The method comprises a processor, a memory and a computer program stored in the memory and running on the processor, wherein the processor implements the steps of the method according to any one of claims 1 to 7 when executing the computer program.

9. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images