CN112332306A - Automatic cable laying method and storage medium - Google Patents
Automatic cable laying method and storage medium Download PDFInfo
- Publication number
- CN112332306A CN112332306A CN202011041265.8A CN202011041265A CN112332306A CN 112332306 A CN112332306 A CN 112332306A CN 202011041265 A CN202011041265 A CN 202011041265A CN 112332306 A CN112332306 A CN 112332306A
- Authority
- CN
- China
- Prior art keywords
- cable
- list
- point
- vertex
- cable bridge
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02G—INSTALLATION OF ELECTRIC CABLES OR LINES, OR OF COMBINED OPTICAL AND ELECTRIC CABLES OR LINES
- H02G1/00—Methods or apparatus specially adapted for installing, maintaining, repairing or dismantling electric cables or lines
- H02G1/06—Methods or apparatus specially adapted for installing, maintaining, repairing or dismantling electric cables or lines for laying cables, e.g. laying apparatus on vehicle
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the field of cable laying, and particularly relates to an automatic cable laying method and a storage medium, which comprise the following steps: compiling an original cable list; drawing an electrical plane layout diagram; forming a cable tray layout; generating a cable bridge network adjacency list according to the cable bridge layout diagram; calculating the shortest path between the vertexes; sequentially reading the next cable in the original cable list; calculating a laying path of the cable; and judging whether all the cables have already found laying paths. According to the technical scheme, the bridge information can be automatically extracted through the cable bridge layout drawing so as to finish automatic laying of the cable.
Description
Technical Field
The invention belongs to the field of cable laying, and particularly relates to an automatic cable laying method and a storage medium.
Background
Cabling is an important part of electrical design in electrical power engineering. The modern power station project cables are numerous, and if the cables are laid manually and the cables are compiled into a list, the work is very complicated. If computer aided design is adopted in the design process, cable path selection, length statistics and cable inventory formation are automatically completed, so that designers can be free from complicated and repeated work, and concentrate on processing other technical problems.
Most of the currently developed cable laying auxiliary design software is developed based on a database, cable bridge information needs to be manually input, extra workload is added, and the workload is quite large. How to adopt an automatic extraction mode to finish automatic cable laying is a main research direction of cable laying work.
Disclosure of Invention
The application provides an automatic cable laying method and a storage medium, which can automatically extract bridge information through a cable bridge layout diagram so as to finish automatic cable laying.
In order to achieve the technical purpose, the technical scheme adopted by the application is that the automatic cable laying method comprises the following steps:
compiling an original cable list, wherein the original cable list comprises a cable number, a cable starting equipment number, a cable terminating equipment number and a cable specification model;
drawing an electrical plane layout diagram: adding electrical equipment on the existing process layout, and marking the number of the electrical equipment and the number of the electrical equipment to form an electrical plane layout;
drawing cable bridges on the electrical plane layout drawing according to the positions and the number of the electrical equipment and the electrical equipment, and forming a cable bridge layout drawing, wherein primitives representing the cable bridges in the cable bridge layout drawing correspond to specific cable bridges one by one;
generating a cable bridge network adjacency list according to a cable bridge layout diagram, wherein the cable bridge network adjacency list is generated by simulating a network G according to a whole cable bridge channel, the intersection point and the end point of a cable bridge are used as a vertex V of the network, and the edges E and G of the cable bridge diagram are (V and E);
calculating shortest paths among the vertexes, designating cluster points, and calling an algorithm by using the designated cluster points as source points to calculate the shortest paths from all other vertexes to the cluster points;
sequentially reading the next cable in the original cable inventory, searching the positions of the starting equipment and the ending equipment of the cable on a cable bridge layout diagram, and solving the corresponding overhead point;
the shortest path from the top point of the cable bridge corresponding to the cable starting equipment to the top point of the cable bridge corresponding to the cable terminal equipment is obtained, and the shortest path is the laying path of the cable; the cable starting equipment is electrical equipment or electric equipment; the cable terminal equipment is electrical equipment or electric equipment;
judging whether all cables have solved laying paths or not, if so, ending the process; if not, jumping to the next cable which is read from the original cable list in sequence.
As an improved technical scheme of the application, the compiling of the original cable inventory comprises the steps of obtaining cable information according to a power distribution system diagram, and writing the cable information into an Excel file from AutoCAD through an ADO interface.
As an improved technical solution of the present application, the forming of the electrical floor plan includes: the electrical equipment number is attached to a primitive representing the equipment in the form of extension data xdata, and the electrical equipment number is attached to the primitive representing the equipment in the form of extension data xdata.
As an improved technical solution of the present application, the cable bridge network adjacency list is generated by adopting the following steps:
constructing a cable bridge network G, wherein G is (V, E), and V is the top point of the network, namely the intersection point (bend, tee, cross and the like) and the end point of the cable bridge; the cable tray is edge E of FIG. G; the length of each cable bridge is the weight w of the corresponding edge; if no cable bridge frame is directly connected between the two vertexes, the weight is + ∞;
a plurality of vertexes vi exist in the network G, all vertexes adjacent to the vertexes vi are linked into a single linked list with a head node, and the single linked list is an adjacent list of the vertexes vi;
each node in the singly linked list contains three fields: the adjoining point field indicates coordinates of a vertex adjoining the vertex vi; the weight value field indicates the distance between the vertex corresponding to the node and the vertex vi; the chain domain indicates the next node adjacent to the vertex vi, and if the next node is not present, the node is NULL;
meanwhile, each single linked list is required to be additionally provided with a table head node, a data field for storing the coordinates of the vertex vi and a head pointer field pointing to the first node in the linked list.
As an improved technical scheme of the application, the generation of the cable bridge network adjacency list according to the cable bridge layout comprises the following steps:
screening out the cable bridge primitives in the electrical plane layout diagram by using a selection set filter to form a selection set;
sequentially taking out the next cable bridge frame graphic element from the selection set, and obtaining definition data of the graphic element;
obtaining the item designated by the DXF group code 10 from the primitive definition data, i.e. the start coordinate of the cable bridge; acquiring an item specified by the DXF group code 11 from the graphic element definition data, namely the coordinates of the termination point of the cable bridge;
judging whether the initial point establishes an adjacency list or not, if not, establishing the adjacency list of the initial point by taking the initial point as a list head node, and adding a linked list node corresponding to the termination point into the initial point adjacency list; if the receiving list is established, adding a linked list node corresponding to the termination point into the initial point adjacency list;
judging whether the non-extracted primitives exist in the selection set or not, if the non-extracted primitives exist, jumping to the step of sequentially extracting the next cable bridge primitive from the selection set, and acquiring definition data of the primitive; and if no primitive is not taken out, the adjacency list of the network is formed, and the method is ended.
As an improved technical scheme of the application, all the table head nodes in the cable bridge network adjacency list are sequentially stored in one vector.
As an improved technical scheme of the application, a Dijkstra algorithm or a Floyd algorithm is selected for calculating the shortest path between the vertexes.
As an improved technical solution of the present application, calculating the shortest path between vertices includes:
all vertices in network G are divided into two groups, the first group of packetsIncluding the vertices for which the shortest path has been determined, as set S, S ═ v0}，v0Represents a source point at the beginning; the second group comprises the vertexes of which the shortest path is not determined yet and is marked as V-S;
adding the vertex in V-S to S one by one according to the increasing order of the shortest path length until the vertex is added to S from V0All vertices that can be reached by departure are included in S;
wherein, from v0The shortest path to each vertex of the first set S is not greater than v0A shortest path length to any vertex of the second set V-S;
the vertices of the second group correspond to distance values from v0The shortest path length to this vertex, including only the vertices of the first set S as intermediate vertices;
for any point j, v in S0The path lengths to j are all less than v0Path length to any point in V-S.
Advantageous effects
The method and the device adopt computer-aided design to improve the cable laying design quality and improve the design speed, are the inevitable trend of electrical design of the power engineering, and meet the accuracy, rapidity and flexibility of cable laying design engineering with higher requirements.
The method and the device realize automatic laying computer aided design of the cable based on the AutoCAD platform, overcome the defect that an aided design program based on a database needs to manually input network data of the cable bridge, and can directly automatically extract the layout drawing of the cable bridge. The concept of the bundling point is introduced when the Dijkstra algorithm is adopted to calculate the shortest path, and the calculation amount is effectively reduced.
Drawings
FIG. 1 is a flow chart of an algorithm for forming a network adjacency list for a cable tray;
FIG. 2 is a flow chart of computing shortest paths between vertices using Dijkstra's algorithm;
fig. 3 is a flow chart of an automatic cabling algorithm.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the drawings of the embodiments of the present invention. It is to be understood that the embodiments described are only a few embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the described embodiments of the invention without any inventive step, are within the scope of protection of the invention. Unless defined otherwise, technical or scientific terms used herein shall have the ordinary meaning as understood by one of ordinary skill in the art to which this invention belongs.
The capacity of a single machine of the power system is continuously increased, the automation level is continuously improved, the number of cables is continuously increased, and higher requirements are provided for the accuracy, the rapidity and the flexibility of the cable laying design project. Therefore, the adoption of computer aided design to improve the cable laying design quality and improve the design speed is an inevitable trend of electrical design of electric power engineering. The AutoCAD is a planar design tool adopted by most design institutions at present, is widely applied, has an open structure, and can be developed secondarily through ObjectARX, C #. net, Visual Lisp and other languages to improve the performance of the design tools.
The application is based on an AutoCAD platform to realize automatic laying computer aided design of cables, in particular to a method for realizing auxiliary laying design of cables, which comprises the following steps: the method comprises the steps of forming an initial cable list, positioning by electric equipment, forming a cable bridge layout diagram, automatically reading bridge information, automatically searching the starting point and the ending point of a cable according to the initial cable list, calculating the overhead point of the cable and searching the shortest path, and finally calculating the length and the laying path of the cable and forming the final cable list. The whole process can be automatically finished without manual work of inputting bridge frame information and the like, and the workload is greatly reduced. The shortest path calculation is realized by a Dijkstra algorithm and a concentration point method. In terms of electrical profession, the arrangement of cable bridges can be completed in a three-dimensional design software (PDMS, PDS and the like) environment, then the cable bridges are exported to an AutoCAD environment to form a cable bridge arrangement drawing, and the design of the rest part is completed by adopting the method introduced in the text.
In detail: an automatic cable laying method comprises the following steps:
the method comprises the following steps of firstly, compiling an original cable list, wherein the original cable list comprises a cable number, a cable starting equipment number, a cable terminating equipment number and a cable specification model; the compiling of the original cable inventory comprises the steps of obtaining cable information according to a power distribution system diagram, and writing the cable information into an Excel file from AutoCAD through an ADO interface.
Step two, drawing an electrical plane layout diagram: adding electrical equipment on the existing process layout, and marking the number of the electrical equipment and the number of the electrical equipment to form an electrical plane layout; the forming an electrical floor plan comprises: the electrical equipment number is attached to a primitive representing the equipment in the form of extension data xdata, and the electrical equipment number is attached to the primitive representing the equipment in the form of extension data xdata.
And thirdly, drawing cable bridges on the electrical plane layout according to the positions and the number of the electrical equipment and the electrical equipment, and forming a cable bridge layout, wherein the graphic elements representing the cable bridges in the cable bridge layout correspond to the specific cable bridges one by one.
Fourthly, generating a cable bridge network adjacency list according to a cable bridge layout diagram, wherein the cable bridge network adjacency list is generated by simulating a network G according to the whole cable bridge channel, the intersection point and the end point of the cable bridge are used as the vertex V of the network, and the edges E and G of the cable bridge diagram are (V and E); the length of each section of cable bridge in the network of cable bridges is the weight w of the corresponding edge; if no cable bridge frame is directly connected between the two vertexes, the weight is + ∞; the cable bridge network adjacency list is generated by adopting the following steps: constructing a cable bridge network G, wherein G is (V, E), and V is the top point of the network, namely the intersection point (bend, tee, cross and the like) and the end point of the cable bridge; the cable tray is edge E of FIG. G; the length of each cable bridge is the weight w of the corresponding edge; if no cable bridge frame is directly connected between the two vertexes, the weight is + ∞; a plurality of vertexes vi exist in the network G, all vertexes adjacent to the vertexes vi are linked into a single linked list with a head node, and the single linked list is an adjacent list of the vertexes vi; each node in the singly linked list contains three fields: the adjoining point field indicates coordinates of a vertex adjoining the vertex vi; the weight value field indicates the distance between the vertex corresponding to the node and the vertex vi; the chain domain indicates the next node adjacent to the vertex vi, and if the next node is not present, the node is NULL; meanwhile, each single linked list is required to be additionally provided with a table head node, a data field for storing the coordinates of the vertex vi and a head pointer field pointing to the first node in the linked list.
Or expressed as follows by adopting an algorithm: generating a cable tray network adjacency list according to a cable tray layout comprises: screening out the cable bridge primitives in the electrical plane layout diagram by using a selection set filter to form a selection set; sequentially taking out the next cable bridge frame graphic element from the selection set, and obtaining definition data of the graphic element; obtaining the item designated by the DXF group code 10 from the primitive definition data, i.e. the start coordinate of the cable bridge; acquiring an item specified by the DXF group code 11 from the graphic element definition data, namely the coordinates of the termination point of the cable bridge; judging whether the initial point establishes an adjacency list or not, if not, establishing the adjacency list of the initial point by taking the initial point as a list head node, and adding a linked list node corresponding to the termination point into the initial point adjacency list; if the receiving list is established, adding a linked list node corresponding to the termination point into the initial point adjacency list; judging whether the non-extracted primitives exist in the selection set or not, if the non-extracted primitives exist, jumping to the step of sequentially extracting the next cable bridge primitive from the selection set, and acquiring definition data of the primitive; and if no primitive is not taken out, the adjacency list of the network is formed, and the method is ended.
All the head nodes in the cable bridge network adjacency list are sequentially stored in a vector.
Fifthly, calculating shortest paths among the vertexes, designating cluster points, and calling an algorithm by taking the designated cluster points as source points to calculate the shortest paths from all other vertexes to the cluster points; the calculation of the shortest path between the vertexes selects Dijkstra algorithm or Floyd algorithm. The method for calculating the shortest path between the vertexes by adopting the Dijkstra algorithm comprises the following steps:
all vertices in the network G are divided into two groups, the first group including vertices for which the shortest path has been determined, denoted as set S, S ═ v0}，v0Represents a source point at the beginning;the second group comprises the vertexes of which the shortest path is not determined yet and is marked as V-S;
adding the vertex in V-S to S one by one according to the increasing order of the shortest path length until the vertex is added to S from V0All vertices that can be reached by departure are included in S;
wherein, from v0The shortest path to each vertex of the first set S is not greater than v0A shortest path length to any vertex of the second set V-S;
the vertices of the second group correspond to distance values from v0The shortest path length to this vertex, including only the vertices of the first set S as intermediate vertices;
for any point j, v in S0The path lengths to j are all less than v0Path length to any point in V-S.
And sixthly, sequentially reading the next cable in the original cable inventory, searching the positions of the starting equipment and the ending equipment of the cable on the cable bridge layout diagram, and solving the corresponding overhead point.
Seventhly, solving the shortest path from the top point of the cable bridge corresponding to the cable starting equipment to the top point of the cable bridge corresponding to the cable terminal equipment, namely the laying path of the cable; the cable starting equipment is electrical equipment or electric equipment; the cable terminal equipment is electrical equipment or electric equipment;
eighthly, judging whether all cables have already solved the laying path, if yes, ending; if not, jumping to the next cable which is read from the original cable list in sequence.
The practical application process comprises the following steps:
preparation work
The preparation work comprises compiling an original cable list, numbering equipment, drawing a cable bridge layout drawing and the like.
The contents of the original cable list comprise a cable number, a cable starting device number, a cable ending device number, a cable specification model and the like. According to the conditions provided by professions such as technology, the distribution system diagram is generally compiled in the initial design stage, and the content of the distribution system diagram comprises cable information required by the compilation of an original cable list. According to the format of the power distribution system diagram, the programming can automatically extract the information of all the cables from the power distribution system diagram, and the information is written into an Excel file from AutoCAD through an ADO interface, so that an original cable list is formed.
The equipment related to the cable laying includes electric equipment, and the like. The position and number of the electric equipment are determined by the electric profession, and the position and number of the electric equipment are provided by the profession such as the technology. And adding electrical equipment on the process layout, and marking the numbers of the electrical equipment and the electrical equipment to form an electrical plane layout. The method comprises the steps of marking a device number (including the number of an electrical device and the number of an electric device) on an electrical plane layout drawing, and simultaneously attaching number information to a primitive representing the device in the form of extension data xdata, so that the position of the device can be automatically found on the layout drawing according to the device number and by combining a selection set filter.
And drawing the cable bridge on the electrical plane layout according to the positions and the number of the electrical equipment and the electrical equipment. At the moment, only the path of the cable bridge is planned without determining the specification and the model of the cable bridge, and the specification and the model of each section of the cable bridge are determined according to the section summary of each section of the cable bridge after the cables are laid automatically. It should be noted that the primitives representing the cable tray in the electrical floor plan should correspond to specific cable trays one by one, that is, one section of tray is represented by one primitive, and a case that one primitive represents multiple sections of trays cannot occur.
2 shortest path computation
2.1 storage Structure of Cable bridge network
The whole cable bridge channel can be regarded as a network G ═ V, E, the intersection point (bend, tee, cross, etc.) and end point of the bridge are the vertex V of the network, the cable bridge is the side E of the graph G, and the length of each section of cable bridge is the weight w of the corresponding side. If there is no cable bridge directly connecting between two vertices, the weight is + ∞.
According to the characteristics of the network formed by the cable bridge, the number of edges is much smaller than the square of the number of vertices, and the storage structure of the network is suitable for adopting an adjacency representation method. For each vertex vi in the network G, the method links all vertices adjacent to vi into a single linked list with a head node, which is called an adjacency list of the vertex vi. Each node in the singly linked list contains three fields, one is an adjacency point field (adjvex) which indicates the coordinates of the vertex adjacent to the vertex vi, the second is a weight field (wdata) which indicates the distance between the vertex corresponding to the node and the vertex vi, and the last is a chain field (next) which indicates the next node adjacent to the vertex vi and is NULL if there is no next node. Each linked list is required to be additionally provided with a head node, a data field (vertex) for storing the coordinates of the vertex vi and a head pointer field (first) pointing to the first node in the linked list. The structure of the head node and the link node may be represented as:
meter head node
| vertex | firstedge |
Link list nodes
| adjvex | wdata | next |
In order to facilitate random access to the adjacency list of any vertex, all the table head nodes can be sequentially stored in a vector to form the adjacency list storage of the network.
The forming of the adjacency list of the cable bridge network without manual intervention is the key to calculating the shortest path, and the algorithm is shown in fig. 1:
screening bridge primitives in the electrical plane layout drawing by using a selection set filter according to conditions such as the drawing layer and the like to form a selection set;
sequentially taking out a next bridge frame primitive from the selection set, and obtaining definition data of the primitive;
acquiring items appointed by DXF group codes 10 and 11 from the graphic element definition data, namely coordinates of a starting point and an ending point of the cable bridge; judging whether the initial point establishes an adjacency list or not, if not, establishing the adjacency list of the initial point by taking the initial point as a list head node, and adding a linked list node corresponding to the termination point into the initial point adjacency list; if the receiving list is established, adding a linked list node corresponding to the termination point into the initial point adjacency list;
judging whether the non-extracted primitives exist in the selection set or not, if the non-extracted primitives exist, jumping to the step of sequentially extracting the next cable bridge primitive from the selection set, and acquiring definition data of the primitive; and if no primitive is not taken out, the adjacency list of the network is formed, and the method is ended.
2.2 calculation of shortest paths between vertices
The calculation of the shortest path between the vertices can be performed according to the formed adjacency list of the cable bridge network. Common shortest path calculation methods include Dijkstra algorithm and Floyd algorithm. The basic idea of these two algorithms is identical, except that Dijkstra's algorithm is an algorithm that seeks the shortest path between single sources, and Floyd's algorithm is an algorithm that seeks the shortest path between all vertices. The number of the vertexes corresponding to the cable starting point in the cable bridge network is far less than that of all the vertexes, so that a Floyd algorithm is not suitable to be adopted, and a Dijkstra algorithm can be considered to be adopted.
For a given network G ═ (V, E), V0For the source vertex, v can be obtained by Dijkstra algorithm0Shortest path to all other vertices. The Dijkstra algorithm is a method for gradually generating shortest paths according to the ascending order of the lengths of the shortest paths, and the basic idea of the algorithm is as follows: dividing all vertices in the network G into two groups, the first group comprising the determined shortest pathsThe vertex of (c), denoted as set S, initially contains only one source point v0(ii) a The second group includes vertices for which the shortest path has not been determined, denoted as V-S. Adding the vertex in V-S to S one by one according to the increasing order of the shortest path length until the vertex is added to S from V0All vertices that can be reached by departure are included in S. In this process, the total hold is from v0The shortest path to each vertex of the first set S is not greater than v0The shortest path length to any vertex of the second set V-S, the distance value corresponding to the vertex of the second set being from V0The shortest path length to this vertex, which only includes the vertices of the first set S as intermediate vertices. For any point j, v in S0The path lengths to j are all less than v0Path length to any point in V-S.
Let d [ ] denote the distance vector from the source point to the vertex in V-S via the vertex in S, wdata (i, j) denotes the weight of the edge < i, j >, which can be looked up by the adjacency list, vector p [ ] is used to store the shortest path, and p [ i ] denotes the predecessor vertex number of vertex i on the shortest path. The Dijkstra algorithm is implemented as shown in fig. 2.
If the Dijkstra algorithm is adopted in the automatic cable laying program, the Dijkstra algorithm needs to be called once every time a cable is laid, the shortest paths from the bridge network vertex corresponding to the starting point of the cable to all other vertices are calculated, and the calculation amount is very large. Considering that cables generally pass through a few points on a cable bridge, such as an electricity distribution room outlet, a device inlet, etc., one or more vertices may be manually designated as "beam spots" in a cable bridge network, and then the Dijkstra algorithm may be used to calculate the shortest paths from all other vertices to the beam spots using the beam spots as source vertices. It is desirable to ensure that all cables pass through at least one beam-focusing point when the beam-focusing point is selected. When the shortest path between two vertexes corresponding to the starting point and the ending point of a certain cable is calculated, the shortest path between the two vertexes can be obtained only by minimizing the sum of the shortest distances from the two vertexes to a certain convergence point. Therefore, the shortest path of all cables can be obtained only by carrying out Dijkstra calculation for a plurality of times (equal to the number of bundling points), and the calculation amount is greatly reduced.
3 automatic laying of cable
Since the starting point and the terminating point of the cable are devices, the overhead point of the cable needs to be firstly obtained when the cable is automatically laid. The distance between the general equipment (only electric equipment or electric equipment) and the bridge is short, and the cable bridge primitives can be automatically searched by using the selection set filter within a certain range (such as a square with the side length of 5m and taking the equipment point as the center) near the equipment point according to the position of the equipment point. If no bridge frame primitive exists in the range, the range is expanded and the search is continued; and if more than one bridge primitive is searched, selecting the bridge closest to the equipment. After the cable bridge on the rack is selected, the point on the bridge closest to the equipment is the rack-on point of the equipment.
If the upper rack point is positioned in the middle of a section of cable bridge, two vertexes are arranged corresponding to the starting point and the ending point of the section of cable bridge. By the method introduced in the above section, the shortest path from two vertices corresponding to the starting device to two vertices corresponding to the terminating device of the cable can be obtained, and there are four paths in total, where the path with the shortest distance is the laying path of the cable. If the overhead point is the end point of the cable bridge, the shortest path from the vertex corresponding to the starting equipment to the vertex corresponding to the ending equipment of the cable is the laying path of the cable.
It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (9)
1. An automatic cable laying method is characterized by comprising the following steps:
compiling an original cable list, wherein the original cable list comprises a cable number, a cable starting equipment number, a cable terminating equipment number and a cable specification model;
drawing an electrical plane layout diagram: adding electrical equipment on the existing process layout, and marking the number of the electrical equipment and the number of the electrical equipment to form an electrical plane layout;
drawing cable bridges on the electrical plane layout drawing according to the positions and the number of the electrical equipment and the electrical equipment, and forming a cable bridge layout drawing, wherein primitives representing the cable bridges in the cable bridge layout drawing correspond to specific cable bridges one by one;
generating a cable bridge network adjacency list according to a cable bridge layout diagram, wherein the cable bridge network adjacency list is drawn as a network G according to the whole cable bridge channel, the intersection point and the end point of a cable bridge are taken as the vertex V of the network, and the edges E and G of the cable bridge diagram are (V and E);
calculating shortest paths among the vertexes, designating cluster points, and calling an algorithm by using the designated cluster points as source points to calculate the shortest paths from all other vertexes to the cluster points;
sequentially reading the next cable in the original cable inventory, searching the positions of the starting equipment and the ending equipment of the cable on a cable bridge layout diagram, and solving the corresponding overhead point;
the shortest path from the top point of the cable bridge corresponding to the cable starting equipment to the top point of the cable bridge corresponding to the cable terminal equipment is obtained, and the shortest path is the laying path of the cable; the cable starting equipment is electrical equipment or electric equipment; the cable terminal equipment is electrical equipment or electric equipment;
judging whether all cables have solved laying paths or not, if so, ending the process; if not, jumping to the next cable which is read from the original cable list in sequence.
2. The method as claimed in claim 1, wherein the compiling of the original cable inventory includes obtaining cable information according to a power distribution system diagram, and writing the cable information from AutoCAD into an Excel file through an ADO interface.
3. An automated cabling process according to claim 1, wherein said forming an electrical floor plan comprises: the electrical equipment number is attached to a primitive representing the equipment in the form of extension data xdata, and the electrical equipment number is attached to the primitive representing the equipment in the form of extension data xdata.
4. The method of claim 1, wherein the cable bridge network adjacency list is generated by the following steps:
constructing a cable bridge network G, wherein G is (V, E), and V is the top point of the network, namely the intersection point and the end point of the cable bridge; the cable tray is edge E of FIG. G; the length of each cable bridge is the weight w of the corresponding edge; if no cable bridge frame is directly connected between the two vertexes, the weight is + ∞;
a plurality of vertexes vi exist in the network G, all vertexes adjacent to the vertexes vi are linked into a single linked list with a head node, and the single linked list is an adjacent list of the vertexes vi;
each node in the singly linked list contains three fields: the adjoining point field indicates coordinates of a vertex adjoining the vertex vi; the weight value field indicates the distance between the vertex corresponding to the node and the vertex vi; the chain domain indicates the next node adjacent to the vertex vi, and if the next node is not present, the node is NULL;
meanwhile, each single linked list is required to be additionally provided with a table head node, a data field for storing the coordinates of the vertex vi and a head pointer field pointing to the first node in the linked list.
5. The method of claim 1, wherein generating the cable tray network adjacency list according to the cable tray layout comprises:
screening out the cable bridge primitives in the electrical plane layout diagram by using a selection set filter to form a selection set;
sequentially taking out the next cable bridge frame graphic element from the selection set, and obtaining definition data of the graphic element;
obtaining the item designated by the DXF group code 10 from the primitive definition data, i.e. the start coordinate of the cable bridge; acquiring an item specified by the DXF group code 11 from the graphic element definition data, namely the coordinates of the termination point of the cable bridge;
judging whether the initial point establishes an adjacency list or not, if not, establishing the adjacency list of the initial point by taking the initial point as a list head node, and adding a linked list node corresponding to the termination point into the initial point adjacency list; if the receiving list is established, adding a linked list node corresponding to the termination point into the initial point adjacency list;
judging whether the non-extracted primitives exist in the selection set or not, if the non-extracted primitives exist, jumping to the step of sequentially extracting the next cable bridge primitive from the selection set, and acquiring definition data of the primitive; and if no primitive is not taken out, the adjacency list of the network is formed, and the method is ended.
6. The method of claim 1, wherein all head nodes in the cable bridge network adjacency list are sequentially stored in a vector.
7. The method of claim 1, wherein the calculation of the shortest path between the vertices is performed by Dijkstra algorithm or Floyd algorithm.
8. The method of claim 1, wherein computing the shortest path between vertices comprises:
all vertices in the network G are divided into two groups, the first group including vertices for which the shortest path has been determined, denoted as set S, S ═ v0}，v0Represents a source point at the beginning; the second group comprises the vertexes of which the shortest path is not determined yet and is marked as V-S;
adding the vertex in V-S to S one by one according to the increasing order of the shortest path length until the vertex is added to S from V0All vertices that can be reached by departure are included in S;
wherein, from v0The shortest path to each vertex of the first set S is not greater than v0A shortest path length to any vertex of the second set V-S;
the vertices of the second group correspond to distance values from v0The shortest path length to this vertex, including only the vertices of the first set S as intermediate vertices;
for S ZhongrenMean point j, v0The path lengths to j are all less than v0Path length to any point in V-S.
9. A storage medium storing a program for executing an automatic cabling method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011041265.8A CN112332306A (en) | 2020-09-28 | 2020-09-28 | Automatic cable laying method and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011041265.8A CN112332306A (en) | 2020-09-28 | 2020-09-28 | Automatic cable laying method and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112332306A true CN112332306A (en) | 2021-02-05 |
Family
ID=74304399
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011041265.8A Pending CN112332306A (en) | 2020-09-28 | 2020-09-28 | Automatic cable laying method and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112332306A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112968398A (en) * | 2021-02-22 | 2021-06-15 | 上海市城市建设设计研究总院（集团）有限公司 | Intelligent wiring method for BIM cable bridge based on inventory list |
| CN116166829A (en) * | 2023-03-20 | 2023-05-26 | 上海信辉科技有限公司 | Automatic pipeline path building system based on graph database |
| EP4195428A1 (en) * | 2021-12-13 | 2023-06-14 | Goodville GmbH | Cable laying system for the automated laying of cables in a building, comprising a cable laying device and cable laying device |
| CN116992695A (en) * | 2023-09-25 | 2023-11-03 | 国网山东省电力公司莱芜供电公司 | Substation cable prediction method, system, terminal and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110442996A (en) * | 2019-08-13 | 2019-11-12 | 四川电力设计咨询有限责任公司 | A method of the entity electrical cable intelligent laying based on PDMS platform |
-
2020
- 2020-09-28 CN CN202011041265.8A patent/CN112332306A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110442996A (en) * | 2019-08-13 | 2019-11-12 | 四川电力设计咨询有限责任公司 | A method of the entity electrical cable intelligent laying based on PDMS platform |
Non-Patent Citations (2)
| Title |
|---|
| 孙哲: "《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》", 15 March 2016 * |
| 黄祖光: "基于Dijkstra算法的电缆敷设系统设计及实现", 《电网与清洁能源》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112968398A (en) * | 2021-02-22 | 2021-06-15 | 上海市城市建设设计研究总院（集团）有限公司 | Intelligent wiring method for BIM cable bridge based on inventory list |
| CN112968398B (en) * | 2021-02-22 | 2022-10-04 | 上海市城市建设设计研究总院（集团）有限公司 | Intelligent wiring method for BIM cable bridge based on inventory list |
| EP4195428A1 (en) * | 2021-12-13 | 2023-06-14 | Goodville GmbH | Cable laying system for the automated laying of cables in a building, comprising a cable laying device and cable laying device |
| CN116166829A (en) * | 2023-03-20 | 2023-05-26 | 上海信辉科技有限公司 | Automatic pipeline path building system based on graph database |
| CN116166829B (en) * | 2023-03-20 | 2023-10-03 | 上海信辉科技有限公司 | Automatic pipeline path building system based on graph database |
| CN116992695A (en) * | 2023-09-25 | 2023-11-03 | 国网山东省电力公司莱芜供电公司 | Substation cable prediction method, system, terminal and storage medium |
| CN116992695B (en) * | 2023-09-25 | 2024-02-20 | 国网山东省电力公司莱芜供电公司 | Substation cable prediction method, system, terminal and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112332306A (en) | Automatic cable laying method and storage medium | |
| Eastman | Representations for space planning | |
| Dong et al. | Ship pipe route design using improved A* algorithm and genetic algorithm | |
| Montreuil et al. | Strategic interpolative design of dynamic manufacturing systems layouts | |
| CN107784380B (en) | Optimization method and optimization system for routing inspection shortest path | |
| CN102521878B (en) | Programmable three-dimensional human body modeling and human body measurement system and method thereof | |
| US8930869B2 (en) | Method, program, and apparatus for aiding wiring design | |
| US20170193133A1 (en) | Method and device for automatically routing multi-branch cable | |
| CN115496030B (en) | Analog circuit wiring automation method and system capable of processing electrical and geometric constraints | |
| CN102346795A (en) | Automatic quick wiring method for electric and electronic virtual experiments | |
| CN104317886B (en) | The search choosing method at neighbour's conditional number strong point when tomography constrains lower Grid node interpolation | |
| Conru et al. | Computational support for interactive cable harness routing and design | |
| CN105787811A (en) | Method and system for automatic layout of power grid system graph to overcome crossing defect | |
| CN109839927B (en) | Method and device for robot path planning | |
| CN103839222A (en) | Grid-to-vector parallel system based on hierarchical boundary topology search model | |
| CN114399591A (en) | Laser point cloud data-based vectorization extraction method and device for power transmission line body | |
| CN115859899A (en) | Method for integrated circuit standard unit layout migration with multiple driving capacities | |
| CN113960969A (en) | Logistics storage scheduling method and system based on big data | |
| CN108171785B (en) | SAH-KD tree design method for ray tracing | |
| Kao et al. | Cross point assignment with global rerouting for general-architecture designs | |
| CN115688341A (en) | Distribution network thematic map layout method based on multi-branch tree collision detection and storage medium | |
| JPH1021269A (en) | Method and device for supporting design of wiring route | |
| CN114970165A (en) | Digital entity automatic modeling method, system and equipment for cable in bridge | |
| CN112215417B (en) | Optimal distribution method for landing points of flexible connection multi-node small celestial body detector | |
| Sloan et al. | Parallel vector data input |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210205 |