Indoor strong current loop wiring method and system based on minimum spanning tree

Abstract

The present application relates to the technical field of interior decoration design, and solves the technical problems of low design efficiency and long line length of the current indoor strong current loop wiring, and relates to an indoor strong current loop wiring method based on a minimum spanning tree, comprising the following processes: S1, establishing a wiring network according to house type object data and various line cost data; S2, calculating the optimal path between an electrical box and each socket and between sockets; S3, constructing a distance network between the electrical box and each socket; S4, calculating the minimum spanning tree of the distance network; and the present application also relates to an indoor strong current loop wiring system based on a minimum spanning tree, comprising: a wiring network establishing module, which is used for establishing a wiring network according to house type object data and various line cost data. The present application can provide a strong current loop wiring scheme that saves materials and improves the design efficiency of indoor home decoration.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of architectural interior decoration design, and in particular to an indoor strong current loop wiring method based on a minimum spanning tree and a system thereof. BACKGROUND

[0002] Circuit design is an essential process in modern architectural interior decoration design, which provides specific schemes for the electrical circuit layout in buildings. Traditional strong current loop design mostly relies on manual work, which connects the nearest unconnected socket from the electrical box by calculating the distance between the electrical box and the socket, and completes the strong current loop design. Since this design method adopts a greedy strategy, and the generated design scheme implicitly has unnecessary restrictions, the length of the designed circuit is too long, and it also consumes human time and has low design efficiency. SUMMARY

[0003] In view of the deficiencies of the prior art, the present application provides an indoor strong current loop wiring method based on a minimum spanning tree and a system thereof, which solves the technical problems of low design efficiency and long circuit length of the current indoor strong current loop wiring design. The present application can provide a strong current loop wiring scheme that saves materials and improves the efficiency of interior decoration design.

[0004] To solve the above technical problems, the present application provides the following technical scheme: an indoor strong current loop wiring method based on a minimum spanning tree, comprising the following processes:

[0005] S1, establishing a wiring network according to the house type object data and various line cost data;

[0006] S2, calculating the optimal path between the electrical box and each socket, and between the sockets;

[0007] S3, constructing a distance network between the electrical box and each socket;

[0008] S4, calculating the minimum spanning tree of the distance network;

[0009] S5, deriving a strong current loop wiring scheme according to the electrical box and each socket or the sockets corresponding to each edge in the minimum spanning tree.

[0010] Further, in step S2, the calculation of the optimal path comprises the following steps:

[0011] S21, designing a cost function a on the edge set according to the definition of the optimal path;

[0012] S22, using an optimal path search algorithm on the wiring network to obtain the total cost d(v), the number of straight line segments b(v), and the predecessor set f(v) corresponding to the optimal path from the starting point A to each node v;

[0013] S23, according to the total cost d(v) of each node on the optimal path, the number of straight segments b(v) and the predecessor set f(v), the backtracking method is used to obtain the optimal path with the lowest value of the cost function a.

[0014] Further, in step S23, the backtracking method used to obtain the minimum optimal path includes the following steps:

[0015] S231, according to the calculated values of d(B), b(B) and f(B), the solution space tree of the minimum optimal path between AB is determined;

[0016] S232, the optimal path between AB is obtained by searching the above solution space tree in a depth-first manner.

[0017] Further, in step S233, the depth-first manner is recursive backtracking or iterative backtracking, and a pruning function is used to avoid invalid search during the search of the solution space tree.

[0018] Further, in step S22, the optimal path search algorithm is a breadth-first search or a dynamic programming algorithm.

[0019] Further, in step S3, the distance network between the electrical box and each socket includes the following process:

[0020] S31, the set of coordinate points corresponding to the electrical box and all sockets is taken as the node set S of the distance network;

[0021] S32, any two different nodes in the node set S form a node pair v, v', and the node pair v, v' corresponds to an edge in the distance network, and the edge set is 2 S ;

[0022] S33, the distance network is constructed according to the node set S and the edge set 2 S

[0023] Among them, the cost function on any edge vv' of the distance network is P vv′ is the optimal path connecting v and v' in the wiring network.

[0024] Further, in step S4, the Prim algorithm is used to calculate the minimum spanning tree of the distance network.

[0025] Further, in step S5, the method for deriving the strong current loop wiring scheme includes the following steps:

[0026] S51, the corresponding optimal path in each edge in the minimum spanning tree of the distance network corresponds to a wire pipe containing one wire for live wire, zero wire and ground wire, which is connected to two nodes in turn along the optimal path;

[0027] ​S52. According to the above correspondence, the layout paths of all conduits and wires are derived from the edge set of the minimum spanning tree of the distance network to obtain the wiring scheme of the power circuit.

[0028] This invention also provides a system for applying the above-mentioned indoor high-voltage circuit wiring method, the specific solution of which is as follows:

[0029] An indoor power circuit wiring system based on minimum spanning tree, comprising:

[0030] A cabling network establishment module is used to establish a cabling network based on apartment type data and various line fee data.

[0031] An optimal path calculation module is used to calculate the optimal path between the electrical box and each socket, and between sockets themselves.

[0032] A distance network construction module, which is used to construct a distance network between the electrical box and each socket;

[0033] A minimum spanning tree calculation module, which is used to calculate the minimum spanning tree of the distance network;

[0034] A high-voltage circuit wiring scheme export module is used to export high-voltage circuit wiring schemes based on the wiring between electrical boxes and sockets or between sockets corresponding to each edge in the minimum spanning tree.

[0035] By employing the above technical solution, the present invention provides an indoor power circuit wiring method and system based on minimum spanning tree, which has at least the following beneficial effects:

[0036] 1. This invention obtains a high-voltage circuit wiring scheme by establishing a wiring network and using the optimal path generation algorithm and the minimum spanning tree algorithm. This results in a wiring scheme that meets the high-voltage circuit laying specifications and has a lower material cost in a global sense. Compared with traditional high-voltage circuit design methods, it has lower material consumption and higher design efficiency.

[0037] 2. This invention can provide a material-saving high-voltage circuit wiring solution and improve the efficiency of interior decoration design. Attached Figure Description

[0038] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:

[0039] Figure 1 This is a flowchart of the indoor high-voltage circuit wiring method of the present invention;

[0040] Figure 2 The schematic diagram of the principle of establishing the wiring network example of the present application;

[0041] Figure 3 The schematic diagram of the principle of the algorithm implementation of the optimal path between two nodes on the graph of the present application;

[0042] Figure 4 The schematic diagram of the principle of constructing the distance network between the electrical box and each socket of the present application;

[0043] Figure 5 The schematic diagram of the method of deriving the wiring scheme from the minimum spanning tree in the distance network of the present application;

[0044] Figure 6 The flow chart of calculating the optimal path of the present application;

[0045] Figure 7 The flow chart of obtaining the minimum optimal path by using the backtracking method of the present application;

[0046] Figure 8 The flow chart of constructing the distance network between the electrical box and each socket of the present application;

[0047] Figure 9 The flow chart of the method of deriving the strong current loop wiring scheme of the present application;

[0048] Figure 10 The principle block diagram of the indoor strong current loop wiring system of the present application.

[0049] In the figure: 100, wiring network establishment module; 200, optimal path calculation module; 300, distance network construction module; 400, minimum spanning tree calculation module; 500, strong current loop wiring scheme derivation module. DETAILED DESCRIPTION

[0050] In order to make the above-mentioned purposes, features and advantages of the present application more obvious and easy to understand, the present application will be further described in detail below in combination with the drawings and specific embodiments. The implementation process of how to apply technical means to solve technical problems and achieve technical effects of the present application can be fully understood and implemented.

[0051] Those skilled in the art can understand that all or part of the steps in the above-mentioned embodiment methods can be completed by programs instructing related hardware, therefore, the present application can adopt a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer usable storage media (including but not limited to disk memory, CD-ROM, optical memory, etc.) containing computer usable program codes.

[0052] Referring to Figures 1-10 , an embodiment of a method for indoor strong current loop wiring based on a minimum spanning tree is shown, comprising the following steps:

[0053] S1, a wiring network is established according to house type object data and various line cost data.

[0054] The house type object data includes the positions and shapes of objects such as walls, doors and windows, beams, electrical boxes, and sockets. The various line cost data includes the unit length costs of pipes, live wires, ground wires, neutral wires, and wire slots.

[0055] The wiring network established by the house type object data and the various line cost data includes a node set, an edge set, and a cost function on the edge set. The node set is composed of the coordinates of electrical boxes, sockets, and possible turning points of the line. The edge set is composed of line segments with two endpoints being two coordinates that can be directly wired in the node set. The cost function on the edge set is given by the various line costs, the lengths of the line segments, and the distances that need to be slotted.

[0056] The wiring network needs to construct a node set, an edge set, and a cost function on the edge set, denoted as V, E, and w respectively. The node set V is composed of the coordinates of electrical boxes, sockets, and possible turning points of the line. The edge set E is composed of line segments with two endpoints being two coordinates that can be directly wired in the node set. The cost function w on the edge set E is given by the various line costs, the lengths of the line segments, and the distances that need to be slotted.

[0057] For example, any line segment in the edge set E is denoted as e, and its cost function value w(e) is given by the various line costs, the length of the line segment, and the distance that needs to be slotted. The specific formula is:

[0058]

[0059] where c 火线 , c 零线 , c 地线 , c 线管 , and c 线槽 are the unit length costs of live wires, neutral wires, ground wires, pipes, and wire slots respectively, is the length of the line segment, is the distance that needs to be slotted.

[0060] Referring to Figure 2, provides a method example of establishing a wiring network, the node set of the wiring network can be composed of the coordinate points corresponding to the intersection of each edge of the wall with other walls or ground, the coordinate points of the electrical box or socket, and the projection points of the electrical box or socket on the ground or ceiling; the edge set can be obtained by connecting the nodes on the edges of the wall in sequence, and connecting the coordinate points of the electrical box or socket with the projection points of the electrical box or socket on the ground or ceiling, and in Figure 2 , all nodes constitute a node set, and all edges constitute an edge set.

[0061] S2, calculate the optimal path between the electrical box and each socket, and between the sockets.

[0062] Please refer to Figure 6 , according to the definition of the optimal path, design the cost function on the edge set, use the optimal path search algorithm on the wiring network, obtain the optimal path with the lowest cost function value and the cost of the path, and calculate the optimal path including the following steps:

[0063] S21, according to the definition of the optimal path, design the cost function α on the edge set;

[0064] S22, use the optimal path search algorithm on the wiring network to obtain the total cost d(v), the number of straight line segments b(v), and the predecessor set f(v) corresponding to the optimal path from the starting point A to each node v, and the optimal path search algorithm is breadth-first search or dynamic programming algorithm;

[0065] S23, according to the total cost d(v), the number of straight line segments b(v), and the predecessor set f(v) of each node on the optimal path, use the backtracking method to obtain the optimal path with the lowest cost function value α.

[0066] The cost function can be set as α(P) = w(P) + λb(P), where w(P) = ∑e∈Pw(e), b(P) is the number of straight line segments on P, and λ is the additional cost generated by each bending.

[0067] Please refer to Figure 3 , provides a calculation example of using breadth-first search to obtain the optimal path between points A and B on the graph with the minimum cost function α(P) = w(P) + λb(P), for each node v on the graph, the search algorithm calculates the total cost d(v) (in line segment length) of the optimal path connecting node A and node v, and the number of straight line segments is b(v); the set of another node adjacent to node v and closer to node A in all optimal paths connecting node A and node v is f(v), and after d(B), b(B), and f(B) are calculated, the minimum optimal path between A and B is obtained by backtracking. Figure 3

[0068] Please refer to Figure 7 , the backtracking method for obtaining the minimum optimal path includes the following steps:​

[0069] S231, determining the solution space tree of the minimum optimal path between AB according to the calculated value of d(B), b(B), f(B);

[0070] The solution space tree has two types, namely subset tree and permutation tree, wherein:

[0071] Subset tree: the given problem is to find a subset from a set S of n elements that satisfies a certain property, and the corresponding solution space tree is:

[0072] Permutation tree: the given problem is to determine the permutation of n elements that satisfies a certain property, and the corresponding solution space tree is.

[0073] S232, searching the above solution space tree in a depth-first manner to obtain the optimal path between AB, the depth-first manner is recursive backtracking or iterative backtracking, and a pruning function is used in the process of searching the solution space tree to avoid invalid search.

[0074] The solution of a complex problem is a decision sequence composed of several small decision steps, so the solution of a problem can be represented as a solution vector X=(x1, x2, …, xn), where the component xi corresponds to the selection of the i-th step, and the combination of all values of the component xi in X constitutes the solution vector space of the problem, which is simply referred to as the solution space or solution space tree (because the solution space is generally organized in the form of a tree), since a solution vector often corresponds to a certain state of the problem, the solution space is also called the state space tree of the problem.

[0075] Since backtracking is used to solve the problem, there is a process of returning to the ancestor node, so it is necessary to save the searched nodes. Generally, there are two ways: one is to use a child definition stack to save; the other is to use a recursive method.

[0076] When using backtracking, two strategies are usually used to avoid invalid search. One is to use a constraint function to prune the path that does not satisfy the constraint condition at the expanded node; the other is to use a bound function to prune the path that cannot obtain the solution or optimal solution of the problem. These two types of functions are collectively referred to as pruning functions.

[0077] S3, constructing a distance network between the electrical box and each socket.

[0078] Please refer to Figure 8 The set of coordinate points corresponding to the electrical box and all sockets is used as the node set of the distance network, and any two different nodes in the node set form a node pair corresponding to an edge in the distance network. The cost function of any edge in the distance network is the value of the optimal path connecting the nodes corresponding to the two ends of the edge in the wiring network. The construction of the distance network between the electrical box and each socket includes the following processes:

[0079] S31, the set of coordinate points corresponding to the electrical box and all the sockets is taken as a node set S of the distance network;

[0080] S32, any two different nodes in the node set S form a node pair v, v', and the node pair v, v' corresponds to an edge in the distance network, and an edge set 2 S ;

[0081] S33, the distance network is constructed according to the node set S and the edge set 2 S ;

[0082] In which, the cost function on any edge vv' in the distance network is P vv′ is the optimal path connecting v and v' in the wiring network.

[0083] Please refer to Figure 4 , the set of coordinate points corresponding to the electrical box and all the sockets is taken as a node set S of the distance network, and an edge set 2 S of the distance network, that is, any two different nodes in the node set S form a node pair v, v', and the node pair v, v' corresponds to an edge in the distance network, and the cost function on any edge vv' in the distance network is In which, P vv′ is the optimal path connecting v and v' in the wiring network.

[0084] S4, the minimum spanning tree of the distance network is calculated, and the Prim algorithm is used to calculate the minimum spanning tree of the distance network.

[0085] The minimum spanning tree of the distance network does not contain a loop, the node set of the distance network is connected in the minimum spanning tree, and the minimum spanning tree has the minimum total cost under the above premise, and the minimum spanning tree T of the distance network is a subset of the edge set 2 S of the distance network, and satisfies that the edges in T do not form a loop in the distance network, and under the premise that any two nodes v, v' in the node set S of the distance network can find a path to connect each other in T, the minimum spanning tree T has the minimum total cost, and the minimum spanning tree T of the distance network is a subset of the edge set 2 of the distance network, and satisfies that the edges in T do not form a loop in the distance network, and under the premise that any two nodes v, v' in the node set S of the distance network can find a path to connect each other in T, the minimum spanning tree T has the minimum total cost, and the minimum spanning tree T of the distance network is a subset of the edge set 2 In which,

[0086] S5, the strong electric circuit wiring scheme is derived according to the electrical box and the line between the sockets or the line between the sockets corresponding to each edge in the minimum spanning tree.

[0087] Please refer to Figure 9 , the method for deriving the strong electric circuit wiring scheme comprises the following steps:

[0088] S51, the optimal path P vv′corresponding to connecting the two nodes v and v' along the optimal path P vv′ connecting the two nodes v and v' in turn, where a line tube containing one live wire, one neutral wire and one ground wire is used;

[0089] S52, according to the above correspondence, deriving the arrangement path of all line tubes and electric wires from the edge set of the minimum spanning tree T of the distance network, to obtain the wiring scheme of the strong electric circuit.

[0090] Each edge in the minimum spanning tree of the distance network corresponds to an optimal path between two points in the wiring network, so as to derive the wiring scheme of arranging electric wires and line tubes along the path.

[0091] Please refer to Figure 5 For the method of deriving the wiring scheme from the minimum spanning tree of the distance network, for each edge vv' in the minimum spanning tree T of the distance network, there is a corresponding optimal path Pvv' in the wiring network vv′ corresponding to connecting the two nodes v and v' along the optimal path Pvv', a line tube containing one live wire, one neutral wire and one ground wire is used; and deriving the arrangement path of all line tubes and electric wires from the edge set {vv': v, v'∈S, vv'∈T} of the minimum spanning tree T of the distance network, to obtain the wiring scheme of the strong electric circuit.

[0092] In this embodiment, by establishing the wiring network and using the optimal path generation algorithm and the minimum spanning tree algorithm to obtain the wiring scheme of the strong electric circuit, the wiring scheme generated can not only meet the laying specification of the strong electric circuit, but also have a smaller material cost in a global sense, and has lower material consumption and higher design efficiency compared with the traditional strong electric circuit design method.

[0093] Please refer to Figure 10 The embodiment provides a system applied to the above-mentioned indoor strong electric circuit wiring method, and specific scheme contents are as follows:

[0094] An indoor strong electric circuit wiring system based on a minimum spanning tree comprises:

[0095] A wiring network establishing module 100 is used to establish a wiring network according to house type object data and various line cost data;

[0096] An optimal path calculation module 200 is used to calculate the optimal path between electric boxes and various sockets and between sockets.

[0097] A distance network construction module 300 is used to construct a distance network between electric boxes and various sockets.

[0098] A minimum spanning tree calculation module 400 is used to calculate the minimum spanning tree of the distance network.

[0099] The strong current loop wiring scheme derivation module 500 is used for deriving the strong current loop wiring scheme according to the lines between the electrical boxes and the sockets or between the sockets corresponding to the edges in the minimum spanning tree.

[0100] The embodiment can provide a strong current loop wiring scheme saving materials and improve the indoor home design efficiency.

[0101] The strong current loop wiring scheme is obtained by using the optimal path generation algorithm and the minimum spanning tree algorithm after establishing the wiring network, which can make the generated wiring scheme meet the strong current loop laying specification and have a smaller material cost in the global sense, and has lower material consumption and higher design efficiency compared with the traditional strong current loop design method.

[0102] Each of the embodiments in the specification is described in a progressive manner, and each embodiment focuses on the difference from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the above embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can be referred to the part of the method embodiments.

[0103] The above embodiments are described in detail, and the principles and implementation manners of the present application are described by applying specific examples. The above embodiment is only used to help understand the method of the present application and its core idea; meanwhile, for the general skilled in the art, the specific implementation manner and application range can be changed according to the idea of the present application. In summary, the content of the specification should not be understood as the limitation of the present application.

Claims

1. A method for indoor strong current loop wiring based on a minimum spanning tree, characterized by, The method comprises the following steps: S1, establishing a wiring network according to the house type object data and the line cost data of various types; S2, calculating the optimal path between the electric box and each socket and between the sockets, comprising the following steps: S21, designing a cost function α on the edge set according to the definition of the optimal path; S22, using an optimal path search algorithm on the wiring network to obtain the total cost d(v), the number of straight line segments b(v) and the predecessor set f(v) corresponding to the optimal path from the starting point A to each node v; S23, using a backtracking method to obtain the optimal path with the lowest cost function α according to the total cost d(v), the number of straight line segments b(v) and the predecessor set f(v) of each node on the optimal path, comprising the following steps: S231, determining the solution space tree of the minimum optimal path between A and B according to the calculation results of d(B), b(B) and f(B); S232, searching the solution space tree in a depth-first manner to obtain the optimal path between A and B; S3, constructing a distance network between the electric box and each socket; In step S3, the construction of the distance network between the electric box and each socket comprises the following steps: S31, taking a set of coordinate points corresponding to the electric box and all sockets as a node set S of the distance network; S32, taking any two different nodes in the node set S as a node pair v, v', and taking the node pair v, v' as an edge set 2S of the distance network; S33, constructing the distance network according to the node set S and the edge set 2S; where the cost function on any edge of the distance network is , , , is the optimal path connecting v and v' in the wiring network; The set of coordinate points corresponding to the electric box and all the sockets is taken as the node set of the distance network, denoted as S; the edge set of the distance network is denoted as E S , that is, any two different nodes in S form a node pair v, , which corresponds to an edge in the distance network; the cost function of any edge in the distance network is denoted as C , wherein , is the optimal path connecting v and in the wiring network;​ S4, calculating the minimum spanning tree of the distance network; The minimum spanning tree of the distance network does not contain a loop, the node set of the distance network is connected in the minimum spanning tree, and the minimum spanning tree has the minimum total cost under the above premise, the minimum spanning tree T of the distance network is a subset of the edge set 2 S of the distance network, and the edges in T do not form a loop in the distance network, and under the premise that any two nodes v, v' in the node set S of the distance network can find a path to connect each other in T, the minimum spanning tree T has the minimum total cost , wherein ; S5, deriving a strong electric circuit wiring scheme according to the electric box and each socket or the sockets in each edge of the minimum spanning tree.

2. The method of claim 1, wherein: In step S233, the depth-first manner is recursive backtracking or iterative backtracking, and a pruning function is used to avoid invalid search during the search of the solution space tree.

3. The method of claim 1, wherein: In step S22, the optimal path search algorithm is a breadth-first search or a dynamic programming algorithm.

4. The method of claim 1, wherein: In step S4, the Prim algorithm is used to calculate the minimum spanning tree of the distance network.

5. The method of claim 1, wherein: In step S5, the method for deriving the strong electric circuit wiring scheme comprises the following steps: S51, taking the corresponding optimal path of each edge in the minimum spanning tree of the distance network as a wire tube containing one fire wire, one zero wire and one ground wire connected in sequence; S52, deriving the arrangement path of all wire tubes and electric wires from the edge set of the minimum spanning tree of the distance network according to the above correspondence to obtain the wiring scheme of the strong electric circuit.

6. A system for implementing the method of wiring a strong electrical circuit in a room according to any one of the preceding claims 1-5, characterized in that, The method comprises: a wiring network establishing module (100) for establishing a wiring network according to the house type object data and the line cost data of various types; an optimal path calculation module (200) for calculating the optimal path between the electric box and each socket and between the sockets; a distance network construction module (300) for constructing a distance network between the electric box and each socket; a minimum spanning tree calculation module (400) for calculating the minimum spanning tree of the distance network; The strong current circuit wiring scheme derivation module (500) derives a strong current circuit wiring scheme according to the line between the electrical box and the socket or the line between the sockets corresponding to each edge in the minimum spanning tree. The strong current circuit wiring scheme derivation module (500) derives a strong current circuit wiring scheme according to the line between the electrical box and the socket or the line between the sockets corresponding to each edge in the minimum spanning tree.

Images