CN112749458B - Cable path planning method, device, equipment and storage medium - Google Patents
Cable path planning method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN112749458B CN112749458B CN201911043279.0A CN201911043279A CN112749458B CN 112749458 B CN112749458 B CN 112749458B CN 201911043279 A CN201911043279 A CN 201911043279A CN 112749458 B CN112749458 B CN 112749458B
- Authority
- CN
- China
- Prior art keywords
- path
- branch
- cable
- paths
- length
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Abstract
The application discloses a cable path planning method, which comprises the following steps: removing the channel with full volume rate; acquiring a forbidden channel and setting a forbidden path; correcting the weight of the priority path according to the preset priority level, acquiring a necessary channel, setting the necessary path, calculating the shortest path length of the cable according to the set cable type, the forbidden path, the priority path and the necessary path, searching the path according to the preset rule and the preset priority order to obtain the path length of the final path, judging the path length, and taking the final path as the cable path and ending the path search if the difference value between the path length and the shortest path length is smaller than or equal to the set value. The automatic judgment and analysis provides a more reasonable planning scheme, a more optimal cable path is selected, the searched cable path is more reasonable, and the problems that the cable occupies a road firstly and is far in bypass or is not laid through path analysis or manual intervention are solved.
Description
Technical Field
The disclosure relates to the technical field of cable path planning, and in particular relates to a cable path planning method, device, equipment and storage medium.
Background
Cabling is the most complex and cumbersome link in electrical design, and path searching is the most core algorithm in cabling. At present, the traditional cable laying software is commonly applied at home and abroad, but the cable path searching in the existing software can only calculate the shortest path, and the complex field condition in the cable laying construction can not be considered. The path and the length of the cable can only provide primary reference for design, the accuracy is poor, the manual adjustment is difficult, constructors need to re-plan the path of the cable on site, and the construction difficulty is not fundamentally reduced. The idea of the existing path search algorithm is as follows: abstracting the channel and the equipment into a graph, converting the cable path search problem into graph theory, and solving the shortest path problem between two nodes. The mature algorithm is Dijkstra (DijJiestra) algorithm, A-Star algorithm and the like. The traditional cable path searching is focused on finding the shortest path between the starting point equipment and the end point equipment, dijkstra algorithm or other path searching algorithms are mechanically introduced, the actual condition of a construction site and the construction habit of constructors are not concerned, and when only the shortest path algorithm is considered, certain cables are firstly laid on the road, so that the follow-up application is limited by volume rate, and the bypass is far or the laying is not feasible.
Disclosure of Invention
In view of this, the present disclosure proposes a cable path planning method, including:
acquiring search setting parameters of a cable path; the searching setting parameters comprise the remaining channels after the preset channels are removed; the preset channels comprise channels with full volume rate and forbidden channels;
calculating the shortest path length of the cable according to the search setting parameters;
searching paths according to the search setting parameters to obtain initial paths, and accepting and rejecting all branch paths in the initial paths according to a preset accepting and rejecting rule to determine final paths;
acquiring the path length of the final path;
and when the difference value between the path length and the shortest path length is smaller than or equal to a set value, the final path is used as a cable planning path.
In one possible implementation, the method further includes:
when the difference value between the path length and the shortest path length is larger than the set value, adding the channel with full volume rate into the search setting parameters to obtain updated search parameters;
and searching paths according to the updated search setting parameters to obtain the initial paths, and accepting and rejecting all branch paths in the initial paths according to a preset accepting and rejecting rule to determine final paths.
In one possible implementation, the search parameter includes at least one of a must-via channel and a priority channel;
when calculating the shortest path length of the cable according to the search setting parameters, the method comprises the following steps:
and calculating the shortest path length of the cable according to the cable type and the search setting parameters.
In one possible implementation manner, the preset trade-off rule includes at least one of the following:
if the difference value of the two branch path lengths is larger than the preset difference value, selecting a branch path with a shorter path length;
selecting a branch path of an existing cable;
selecting a branch path without layer jump or side jump;
selecting branch paths with few bending points;
selecting a branch path corresponding to a bottom layer bridge or a cable pit support; wherein, the bottom layer bridge is not fully laid with cables;
selecting branch paths with cables of the same model;
when the preset accepting and rejecting rules comprise a plurality of rules, accepting and rejecting all branch paths extending from the current intersection point in the final path according to the arrangement sequence of the plurality of rules.
In one possible implementation manner, when a preset accepting and rejecting rule includes a plurality of rules, accepting and rejecting each branch path extending from a current junction in the final path in turn according to an arrangement sequence of the plurality of rules, including:
when the absolute value of the length difference value of every two branch paths in the branch paths extending from the current intersection point is larger than the preset difference value, selecting a branch path with a longer length, and recording the selected branch path with a longer length and the branch path with a length difference value smaller than the preset difference value into a first branch path group;
selecting a branch path of the laid cable from the first branch path group as a second branch path group; when each branch path in the first branch path group is not provided with a cable, the first branch path group is directly marked as the second branch path group;
discarding branch paths with layer jump or side jump in the second branch path group to obtain a third branch path group;
acquiring the number of bending points of each branch path in the third branch path group, and selecting branch paths with a small number of bending points to obtain a fourth path group;
selecting branch paths of the bottom bridge frame which are not fully laid with cables from the fourth branch path group to obtain a fifth branch path group;
selecting branch paths with the same cable model from the fifth branch path group to obtain the final path;
wherein, the value range of the preset difference value is as follows: 150 mm-250 mm.
In one possible implementation, the set value ranges from 150mm to 250mm.
In one possible implementation manner, after determining the final path, the method further includes a step of acquiring path information of the final path;
wherein the path information includes inflection point information of the final path.
According to one aspect of the disclosure, the cable path planning device is characterized by comprising a path setting module, a shortest path length calculation module, a path searching module and a path length judging module;
the path setting module is configured to acquire search setting parameters of the cable path; the searching setting parameters comprise the remaining channels after the preset channels are removed; the preset channels comprise channels with full volume rate and forbidden channels;
the shortest path length calculation module is configured to calculate the shortest path length of the cable according to the search setting parameters;
the path searching module is configured to perform path searching according to the searching setting parameters to obtain an initial path, and perform choosing and rejecting on each branch path in the initial path according to a preset choosing and rejecting rule to determine a final path;
the path length judging module is configured to acquire the path length of the final path;
and when the difference value between the path length and the shortest path length is smaller than or equal to a set value, the final path is used as a cable planning path.
According to another aspect of the present disclosure, there is also provided a cable path planning apparatus, including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to implement any of the methods described above when executing the executable instructions.
According to another aspect of the present disclosure, there is also included a non-transitory computer readable storage medium having stored thereon computer program instructions, characterized in that the computer program instructions, when executed by a processor, implement the method of any of the preceding.
According to the cable path planning method, a forbidden path is removed through removing paths with full volume rate, the weight of a priority path is corrected according to the priority level, a necessary path is set, firstly, the shortest path through which a cable passes is calculated according to a preset cable type, then path searching is carried out according to a preset rule and a preset priority order, path information and path length are recorded and judged when the path searching is finished, if the difference value of the shortest paths is smaller than or equal to a set value, the current path is used as the cable path, the path searching is finished, automatic judgment and analysis are carried out, a more reasonable planning scheme is provided, a better cable path is selected, the searched cable path is more reasonable, and the problems that the cable occupies a path firstly and is far in bypass or is not laid through manual intervention are solved through path analysis.
Other features and aspects of the present disclosure will become apparent from the following detailed description of exemplary embodiments, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments, features and aspects of the present disclosure and together with the description, serve to explain the principles of the disclosure.
FIG. 1 illustrates a flow chart of a cable path planning method of an embodiment of the present disclosure;
FIG. 2 illustrates a block diagram of a cable path planning device of an embodiment of the present disclosure;
fig. 3 shows a block diagram of a cable path planning device of an embodiment of the present disclosure.
Detailed Description
Various exemplary embodiments, features and aspects of the disclosure will be described in detail below with reference to the drawings. In the drawings, like reference numbers indicate identical or functionally similar elements. Although various aspects of the embodiments are illustrated in the accompanying drawings, the drawings are not necessarily drawn to scale unless specifically indicated.
The word "exemplary" is used herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.
In addition, numerous specific details are set forth in the following detailed description in order to provide a better understanding of the present disclosure. It will be understood by those skilled in the art that the present disclosure may be practiced without some of these specific details. In some instances, methods, means, elements, and circuits well known to those skilled in the art have not been described in detail in order not to obscure the present disclosure.
Fig. 1 shows a flow chart of cable path planning according to an embodiment of the present disclosure. As shown in fig. 1, the cable path planning method includes:
step S100, acquiring search setting parameters of a cable path; the method comprises the steps that setting parameters are searched, wherein the searching of the setting parameters comprises removing remaining channels after a preset channel is removed; the preset channel comprises a channel with full volume rate and a forbidden channel, the shortest path length of the cable is calculated according to the search setting parameters, the path search is carried out according to the search setting parameters to obtain an initial path, each branch path in the initial path is selected and divided according to a preset selection rule to determine a final path, the path length of the final path is obtained in the step S400, and the final path is used as a cable planning path when the difference value between the path length and the shortest path length is smaller than or equal to a set value.
According to the cable path planning method, a forbidden path is removed through removing paths with full volume rate, the weight of a priority path is corrected according to the priority level, a necessary path is set, firstly, the shortest path through which a cable passes is calculated according to a preset cable type, then path searching is carried out according to a preset rule and a preset priority order, path information and path length are recorded and judged when the path searching is finished, if the difference value of the shortest paths is smaller than or equal to a set value, the current path is used as the cable path, the path searching is finished, automatic judgment and analysis are carried out, a more reasonable planning scheme is provided, a better cable path is selected, the searched cable path is more reasonable, and the problems that the cable occupies a path firstly and is far in bypass or is not laid through manual intervention are solved through path analysis.
Specifically, referring to fig. 1, step S100 is first performed to obtain a search setting parameter of a cable path; the method comprises the steps that setting parameters are searched, wherein the searching of the setting parameters comprises removing remaining channels after a preset channel is removed; the preset channels include channels with full volume rate and forbidden channels.
In one possible implementation, the designer sets a path to be prohibited from passing, i.e., sets a priority level of a priority path for a prohibited path, and sets a necessary path. After the setting is completed, the paths with full volume rate are removed, forbidden paths are removed, the set priority path weight value is changed according to the priority level of the set priority path, and the necessary path is set according to the set necessary path. By manual intervention, the problems that the cable occupies a road first and then passes far or is laid out incompletely can be solved by manually setting a path which the cable is forbidden to travel, a path which the cable is preferentially to travel and a path which the cable must travel.
The path with full removal volume rate can be automatically removed. That is, the path in which the cable has been laid is recorded in the channel, and then whether the volume ratio is full can be judged according to the total width of the channel, and if it is judged that the volume ratio is full, the channel with the full volume ratio is removed.
After the path information is manually set, the path information is automatically set according to the manual setting, and then step S200 is performed to calculate the shortest path length of the cable according to the search setting parameters. Among other things, cable types including control cables and power cables are also considered.
In one possible implementation, if the cable type is preset on the a path, the a path may only run the control cable, and if the B path is preset on the B path, the B path may only run the power cable, and consider the prohibited path, the priority path, and the shortest path length that the cable must pass through in the step S100, and record the shortest path length as MinLength.
Then, step S300, performing path searching according to the search setting parameters to obtain an initial path, and accepting or rejecting each branch path in the initial path according to a preset accepting or rejecting rule to determine a final path.
And if the absolute value of the difference value of the path length values of two paths in the multiple branch paths is larger than a preset value, discarding the final path with the small branch path length value, wherein the range of the preset value is 150-250 mm. And then sequentially selecting branch paths of laid cables, selecting branch paths without layer jump or side jump, selecting branch paths with few bending points, selecting branch paths corresponding to a bottom bridge or a cable trench bracket without full cable laying, and selecting cable branch paths with the same model.
In one possible implementation manner, in the path searching process, four branch paths extend from the current junction, the branch paths extending from the current junction are selected and divided, the branch paths are compared in pairs, if the difference value of the length values of the two branch paths is greater than 200mm, the branch path with the great length value of the branch path is discarded, and if the difference value of the length value of the branch path is not greater than 200mm, the two branch paths are reserved.
In one possible implementation, during the path search, cabling is performed from the electrical cabinet to the equipment, and when it is performed again, cabling is performed preferentially along the branch path of the cabling.
In one possible implementation, the searched paths include C paths and D paths, where the number of inflection points of the C paths is 15, and the number of inflection points of the D paths is 10, and then the D paths are selected.
In one possible implementation, in the course of the path search, no cable is laid in one set of three-layer bridges, and then the lowest layer of bridges is preferentially selected for laying.
In one possible implementation, the path search is performed with a cable of 4×50 gauge, i.e. a cable comprising four cores, each core having a cross-sectional area of 50mm 2 And if three layers of the three-layer bridge frame are respectively provided with cables with three specifications of 4×120, 4×50 and 3×50, one layer of bridge frame provided with the cables with the specifications of 4×50 is preferably selected for laying.
It should be noted that, in one possible implementation manner, when the branch paths are selected and removed in the preset rule, the following order may be selected and removed:
when the absolute value of the difference value of the lengths of every two branch paths extending from the current intersection point is larger than a preset difference value, selecting a branch path with a longer length, recording the selected branch path with the longer length and the branch path with the difference value smaller than the preset difference value into a first branch path group, and selecting the branch path of the laid cable in the first branch path group as a second branch path group; when no cable is laid in each branch path in the first branch path group, the first branch path group is directly marked as a second branch path group, branch paths with layer jump or jump sides are abandoned in the second branch path group to obtain a third branch path group, the number of bending points of each branch path in the third branch path group is obtained, branch paths with a small number of bending points are selected to obtain a fourth path group, branch paths of a bottom bridge frame which is not fully laid with cables are selected in the fourth branch path group to obtain a fifth branch path group, and branch paths with the same cable model are selected in the fifth branch path group to obtain a final path, wherein the value range of a preset difference value is as follows: 150 mm-250 mm.
After the path searching is carried out to obtain a final path, recording the path information and the path Length of the final path, wherein the path Length of the final path is recorded as Length, and the path information comprises inflection point information.
Then, step S400 may be executed to obtain the path length of the final path, and when the difference between the path length and the shortest path length is less than or equal to the set value, the final path is used as the cable planning path.
In one possible implementation, the path Length of the final path is compared with that of the final path, and if the difference between the searched final path Length and the calculated shortest path Length is less than or equal to 200mm, i.e., length-MinLength is less than or equal to 200mm, the searched final path is taken as the cable path and the path search is ended.
In another possible implementation manner, the path Length of the final path is compared with that of the final path, if the difference between the searched final path Length and the calculated shortest path Length is greater than 200mm, i.e. Length-MinLength > 200, the channel with the full volume rate removed in step S100 is recovered first, step S300 is executed, the path search is performed according to the preset rule and the preset priority order, the final path is obtained, and the final path is used as the cable path and the path search is ended.
It should be noted that the set value is not limited to 200mm, and may be in the range of 150mm to 250mm, and although the cable path planning method is described above by way of example in the above steps, those skilled in the art will understand that the present disclosure should not be limited thereto. In fact, the user can flexibly set the cable path planning method according to personal preference and/or practical application scene, so long as the required functions are achieved.
In this way, the cable path planning method disclosed by the application removes the paths with full volume rate, removes the forbidden paths, corrects the weight of the priority path according to the priority level and sets the necessary path, calculates the shortest path through which the cable passes according to the preset cable type, then searches the paths according to the preset rule and the priority order, records the path information and the path length and judges when the path searching is finished, wherein the path length is a plurality of paths, if the difference value of the shortest paths is smaller than or equal to the set value, the current path is used as the cable path and the path searching is finished, the automatic judgment analysis is carried out, a more reasonable planning scheme is provided, a better cable path is selected, the searched cable path is more reasonable, and the problems that the cable occupies the path first and is far or is not laid through the subsequent bypass are solved through path analysis or manual intervention.
According to another aspect of the present disclosure, a cable path planning device 100 is further provided, and since the working principle of the cable path planning device 100 in the embodiment of the present disclosure is the same as or similar to the principle of the cable path planning method in the embodiment of the present disclosure, the repetition is not repeated. Referring to fig. 2, the path setting module 110, the shortest path length calculation module 120, the path search module 130 and the path length judgment module 140 are included;
a path setting module 110 configured to acquire search setting parameters of the cable path; the method comprises the steps that setting parameters are searched, wherein the searching of the setting parameters comprises removing remaining channels after a preset channel is removed; the preset channels comprise channels with full volume rate and forbidden channels;
a shortest path length calculation module 120 configured to calculate a shortest path length through which the cable passes according to the search setting parameter;
the path searching module 130 is configured to perform path searching according to the searching setting parameters to obtain an initial path, and perform a tradeoff on each branch path in the initial path according to a preset tradeoff rule to determine a final path;
a path length determination module 140 configured to obtain a path length of the final path;
and when the difference value between the path length and the shortest path length is smaller than or equal to a set value, taking the final path as a cable planning path.
Still further in accordance with another aspect of the present disclosure, a cable path planning device 200 is provided. Referring to fig. 3, a cable path planning apparatus 200 of an embodiment of the present disclosure includes a processor 210 and a memory 220 for storing instructions executable by the processor 210. Wherein the processor 210 is configured to implement any of the cable path planning methods described above when executing the executable instructions.
Here, it should be noted that the number of processors 210 may be one or more. Meanwhile, in the cable path planning apparatus 200 of the embodiment of the present disclosure, an input device 230 and an output device 240 may be further included. The processor 210, the memory 220, the input device 230, and the output device 240 may be connected by a bus, or may be connected by other means, which is not specifically limited herein.
The memory 220 is a computer-readable storage medium that can be used to store software programs, computer-executable programs, and various modules, such as: the cable path planning method of the embodiment of the disclosure corresponds to a program or a module. The processor 210 executes various functional applications and data processing of the cable path planning apparatus 200 by running software programs or modules stored in the memory 220.
The input device 230 may be used to receive an input digital or signal. Wherein the signal may be a key signal generated in connection with user settings of the device/terminal/server and function control. The output means 240 may comprise a display device such as a display screen.
According to another aspect of the present disclosure, there is also provided a non-transitory computer readable storage medium having stored thereon computer program instructions which, when executed by the processor 210, implement any of the cable path planning methods described in the foregoing.
The foregoing description of the embodiments of the present disclosure has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the various embodiments described. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or the technical improvements in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (8)
1. A method of cable path planning comprising:
acquiring search setting parameters of a cable path; the searching setting parameters comprise the remaining channels after the preset channels are removed; the preset channels comprise channels with full volume rate and forbidden channels;
calculating the shortest path length of the cable according to the search setting parameters;
searching paths according to the search setting parameters to obtain initial paths, and accepting and rejecting all branch paths in the initial paths according to a preset accepting and rejecting rule to determine final paths;
acquiring the path length of the final path;
when the difference value between the path length and the shortest path length is smaller than or equal to a set value, the final path is used as a cable planning path;
the preset trade-off rule comprises at least one of the following:
if the difference value of the two branch path lengths is larger than the preset difference value, selecting a branch path with a shorter path length;
selecting a branch path of an existing cable;
selecting a branch path without layer jump or side jump;
selecting branch paths with few bending points;
selecting a branch path corresponding to a bottom layer bridge or a cable pit support; wherein, the bottom layer bridge is not fully laid with cables;
selecting branch paths with cables of the same model;
when a plurality of rules are included in a preset accepting and rejecting rule, accepting and rejecting all branch paths extending from a current intersection point in the final path according to the arrangement sequence of the plurality of rules;
when a preset accepting and rejecting rule comprises a plurality of rules, sequentially accepting and rejecting all branch paths extending from a current intersection point in the final path according to the arrangement sequence of the plurality of rules, wherein the method comprises the following steps:
when the absolute value of the length difference value of every two branch paths in the branch paths extending from the current intersection point is larger than the preset difference value, selecting a branch path with a longer length, and recording the selected branch path with a longer length and the branch path with a length difference value smaller than the preset difference value into a first branch path group;
selecting a branch path of the laid cable from the first branch path group as a second branch path group; when each branch path in the first branch path group is not provided with a cable, the first branch path group is directly marked as the second branch path group;
discarding branch paths with layer jump or side jump in the second branch path group to obtain a third branch path group;
acquiring the number of bending points of each branch path in the third branch path group, and selecting branch paths with a small number of bending points to obtain a fourth branch path group;
selecting branch paths of the bottom bridge frame which are not fully laid with cables from the fourth branch path group to obtain a fifth branch path group;
selecting branch paths with the same cable model from the fifth branch path group to obtain the final path;
wherein, the value range of the preset difference value is as follows: 150 mm-250 mm.
2. The method as recited in claim 1, further comprising:
when the difference value between the path length and the shortest path length is larger than the set value, adding the channel with full volume rate into the search setting parameters to obtain updated search parameters;
and searching paths according to the updated search setting parameters to obtain the initial paths, and accepting and rejecting all branch paths in the initial paths according to a preset accepting and rejecting rule to determine final paths.
3. The method of claim 1, wherein the search parameter comprises at least one of a must-via channel and a priority channel;
when calculating the shortest path length of the cable according to the search setting parameters, the method comprises the following steps:
and calculating the shortest path length of the cable according to the cable type and the search setting parameters.
4. A method according to claim 1 or 2, wherein the set value is in the range of 150mm to 250mm.
5. The method according to claim 1 or 2, further comprising the step of acquiring path information of the final path after determining the final path;
wherein the path information includes inflection point information of the final path.
6. The cable path planning device is characterized by comprising a path setting module, a shortest path length calculation module, a path searching module and a path length judging module;
the path setting module is configured to acquire search setting parameters of the cable path; the searching setting parameters comprise the remaining channels after the preset channels are removed; the preset channels comprise channels with full volume rate and forbidden channels;
the shortest path length calculation module is configured to calculate the shortest path length of the cable according to the search setting parameters;
the path searching module is configured to perform path searching according to the searching setting parameters to obtain an initial path, and perform choosing and rejecting on each branch path in the initial path according to a preset choosing and rejecting rule to determine a final path;
the path length judging module is configured to acquire the path length of the final path;
when the difference value between the path length and the shortest path length is smaller than or equal to a set value, the final path is used as a cable planning path; wherein, the liquid crystal display device comprises a liquid crystal display device,
the preset trade-off rule comprises at least one of the following:
if the difference value of the two branch path lengths is larger than the preset difference value, selecting a branch path with a shorter path length;
selecting a branch path of an existing cable;
selecting a branch path without layer jump or side jump;
selecting branch paths with few bending points;
selecting a branch path corresponding to a bottom layer bridge or a cable pit support; wherein, the bottom layer bridge is not fully laid with cables;
selecting branch paths with cables of the same model;
when a plurality of rules are included in a preset accepting and rejecting rule, accepting and rejecting all branch paths extending from a current intersection point in the final path according to the arrangement sequence of the plurality of rules;
when a preset accepting and rejecting rule comprises a plurality of rules, sequentially accepting and rejecting all branch paths extending from a current intersection point in the final path according to the arrangement sequence of the plurality of rules, wherein the method comprises the following steps:
when the absolute value of the length difference value of every two branch paths in the branch paths extending from the current intersection point is larger than the preset difference value, selecting a branch path with a longer length, and recording the selected branch path with a longer length and the branch path with a length difference value smaller than the preset difference value into a first branch path group;
selecting a branch path of the laid cable from the first branch path group as a second branch path group; when each branch path in the first branch path group is not provided with a cable, the first branch path group is directly marked as the second branch path group;
discarding branch paths with layer jump or side jump in the second branch path group to obtain a third branch path group;
acquiring the number of bending points of each branch path in the third branch path group, and selecting branch paths with a small number of bending points to obtain a fourth branch path group;
selecting branch paths of the bottom bridge frame which are not fully laid with cables from the fourth branch path group to obtain a fifth branch path group;
selecting branch paths with the same cable model from the fifth branch path group to obtain the final path;
wherein, the value range of the preset difference value is as follows: 150 mm-250 mm.
7. A cable path planning apparatus, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to implement the method of any one of claims 1 to 5 when executing the executable instructions.
8. A non-transitory computer readable storage medium having stored thereon computer program instructions, which when executed by a processor, implement the method of any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911043279.0A CN112749458B (en) | 2019-10-30 | 2019-10-30 | Cable path planning method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911043279.0A CN112749458B (en) | 2019-10-30 | 2019-10-30 | Cable path planning method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112749458A CN112749458A (en) | 2021-05-04 |
| CN112749458B true CN112749458B (en) | 2023-08-25 |
Family
ID=75640368
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911043279.0A Active CN112749458B (en) | 2019-10-30 | 2019-10-30 | Cable path planning method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112749458B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021758A (en) * | 2016-05-26 | 2016-10-12 | 中国能源建设集团广东省电力设计研究院有限公司 | Design method for cable laying and cable laying system |
| CN107818233A (en) * | 2017-11-30 | 2018-03-20 | 中广核工程有限公司 | A kind of nuclear power plant's Design of Cable Layout method for optimizing route and its system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5017142B2 (en) * | 2008-02-21 | 2012-09-05 | 株式会社東芝 | Optimal route search apparatus, method and program |
| US9025469B2 (en) * | 2013-03-15 | 2015-05-05 | Arris Technology, Inc. | Method for estimating cable plant topology |
-
2019
- 2019-10-30 CN CN201911043279.0A patent/CN112749458B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021758A (en) * | 2016-05-26 | 2016-10-12 | 中国能源建设集团广东省电力设计研究院有限公司 | Design method for cable laying and cable laying system |
| CN107818233A (en) * | 2017-11-30 | 2018-03-20 | 中广核工程有限公司 | A kind of nuclear power plant's Design of Cable Layout method for optimizing route and its system |
Non-Patent Citations (1)
| Title |
|---|
| 计算机在电缆敷设设计中的应用——应用计算机寻找最短电缆路径的方法;王静波;《吉林电力技术》;64-68、83 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112749458A (en) | 2021-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2017045578A1 (en) | Topological graph optimal path algorithm with constraint conditions | |
| CN112560204B (en) | Optical network route optimization method based on LSTM deep learning and related device thereof | |
| CN113825046A (en) | Automatic wiring method, device and system for network wiring equipment | |
| CN102210127B (en) | Path calculating method, and calculating apparatus | |
| CN112749458B (en) | Cable path planning method, device, equipment and storage medium | |
| US20040010764A1 (en) | Analog integrated circuit layout design | |
| CN113987995A (en) | Wiring scheme determination method and device, electronic equipment and storage medium | |
| CN112565940A (en) | Optical fiber path planning method and device for optical fiber network | |
| CN110375735B (en) | Path planning method and device | |
| CN114111758A (en) | Map data processing method and device | |
| CN106021296A (en) | Core bank system batch job path detection method and device | |
| CN113408654A (en) | Urban road network fusion method, system and storage medium based on hierarchical merging | |
| CN106034266B (en) | Optical route generation method and device | |
| CN112287438A (en) | Automatic bridge design method for bridge crossing site selection based on backtracking strategy | |
| CN114111815B (en) | Map data processing method and device | |
| CN107248952B (en) | Method and system for determining service alternative route | |
| CN105656029B (en) | A kind of super radius of electricity supply of low-voltage power supply taiwan area load point determines method and device | |
| CN114459492A (en) | Method, device, equipment, storage medium and product for determining recommended route | |
| EP2552157A1 (en) | Method and apparatus for loop path search in mesh network | |
| CN109828894B (en) | Equipment state data acquisition method and device, storage medium and electronic equipment | |
| CN108694506B (en) | Method and device for determining construction demand of power distribution network cable tunnel | |
| CN112600193A (en) | Load evaluation method and device for power distribution network | |
| CN111062180A (en) | FPGA wiring method and device | |
| CN116539056B (en) | Path planning method and device and electronic equipment | |
| KR102156621B1 (en) | Device and method for creating automatic device linear map of GIS |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |