CN105279574B - A kind of satellite cable shortest path planning method based on digraph optimisation technique - Google Patents
A kind of satellite cable shortest path planning method based on digraph optimisation technique Download PDFInfo
- Publication number
- CN105279574B CN105279574B CN201510634057.1A CN201510634057A CN105279574B CN 105279574 B CN105279574 B CN 105279574B CN 201510634057 A CN201510634057 A CN 201510634057A CN 105279574 B CN105279574 B CN 105279574B
- Authority
- CN
- China
- Prior art keywords
- cable
- node
- satellite
- shortest path
- trace
- 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
Abstract
A kind of satellite cable shortest path planning method based on digraph optimisation technique.This method use satellite be laid out in the spatial position of each cable tie node, any two cable tie node connected relation as inputting, form the initial digraph of cable trace, using digraph shortest path first, the shortest path sequence node between cable shortest path distance matrix and any two cable tie node is calculated.The method completes cable length under the design of satellite cable shortest path and shortest path and calculates, it can satisfy cable louding path planning optimization demand in satellite cable design, solving the shortest path method in the method for the present invention, the cable trace obtained is theoretically ensured to be optimal solution, the sampling of actual cable length is carried out using 1:1 satellite platform wooden mold, manually according to cable design path two dimension drawing in the past relatively, reduces design time, ensure that designing quality.
Description
Technical field
The present invention relates to a kind of satellite cable shortest path planning method based on digraph optimisation technique, i.e. one kind is based on
The satellite cable shortest path of digraph optimisation technique determines method, can promote during all satellite cable planning and designing
Using.
Background technique
Satellite cable net as the indispensable important component of electrical system, for realizing whole star electric room,
The electric connection of satellite and ground checkout equipment, satellite and carrier rocket etc., is responsible for power supply and distribution and all kinds of electric signal transmissions are appointed
Business, is satellite " nervous centralis and blood circulation system ".Meanwhile cable system development is a particular job again, it is spanned
The multiple fields such as information, electronics and machinery will also comprehensively consider many-sided constraint such as production, assembly in the design.
In recent years, with the high speed development of design of satellites and manufacturing technology, on-board equipment increasing number, device layout is increasingly
It is compact, cause cable system to move towards narrow space；And power demands and demand signals are increased sharply, and but make cable system complexity continuous
It is promoted.This undoubtedly makes the difficulty of cable system development increasing.Satellite is traditional based on two-dimentional layout design cable trace, wood
Mould samples the cable system design pattern for determining cable length, deeply hinders the raising of cable system Development Level.
Summary of the invention
Present invention solves the technical problem that are as follows: it has overcome the deficiencies of the prior art and provide a kind of based on digraph optimization skill
The satellite cable shortest path planning method of art, this method using satellite layout in each cable tie node spatial position,
The connected relation of any two cable tie node forms the initial digraph of cable trace as input, most short using digraph
Routing algorithm calculates the shortest path node sequence between cable shortest path distance matrix and any two cable tie node
Column.The method completes cable length under the design of satellite cable shortest path and shortest path and calculates, and can satisfy satellite cable
Cable louding path planning optimizes demand in design.
A kind of technical solution that the present invention solves are as follows: satellite cable shortest path planning side based on digraph optimisation technique
Method, steps are as follows:
(1) the spatial position P of each cable tie node in satellite layout is seti(Xi, Yi, Zi), i indicates node ID,
It is satellite and the rocket parting surface center that co-ordinates of satellite system, which is defined as coordinate origin, and X-axis is directed toward satellite flight direction, and Z axis is directed toward the earth's core side
To Y-axis meets the right-hand rule, Xi、Yi、ZiRespectively indicate seat of the cable tie node in X, Y, Z axis under co-ordinates of satellite system
Mark, unit mm, i=1 ... n, n are positive integer
(2) the connected relation P of any two cable tie node in satellite layout is setij, i, j expression node ID, if
Determine PijIt is connected to between=1 No. i-th node of expression and jth node, illustrates that cable louding passes through this path；Set Pij=0 table
Show between No. i-th node and jth node it is disconnected, illustrates that cable louding can not be by this path；J=1 ... n, n are positive whole
Number
(3) according to the P of step (1)i(Xi, Yi, Zi) and step (2) setting Pij, determine the initial digraph N of cable trace,
N is n × n matrix, and n is all number of nodes, i.e. element N in the initial digraph N of cable traceijIs defined as: as i=j,
Nij=0, i.e. serial number i are connected to two nodes of j；As i ≠ j, if the P in step (2)ij=0 sets Nij=+∞,
That is serial number i is not connected to two nodes of j；If the P in step (2)ij=1 Nij=((Xi-Xj)2+(Yi-Yj)2+(Zi-
Zj)2)0.5, (Xj, Yj, Zj) node coordinate of the either element under co-ordinates of satellite system when being i ≠ j in matrix；
(4) according to the initial digraph N of cable trace of step (3)ij, determine cable trace shortest distance matrix S, S be n ×
N matrix, the matrix element in S are Sij, set matrix S initial value in step (3) the initial digraph N of cable trace it is initial
It is worth identical；Matrix element S in SijIs defined as: the arbitrary node of serial number m is taken, until traversing all nodes, works as Sij> Nim+
NmjWhen, Nim+NmjValue assign Sij；Work as Sij≤Nim+NmjWhen, keep SijValue it is constant, m=1 ... n, n are positive integer,
(5) according to step (4) cable trace shortest distance matrix S, any two node i, the shortest path L between j are determinedij's
Steps are as follows:
(a) L is setijFor the set of sequence node, LijIt is initially (i, j)；
(b) k is setpFor the node ID other than I, j, and p ∈ (1, n)；k1∈ (1, n), from k1=1 starts, traversal (1,
N), by SijWith Sik1+Sk1jIt compares, works as Sij=Sik1+Sk1jWhen, LijBecome (i, k1, j), it enters step (c)；Work as k1Traversal (1,
N), Sij≠Sik1+Sk1jWhen, obtain final result LijFor (i, j)；
(c)k2∈ (1, n), from k2=1 starts, and traverses (1, n), by Sik1With Sik2+Sk2k1It compares, works as Sik1=Sik2+
Sk2k1When, LijBecome (i, k2,k1, j), it enters step (d)；Work as k2It traverses (1, n), Sik1≠Sik2+Sk2k1When, most terminated
Fruit LijFor (i, k1,j)；
(d) and so on, kp∈ (1, n), from kp=1 starts, and traverses (1, n), works as Sik(p-1)=Sikp+Skpk(p-1)When, it obtains
To final result LijFor (i, kp,kp-1...k2,k1,j)；Work as kpIt traverses (1, n), Sik(p-1)≠Sikp+Skpk(p-1)When, it obtains final
As a result LijFor (i, kp-1...k2,k1,j)；Finally obtain any two node i, the shortest path L between jij, k1=1 ... n, n are positive
Integer；k2=1 ... n, n are positive integer, kp=1 ... n, n are positive integer.
The advantages of the present invention over the prior art are that:
(1) cable trace planning and designing method of the invention is suitable for all satellite platform cable design processes；
(2) technical solution and existing X-Y scheme of the present invention by the formation initial digraph of cable trace of step (3)
Paper engineer's cable trace technical solution is compared, and cable trace design problem is converted to the graph theoretic problem in mathematics, is utilized
Mathematical method replaces manual method to solve the problems, such as, improves efficiency.
(3) technical solution and existing satellite 1:1 of the present invention by the cable trace shortest distance matrix of step (4)
The artificial cable length sampling of wooden mold is compared, using mathematic calculation instead of manual sampling method, relatively artificial wooden model
Sampling design, eliminates Wooden Pattern Making, reduces human cost, ensure that cable development quality.
(4) technical solution and existing artificial X-Y scheme of the present invention by the cable shortest path sequence node of step (5)
Paper design is compared, and guarantees that the cable trace obtained is theoretically optimal solution using mathematic calculation, relatively artificial X-Y scheme
Paper design, reduces design time, ensure that designing quality；
Detailed description of the invention
Fig. 1 is flow chart of the method for the present invention.
Specific embodiment
Basic ideas of the invention are as follows: a kind of satellite cable shortest path planning side based on digraph optimisation technique is provided
Method uses the spatial position of each cable tie node in satellite layout for satellite cable path design problem this method, appoints
Anticipate two cable tie nodes connected relation as input, formed the initial digraph of cable trace, utilize digraph shortest path
Diameter algorithm calculates the shortest path sequence node between cable shortest path distance matrix and any two cable tie node.
The method completes cable length under the design of satellite cable shortest path and shortest path and calculates, and can satisfy satellite cable design
Middle cable louding path planning optimizes demand, the solving the shortest path method in the method for the present invention, and the cable trace obtained is from reason
By optimal solution is above ensured to be, relatively in the past using 1:1 satellite platform wooden mold, manually according to cable design path two dimension drawing
The sampling of actual cable length is carried out, reduces design time, ensure that designing quality.
The invention will be described in further detail in the following with reference to the drawings and specific embodiments, as shown in Figure 1, a kind of be based on having
To the satellite cable paths planning method of figure optimisation technique, steps are as follows:
(1) the spatial position P of each cable tie node in satellite layout is seti(Xi, Yi, Zi), i indicates node ID,
It is satellite and the rocket parting surface center that co-ordinates of satellite system, which is defined as coordinate origin, and X-axis is directed toward satellite flight direction, and Z axis is directed toward the earth's core side
To Y-axis meets the right-hand rule, Xi、Yi、ZiRespectively indicate seat of the cable tie node in X, Y, Z axis under co-ordinates of satellite system
Mark, unit mm, i=1 ... n, n are positive integer
(2) the connected relation P of any two cable tie node in satellite layout is setij, i, j expression node ID, if
Determine PijIt is connected to between=1 No. i-th node of expression and jth node, illustrates that cable louding passes through this path；Set Pij=0 table
Show between No. i-th node and jth node it is disconnected, illustrates that cable louding can not be by this path；J=1 ... n, n are positive whole
Number
Step (1), the purpose of (2) are the input conditions for providing cable trace design method, including cable tie node
Spatial position and connection relationship.
(3) according to the P of step (1)i(Xi, Yi, Zi) and step (2) setting Pij, determine the initial digraph N of cable trace,
N is n × n matrix, and n is all number of nodes, i.e. element N in the initial digraph N of cable traceijIs defined as: as i=j,
Nij=0, i.e. serial number i are connected to two nodes of j；As i ≠ j, if the P in step (2)ij=0 sets Nij=+∞,
That is serial number i is not connected to two nodes of j；If the P in step (2)ij=1 Nij=((Xi-Xj)2+(Yi-Yj)2+(Zi-
Zj)2)0.5, (Xj, Yj, Zj) node coordinate of the either element under co-ordinates of satellite system when being i ≠ j in matrix；
The purpose of step (3) is initial between reflecting any two cable tie node by the initial digraph of cable trace
Path distance.
It is manually set by the technical solution and existing two-dimentional drawing of the initial digraph of formation cable trace of step (3)
Meter cable trace technical solution is compared, and cable trace design problem is converted to the graph theoretic problem in mathematics, utilizes mathematical method
Cable trace design problem is solved instead of manual method.
(4) according to the initial digraph N of cable trace of step (3)ij, determine cable trace shortest distance matrix S, S be n ×
N matrix, the matrix element in S are Sij, set matrix S initial value in step (3) the initial digraph N of cable trace it is initial
It is worth identical；Matrix element S in SijIs defined as: the arbitrary node of serial number m is taken, until traversing all nodes, works as Sij> Nim+
NmjWhen, Nim+NmjValue assign Sij；Work as Sij≤Nim+NmjWhen, keep SijValue it is constant, m=1 ... n, n are positive integer.
The purpose of step (4) is by ergodic algorithm, and calculated cable trace shortest distance matrix reflects any two
Shortest path distance between cable tie node.
Technical solution and existing satellite 1:1 wooden mold people by the cable trace shortest distance matrix of step (4)
The sampling of work cable length is compared, and using mathematic calculation instead of manual sampling method, relatively artificial wooden model sampling design is taken
Disappeared Wooden Pattern Making, reduce human cost, ensure that cable development quality.
(5) according to step (4) cable trace shortest distance matrix S, any two node i, the shortest path L between j are determinedij's
Steps are as follows:
(a) L is setijFor the set of sequence node, LijIt is initially (i, j)；
(b) k is setpFor the node ID other than I, j, and p ∈ (1, n)；
k1∈ (1, n), from k1=1 starts, and traverses (1, n), that is, traverses 1 and arrive n, work as Sij=Sik1+Sk1jWhen, LijBecome (i,
k1, j), it enters step (c)；Work as k1It traverses (1, n), Sij≠Sik1+Sk1jWhen, obtain final result LijFor (i, j)；
(c)k2∈ (1, n), from k2=1 starts, and traverses (1, n), works as Sik1=Sik2+Sk2k1When, LijBecome (i, k2,k1,
J), enter step (d)；Work as k2It traverses (1, n), Sik1≠Sik2+Sk2k1When, obtain final result LijFor (i, k1,j)；
(d) and so on, kp∈ (1, n), from kp=1 starts, and traverses (1, n), works as Sik(p-1)=Sikp+Skpk(p-1)When, it obtains
To final result LijFor (i, kp,kp-1...k2,k1,j)；Work as kpIt traverses (1, n), Sik(p-1)≠Sikp+Skpk(p-1)When, it obtains final
As a result LijFor (i, kp-1...k2,k1,j)；Finally obtain any two node i, the shortest path L between jij, k1=1 ... n, n are positive
Integer；k2=1 ... n, n are positive integer, kp=1 ... n, n are positive integer；
Since step (4) has obtained the shortest path distance between any two cable tie node, the mesh of step (5)
Be that cable shortest path sequence node between any two cable tie node is calculated by ergodic algorithm.
Pass through the technical solution and existing artificial two-dimentional layout design phase of the cable shortest path sequence node of step (5)
Than guaranteeing that the cable trace obtained is theoretically optimal solution using mathematic calculation, relatively artificial X-Y scheme paper design subtracts
Lack design time, ensure that designing quality；
Below it is specific embodiment:
The spatial position P of all cable junctions in 1 satellite of table layouti(Xi, Yi, Zi) example
The connection relationship P of any two cable tie node in 2 satellite of table layoutijExample
As shown in table 1, table 2, the present invention is based on the satellite cable shortest path planning design method of digraph optimisation technique,
The input parameter being related to mainly includes the spatial position P of each cable tie node in satellite layouti(Xi, Yi, Zi), satellite cloth
The connection relationship P of any two cable tie node in officeij。
The initial digraph N example of 3 cable trace of table
As shown in table 3, according to Pi(Xi, Yi, Zi) and PijObtain the initial digraph N of cable trace.
4 cable trace shortest distance matrix S example of table
As shown in table 4, according to the initial digraph N of cable traceijObtain cable trace shortest distance matrix S.
5 shortest path sequence node L of tableijExample
As shown in table 5, any two node i is obtained according to cable trace shortest distance matrix S, j (for example node 1 is to node
46, node 3 is to node 27, node 4 to node 78) between shortest path sequence node Lij。
As shown in table 5, for example ask node 1 to the shortest path sequence L of node 41,4, L1,4Initiation sequence is (Isosorbide-5-Nitrae), by table
The shortest path distance of node 1 known to 4 to node 4 is 587；By traversal it is found that node 1 arrives the shortest path distance of node 3
Be 402, node 3 to node 4 shortest path distance be 185, the two and be 587；L1,4Sequence becomes (1,3,4)；Equally, by
The shortest path distance of node 1 known to table 4 to node 3 is 402；By traversal it is found that node 1 to node 2 shortest path away from
From being 143, the shortest path distance of node 2 to node 3 is 259, the two and be 402；L1,4Sequence becomes (1,2,3,4)；
Non-elaborated part of the present invention belongs to techniques well known.
Claims (1)
1. a kind of satellite cable shortest path planning method based on digraph optimisation technique, it is characterised in that: the cable trace
Planning and designing method is suitable for all satellite platform cable design processes, and steps are as follows:
(1) the spatial position P of each cable tie node in satellite layout is seti(Xi, Yi, Zi), i indicates node ID, satellite
It is satellite and the rocket parting surface center that coordinate system, which is defined as coordinate origin, and X-axis is directed toward satellite flight direction, and Z axis is directed toward the earth's core direction, Y
Axis meets the right-hand rule, Xi、Yi、ZiCoordinate of the cable tie node in X, Y, Z axis under co-ordinates of satellite system is respectively indicated, it is single
Position is mm, and i=1 ... n, n are positive integer；Node location precision set is millimeter；
(2) the connected relation P of any two cable tie node in satellite layout is setij, i, j indicate node ID, set Pij
It is connected to between=1 No. i-th node of expression and jth node, illustrates that cable louding passes through this path；Set Pij=0 indicates i-th
Number be between node and jth node it is disconnected, illustrate that cable louding can not be by this path；J=1 ... n, n are positive integer；
(3) according to the P of step (1)i(Xi, Yi, Zi) and step (2) setting Pij, determine the initial digraph N of cable trace, N n
× n matrix, n are all number of nodes, i.e. element N in the initial digraph N of cable traceijIs defined as: as i=j, Nij=
0, i.e. serial number i are connected to two nodes of j；As i ≠ j, if the P in step (2)ij=0 sets Nij=+∞, i.e. sequence
It number is not connected to two nodes of j for i；If the P in step (2)ij=1 Nij=((Xi-Xj)2+(Yi-Yj)2+(Zi-Zj)2)0.5,
(Xj, Yj, Zj) node coordinate of the either element under co-ordinates of satellite system when being i ≠ j in matrix；Step (3) is by cable road
Initial path distance between the initial digraph reflection any two cable tie node of diameter；Pass through the formation cable road of step (3)
The initial digraph of diameter is compared with existing two-dimentional drawing engineer's cable trace technical solution, by cable trace design problem
The graph theoretic problem in mathematics is converted to, replaces manual method to solve cable trace design problem using mathematical method；
(4) according to the initial digraph N of cable trace of step (3)ij, determine that cable trace shortest distance matrix S, S are n × n square
Gust, the matrix element in S is Sij, set the initial value of the initial digraph N of cable trace in the initial value and step (3) of matrix S
It is identical；Matrix element S in SijIs defined as: the arbitrary node of serial number m is taken, until traversing all nodes, works as Sij> Nim+Nmj
When, Nim+NmjValue assign Sij；Work as Sij≤Nim+NmjWhen, keep SijValue it is constant, m=1 ... n, n are positive integer ,=step (4)
The shortest path distance between any two cable tie node is obtained；Step (4) by ergodic algorithm, it is calculated
Cable trace shortest distance matrix reflects the shortest path distance between any two cable tie node；Pass through the electricity of step (4)
Cable path shortest distance matrix is compared with the artificial cable length sampling of existing satellite 1:1 wooden mold, utilizes mathematical computations side
Method eliminates Wooden Pattern Making, reduces human cost, guarantees instead of manual sampling method, relatively artificial wooden model sampling design
Cable development quality；
(5) according to step (4) cable trace shortest distance matrix S, any two node i, the shortest path L between j are determinedij, pass through
Traversal, calculates any two cable tie node PiTo node PjDrum length of cable be Lij, step (5) is by traversing calculation
Method calculates cable shortest path sequence node between any two cable tie node, passes through the cable shortest path of step (5)
The scheme of sequence node show that cable trace is theoretically optimal solution using mathematic calculation；Pass through the electricity of step (5)
The technical solution of cable shortest path sequence node is compared with existing artificial two-dimentional layout design, is guaranteed using mathematic calculation
The cable trace obtained is theoretically optimal solution, and relatively artificial X-Y scheme paper design reduces design time, ensure that design
Quality；
The step (5) determines any two node i, the shortest path between j according to step (4) cable trace shortest distance matrix S
LijThe step of it is as follows:
(a) L is setijFor the set of sequence node, LijIt is initially (i, j)；
(b) k is setpFor the node ID other than i, j, and p ∈ (1, n)；k1∈ (1, n), from k1=1 starts, and traverses (1, n), will
SijWith Sik1+Sk1jIt compares, works as Sij=Sik1+Sk1jWhen, LijBecome (i, k1, j), it enters step (c)；Work as k1It traverses (1, n),
Sij≠Sik1+Sk1jWhen, obtain final result LijFor (i, j)；
(c)k2∈ (1, n), from k2=1 starts, and traverses (1, n), by Sik1With Sik2+Sk2k1It compares, works as Sik1=Sik2+Sk2k1When,
LijBecome (i, k2,k1, j), it enters step (d)；Work as k2It traverses (1, n), Sik1≠Sik2+Sk2k1When, obtain final result LijFor
(i,k1,j)；
(d) and so on, kp∈ (1, n), from kp=1 starts, and traverses (1, n), works as Sik(p-1)=Sikp+Skpk(p-1)When, it obtains most
Terminate fruit LijFor (i, kp,kp-1...k2,k1,j)；Work as kpIt traverses (1, n), Sik(p-1)≠Sikp+Skpk(p-1)When, obtain final result
LijFor (i, kp-1...k2,k1,j)；Finally obtain any two node i, the shortest path L between jij, k1=1 ... n, n are positive integer；
k2=1 ... n, n are positive integer, kp=1 ... n, n are positive integer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510634057.1A CN105279574B (en) | 2015-09-29 | 2015-09-29 | A kind of satellite cable shortest path planning method based on digraph optimisation technique |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510634057.1A CN105279574B (en) | 2015-09-29 | 2015-09-29 | A kind of satellite cable shortest path planning method based on digraph optimisation technique |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105279574A CN105279574A (en) | 2016-01-27 |
| CN105279574B true CN105279574B (en) | 2019-10-22 |
Family
ID=55148550
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510634057.1A Active CN105279574B (en) | 2015-09-29 | 2015-09-29 | A kind of satellite cable shortest path planning method based on digraph optimisation technique |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105279574B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108256156B (en) * | 2017-12-20 | 2021-07-13 | 中国空间技术研究院 | Automatic design method for three-dimensional grounding of satellite instrument equipment |
| CN112906168B (en) * | 2019-11-19 | 2023-09-19 | 北京博超时代软件有限公司 | Cable arrangement calculation method, device, equipment and storage medium |
| CN111046488B (en) * | 2019-11-25 | 2023-07-25 | 北京空间技术研制试验中心 | Three-dimensional wiring method for spacecraft cable |
| CN113268837B (en) * | 2021-04-12 | 2022-06-14 | 中国电建集团华东勘测设计研究院有限公司 | Cable path optimizing method adopting C4.5 decision tree algorithm |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102156776A (en) * | 2011-04-08 | 2011-08-17 | 中国核电工程有限公司 | Method for establishing cable bridge network by using relational database |
| CN102280826A (en) * | 2011-07-30 | 2011-12-14 | 山东鲁能智能技术有限公司 | Intelligent robot inspection system and intelligent robot inspection method for transformer station |
| CN103176089A (en) * | 2013-03-18 | 2013-06-26 | 北京航空航天大学 | Weak electromagnetic coupling path determining method |
| CN103427371A (en) * | 2013-08-16 | 2013-12-04 | 中冶南方工程技术有限公司 | Intelligent cable path optimizing method |
-
2015
- 2015-09-29 CN CN201510634057.1A patent/CN105279574B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102156776A (en) * | 2011-04-08 | 2011-08-17 | 中国核电工程有限公司 | Method for establishing cable bridge network by using relational database |
| CN102280826A (en) * | 2011-07-30 | 2011-12-14 | 山东鲁能智能技术有限公司 | Intelligent robot inspection system and intelligent robot inspection method for transformer station |
| CN103176089A (en) * | 2013-03-18 | 2013-06-26 | 北京航空航天大学 | Weak electromagnetic coupling path determining method |
| CN103427371A (en) * | 2013-08-16 | 2013-12-04 | 中冶南方工程技术有限公司 | Intelligent cable path optimizing method |
Non-Patent Citations (4)
| Title |
|---|
| 《基于GIS的电力电缆管网系统实现与关键技术研究》;张宇;《中国优秀硕士学位论文全文数据库 基础科学辑》;20070115;第A008-3页 * |
| 《电缆布设计算机辅助设计系统研究》;陈江义等;《郑州大学学报（工学版）》;20030630;第24卷(第2期);第77-79页 * |
| 《移动卫星网络中的最短路径算法研究》;张涛等;《计算机工程》;20060430;第32卷(第8期);第29-31页 * |
| 《计算机在电缆敷设设计中的应用——应用计算机寻找最短电缆路径的方法》;王静波;《吉林电力技术》;19861227;第64-68、83页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105279574A (en) | 2016-01-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105279574B (en) | A kind of satellite cable shortest path planning method based on digraph optimisation technique | |
| CN110442996B (en) | Intelligent entity cable laying method based on PDMS platform | |
| CN106570301B (en) | Satellite distributed collaborative design method based on three-dimensional environment | |
| CN106528740A (en) | Delaunay triangular net-based road center line extraction method | |
| CN106423657B (en) | A kind of thermal spraying robot path planning method and system based on index curve | |
| CN109815540B (en) | Datum line layout method for space curve component | |
| KR102255052B1 (en) | Via placement within an integrated circuit | |
| CN105027504B (en) | Programmable physical network topology for data center | |
| CN104239610A (en) | Three-dimensional wiring design method of helicopter comprehensive testbed | |
| CN104268319A (en) | Three-dimensional marking method of satellite cable | |
| CN102841953B (en) | Method for designing integrated circuit layout based on macro | |
| CN107563023A (en) | A kind of nuclear power plant's three-dimensional Design of Cable Layout system and method | |
| CN106203812A (en) | The industrialized data processing method of building decoration, Apparatus and system | |
| CN106372309A (en) | Electric power tunnel digital laying method and system based on GIS (geographic information system) and BIM (building information modeling) | |
| CN107292055B (en) | Method for assisting PCB design by establishing mathematical geometric model | |
| CN104866613A (en) | Method for establishing three-dimensional component model database of power grid equipment and facility | |
| CN105975768A (en) | Method and apparatus for arranging buried pipeline in sectional insulation manner | |
| CN107391795A (en) | Across the CAD platform device collaboration layout method of Complex Spacecraft based on XML | |
| CN103488816A (en) | Multi-layer precise matching wiring method for simulation circuit | |
| CN110196569A (en) | Machining system with optimal path | |
| CN103258300A (en) | Method for designing cable bridge in cable passage of thermal power plant | |
| CN103399988A (en) | Sample plate and method using same to simulate installation condition of aircraft wire harnesses | |
| CN108416121B (en) | A kind of spacecraft cable system three-dimensional design method | |
| CN105138750A (en) | Scalable multi-line crossing machine body wireframe model building method | |
| CN107665284A (en) | A kind of aircraft assembly fixture skeleton Optimal Deployment Method based on least square method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |