CN111046488B - Three-dimensional wiring method for spacecraft cable - Google Patents
Three-dimensional wiring method for spacecraft cable Download PDFInfo
- Publication number
- CN111046488B CN111046488B CN201911167328.1A CN201911167328A CN111046488B CN 111046488 B CN111046488 B CN 111046488B CN 201911167328 A CN201911167328 A CN 201911167328A CN 111046488 B CN111046488 B CN 111046488B
- Authority
- CN
- China
- Prior art keywords
- path
- cable
- spacecraft
- undirected graph
- optimal path
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Computer Graphics (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The invention relates to a three-dimensional wiring method of a spacecraft cable, which comprises the following steps: a. according to the shape structure of a single product on the spacecraft, a main channel of a wiring system is arranged; b. extracting the characteristic position of the main channel and creating a cable path; c. and creating a routing optimal path algorithm based on the undirected graph, and acquiring an optimal path of the cable network path for routing. According to the three-dimensional wiring method for the spacecraft cable, disclosed by the invention, the shortest-path cable wiring can be realized, the design efficiency is improved, and the weight of the spacecraft cable is saved. Aiming at key links influencing the design quality and efficiency in the cable network wiring design process, a set of novel manned spacecraft cable network three-dimensional wiring design method based on intelligent algorithm is formed.
Description
Technical Field
The invention relates to the field of spacecraft design, in particular to a three-dimensional wiring method for a spacecraft cable.
Background
With the increasing development of the aerospace technology in China and the increasing of the scale and the equipment number of spacecrafts, the system and the scale of the novel cable network are unprecedented complex and huge. Meanwhile, with the continuous development of information technology, engineering design means are gradually changed, and the engineering design means are gradually changed from mechanical repeated design to automatic design and from traditional two-dimensional plane design to three-dimensional digital platform design. The cable is taken as an important component of modern industrial products, and the design efficiency and the correctness can be obviously improved by means of the existing three-dimensional modeling software. However, the functions of the existing engineering three-dimensional modeling software system in the aspect of cable design are not completely mature, and the specific design requirements of various enterprises are difficult to meet, so that the cable three-dimensional design process still needs a large workload, and even becomes a short board of a production period. At present, the main problems of three-dimensional cable design are that the design process depends on manual operation too much, top layer design and planning of wiring are lacking, secondary development is needed for an intelligent wiring algorithm, and the like, so that development of an automatic technology suitable for three-dimensional cable wiring of a complex spacecraft is needed.
Disclosure of Invention
The invention aims to solve the problems and provide a three-dimensional wiring method for a spacecraft cable.
In order to achieve the above object, the present invention provides a three-dimensional wiring method for a spacecraft cable, comprising the steps of:
a. according to the shape structure of a single product on the spacecraft, a main channel of a wiring system is arranged;
b. extracting the characteristic position of the main channel and creating a cable path;
c. and creating a routing optimal path algorithm based on the undirected graph, and acquiring an optimal path of the cable network path for routing.
According to one aspect of the invention, a netlike channel structure is intensively established in a spacecraft cabin and an out-cabin single-machine product dense area while the main channel is arranged, an auxiliary path matched wiring is arranged in an area with relatively low single-machine product density, and a sufficient space is reserved when the channel structure is established.
According to one aspect of the present invention, in the step c, a main channel network path point nearest to the start end and the end of the cable path is searched as a network access point through a network access point conversion algorithm, so that the cable optimal path problem is converted into a cable network optimal path problem.
According to one aspect of the invention, the cable network path is converted into an undirected graph, and the cable network optimal path problem is further converted into an optimal path problem of the undirected graph.
According to one aspect of the invention, all paths of the undirected graph are traversed, the path length is taken as the weight of an edge, the sum of the weights of all edges on one path is taken as the cost function value of the path, and the path cost function values of all connected start vertexes and end vertexes are compared, so that an optimal path with the minimum cost function value is obtained.
According to one aspect of the present invention, in traversing the undirected graph for an optimal path, it is determined whether each path from the start vertex to the end vertex forms a closed loop with the path of the routed completion cable, and if a closed loop exists, the path is discarded.
According to one aspect of the invention, the optimal path algorithm of the undirected graph adopts a path discarding algorithm to optimize the undirected graph, if the cost function value of the current path is larger than the cost function value of the current known optimal path, the path is directly discarded without traversing the subsequent vertexes, and the undirected graph is retracted to the previous vertexes to continuously traverse other non-traversed paths.
According to one aspect of the invention, the undirected graph optimal path algorithm optimizes the undirected graph optimal path algorithm by adopting a target direction rapid path finding algorithm, if a plurality of traversable subsequent paths exist in the current vertex, the subsequent paths consistent with the direction of the termination vertex are preferentially traversed, and after the optimal paths are obtained through the undirected graph optimal path algorithm, wiring is carried out according to the relationship between the undirected graph and the cable network.
According to the three-dimensional wiring method for the spacecraft cable, disclosed by the invention, the shortest-path cable wiring can be realized, the design efficiency is improved, and the weight of the spacecraft cable is saved. Aiming at key links influencing the design quality and efficiency in the cable network wiring design process, a set of novel manned spacecraft cable network three-dimensional wiring design method based on intelligent algorithm is formed.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 schematically shows a flow chart of a method for three-dimensional cabling of a spacecraft cable according to the invention;
FIG. 2 schematically illustrates a schematic diagram of a best path algorithm according to one embodiment of the invention;
FIG. 3 is a cable path diagram;
FIG. 4 is a schematic diagram of converting a cable network optimal path to an undirected graph optimal path;
FIGS. 5 and 6 are schematic diagrams of a depth traversal process;
FIG. 7 is an undirected graph with a closed loop path;
FIG. 8 is an undirected graph eliminating a closed loop path;
FIG. 9 is an undirected graph of optimal paths;
FIG. 10 is an undirected graph of reject paths;
FIG. 11 is a diagram of the cable network three-dimensional aided design software module;
FIGS. 12-14 are cable network automatic wiring design module interface diagrams;
FIG. 15 is a table of cable branch lengths;
fig. 16 is a cable breakout length diagram.
Detailed Description
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required to be used in the embodiments will be briefly described below. It is apparent that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art.
In describing embodiments of the present invention, the terms "longitudinal," "transverse," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," "outer," and the like are used in terms of orientation or positional relationship shown in the drawings for convenience of description and simplicity of description only, and do not denote or imply that the devices or elements in question must have a particular orientation, be constructed and operated in a particular orientation, so that the above terms are not to be construed as limiting the invention.
The present invention will be described in detail below with reference to the drawings and the specific embodiments, which are not described in detail herein, but the embodiments of the present invention are not limited to the following embodiments.
Fig. 1 schematically shows a flow chart of a method for three-dimensional cabling of a spacecraft cable according to the invention. As shown in fig. 1, the three-dimensional wiring method of the spacecraft cable according to the invention comprises the following steps:
a. according to the shape structure of a single product on the spacecraft, a main channel of a wiring system is arranged;
b. extracting the characteristic position of the main channel and creating a cable path;
c. and creating a routing optimal path algorithm based on the undirected graph, and acquiring an optimal path of the cable network path for routing.
According to one embodiment of the present invention, in the step a, the main channel of the wiring system is laid out according to the shape and structure of the stand-alone product on the spacecraft.
Because the main channel is the basis of the comprehensive wiring system, the path of the main channel depends on the shape structure of a single product on the spacecraft. The main channel structure size and the laying condition need to be combined with the overall planning of the spacecraft.
In the embodiment, a net-shaped channel structure is intensively established in a dense area inside and outside a spacecraft cabin, so that the penetrability of the channel is improved, and the cable laying is flexible. The area of relatively low equipment density is provided with auxiliary paths to match the wiring. And in consideration of subsequent modification and optimization, sufficient space is left on channel construction.
According to one embodiment of the invention, after the main channel design is completed, the feature location information may be extracted and a cable path created.
Fig. 2 schematically shows a schematic diagram of a best path algorithm according to an embodiment of the invention. The above step c is further described below in conjunction with fig. 2:
as shown in fig. 2, a main channel network path point nearest to a start end and a stop end of a cable path is searched as a network access point through a network access point conversion algorithm, so that a cable optimal path problem is converted into a cable network optimal path problem. The cable path is composed of end points and intermediate points, as shown in fig. 3.
In this embodiment, the cable network path is very similar to the undirected graph, and the cable network is converted into the undirected graph, so that the network optimal path problem is converted into the optimal path problem of the undirected graph, as shown in fig. 4.
And then traversing all paths of the undirected graph by depth priority, taking the path length as the weight of an edge, taking the sum of the weights of all edges on one path as the cost function value of the path, and comparing the path cost function values of all connected initial vertexes and end vertexes to obtain an optimal path with the minimum cost function value, as shown in fig. 5 and 6. First, the nearest a is accessed from the start point and marked as accessed, then B for each neighboring a is searched in turn, and if B is not accessed, then the depth-first search is continued with B as a new start point until the map and all source a paths connected to the vertices have been accessed so far.
Due to the practical need for cabling, new cables do not allow for a closed loop to be formed between the cable and the cable that has been routed during the routing process. Therefore, in traversing the undirected graph for an optimal path, it is necessary to determine whether each path from the start vertex to the end vertex forms a closed loop with the path of the routed completion cable. If a closed loop is present, the path is discarded. As shown in fig. 7, path No. 1 forms a closed loop with the already existing path No. 2 in fig. 7, so the path No. 1 in fig. 8 must be substituted.
In order to improve wiring efficiency, the optimal path algorithm of the undirected graph adopts a path discarding algorithm to optimize the undirected graph, if the cost function value of the current path (the end point is not reached) is larger than the cost function value of the current known optimal path (the end point is reached), the path is directly discarded without traversing subsequent vertexes, and the undirected path is continuously traversed from the last vertex. The path discarding algorithm can avoid the undirected graph optimal path algorithm from going deep into obviously unreasonable path branches, thereby reducing the number of paths which the algorithm needs to traverse and shortening the time required by traversal. As shown in fig. 9 and 10, the current optimal path weight is fig. 9, and the final path weight in fig. 10 is too large to be discarded.
In order to quickly find a better path connecting the initial vertex and the final vertex in the depth traversal, the undirected graph optimal path algorithm adopts a target direction quick path-finding algorithm to optimize the undirected graph optimal path algorithm: if a plurality of traversable subsequent paths exist in the current vertex, preferentially traversing the subsequent paths consistent with the direction of the termination vertex. And after the optimal path is obtained through the undirected graph optimal path algorithm, wiring can be performed according to the relationship between the undirected graph and the cable network.
The following describes how the above-described method of the present invention can be implemented in a specific embodiment.
FIG. 11 is a diagram of the cable network three-dimensional aided design software module; FIGS. 12-14 are cable network automatic wiring design module interface diagrams; FIG. 15 is a table of cable branch lengths; fig. 16 is a cable breakout length diagram.
As shown in connection with fig. 11-16, the software core is an intelligent wiring algorithm. The algorithm adopts a plurality of algorithms to comprehensively calculate the optimal path, and completes intelligent cable wiring by means of a secondary development function. The software design builds a three-dimensional wiring operation platform based on PRO/E, a Pro/TOOLKIT secondary development technology is utilized, a dynamic link library file which can be executed by the Pro/E is generated through a Visual C++ development environment, and automatic cable model creation is realized through quick generation of a Pro/E cable wiring relation file (nwf). The software basic module comprises: the system comprises a cable connection relation table importing module, an electric connector plug automatic assembling module, a cable rapid wiring design module and a branch length exporting module.
The software may implement the following functions:
1. the cable connection relation table (EXCEL format table) is imported into Pro/E software;
2. realizing automatic assembly and appointed functions of the plug based on an automatic assembly technology;
3. automatically creating and generating a cable network three-dimensional model with correct connection relation, color meeting the specification requirement and consistent diameter and quality characteristics with the real object by using a data table;
4. the cable network three-dimensional aided design software interface is developed through an MFC and integrated into the PRO/E to form a software interaction interface unified with the PRO/E style.
5. The method for drawing the cable branch diagram by utilizing Graphviz software can be directly used for factory setting.
According to the three-dimensional wiring method for the spacecraft cable, disclosed by the invention, the shortest-path cable wiring can be realized, the design efficiency is improved, and the weight of the spacecraft cable is saved. Aiming at key links influencing the design quality and efficiency in the cable network wiring design process, a set of novel manned spacecraft cable network three-dimensional wiring design method based on intelligent algorithm is formed.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (6)
1. A three-dimensional wiring method of a spacecraft cable comprises the following steps:
a. according to the shape structure of a single product on the spacecraft, a main channel of a wiring system is arranged;
b. extracting the characteristic position of the main channel and creating a cable path;
c. based on the undirected graph, creating a routing optimal path algorithm, and acquiring an optimal path of the cable network path for routing;
when the main channel is arranged, a netlike channel structure is intensively established in a spacecraft cabin and an outside single-machine product dense area, an auxiliary path is arranged in an area with relatively low single-machine product density to be matched with wiring, and meanwhile, a sufficient space is reserved when the channel structure is established;
in the step c, a main channel network path point closest to the beginning end and the ending end of the cable path is searched for as a network access point through a network access point conversion algorithm, so that the problem of the optimal path of the cable is converted into the problem of the optimal path of the cable network.
2. The spacecraft cable three-dimensional routing method of claim 1, wherein cable network paths are converted into undirected graphs, and further wherein cable network optimal path problems are converted into undirected graph optimal path problems.
3. The three-dimensional routing method of the spacecraft cable according to claim 2, wherein all paths of the undirected graph are traversed, the path length is taken as a weight of an edge, the sum of weights of all edges on one path is taken as a cost function value of the path, and path cost function values of all connected start vertexes and end vertexes are compared, so that an optimal path with the minimum cost function value is obtained.
4. A method of three-dimensional routing of spacecraft cables according to claim 3, wherein in traversing the undirected graph for optimal paths, it is determined whether each path from the start vertex to the end vertex forms a closed loop with the path of the routed cable, and if a closed loop exists, the path is discarded.
5. The three-dimensional routing method of the spacecraft cable according to claim 4, wherein an optimal path algorithm of the undirected graph optimizes itself by adopting a path rejection algorithm, and if a cost function value of a current traversed path is larger than a currently known optimal path cost function value, a subsequent vertex is not required to be traversed, the path is directly rejected, and a previous vertex is backed up to continue to traverse other non-traversed paths.
6. The three-dimensional wiring method of the spacecraft cable according to claim 5, wherein an undirected graph optimal path algorithm optimizes the undirected graph optimal path algorithm by adopting a target direction fast path finding algorithm, if a plurality of traversable subsequent paths exist in the current vertex, preferentially traversing the subsequent paths consistent with the direction of the termination vertex, and after the optimal path is obtained through the undirected graph optimal path algorithm, wiring is performed according to the relation between the undirected graph and the cable network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911167328.1A CN111046488B (en) | 2019-11-25 | 2019-11-25 | Three-dimensional wiring method for spacecraft cable |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911167328.1A CN111046488B (en) | 2019-11-25 | 2019-11-25 | Three-dimensional wiring method for spacecraft cable |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111046488A CN111046488A (en) | 2020-04-21 |
| CN111046488B true CN111046488B (en) | 2023-07-25 |
Family
ID=70233312
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911167328.1A Active CN111046488B (en) | 2019-11-25 | 2019-11-25 | Three-dimensional wiring method for spacecraft cable |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111046488B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112434445B (en) * | 2020-12-11 | 2024-02-09 | 北京空间机电研究所 | Three-dimensional wiring design method for space optical remote sensor |
| CN113722816A (en) * | 2021-07-28 | 2021-11-30 | 中国空间技术研究院 | Autonomous optimization design method for spacecraft cable network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH11250108A (en) * | 1998-02-26 | 1999-09-17 | Mitsubishi Electric Corp | Layout design supporting device and its method |
| CN105279574A (en) * | 2015-09-29 | 2016-01-27 | 中国空间技术研究院 | Satellite cable shortest path planning method based on digraph optimization technology |
| CN107967373A (en) * | 2017-05-31 | 2018-04-27 | 北京空间技术研制试验中心 | Spacecraft cable system three-dimensional design system and method |
| CN110442992A (en) * | 2019-08-12 | 2019-11-12 | 北京机械设备研究所 | A kind of electromechanical collaborative design method and device of aerospace system cable system |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR2868573B1 (en) * | 2004-04-02 | 2006-06-23 | Airbus France Sas | METHOD FOR OPTIMIZING AN ELECTRICAL WIRING, IN PARTICULAR IN THE AERONAUTICAL FIELD |
| CN105590002B (en) * | 2015-12-31 | 2019-01-25 | 北京理工大学 | A kind of breakout cable autoplacement method and device |
| CN108416121B (en) * | 2018-02-12 | 2019-04-12 | 北京空间技术研制试验中心 | A kind of spacecraft cable system three-dimensional design method |
-
2019
- 2019-11-25 CN CN201911167328.1A patent/CN111046488B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH11250108A (en) * | 1998-02-26 | 1999-09-17 | Mitsubishi Electric Corp | Layout design supporting device and its method |
| CN105279574A (en) * | 2015-09-29 | 2016-01-27 | 中国空间技术研究院 | Satellite cable shortest path planning method based on digraph optimization technology |
| CN107967373A (en) * | 2017-05-31 | 2018-04-27 | 北京空间技术研制试验中心 | Spacecraft cable system three-dimensional design system and method |
| CN110442992A (en) * | 2019-08-12 | 2019-11-12 | 北京机械设备研究所 | A kind of electromechanical collaborative design method and device of aerospace system cable system |
Non-Patent Citations (2)
| Title |
|---|
| VLSI积木块布图设计的通道划分和总体布线;章勇，丁秋林;计算机应用研究(06);全文 * |
| 航天器电缆网快速协同设计方法及关键技术;康焱;刘刚;张柏楠;王倩;谷巍;王威;;航空学报(第07期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111046488A (en) | 2020-04-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110401145B (en) | Cable laying method | |
| CN108875177B (en) | Method for creating inland waterway dredging graph under single beam measuring point based on BIM model | |
| CN111046488B (en) | Three-dimensional wiring method for spacecraft cable | |
| CN110442996B (en) | Intelligent entity cable laying method based on PDMS platform | |
| CN110880717B (en) | Automatic cable laying method based on equipment and bridge positioning digitization | |
| CN106776963A (en) | The light-weighted online method for visualizing of BIM big datas and system | |
| CN104063894A (en) | Point cloud three-dimensional model reestablishing method and system | |
| CN104133943A (en) | Distribution network pattern automatic generating method based on target guide | |
| CN110688701B (en) | Dynamo-based tunnel structure model modeling method | |
| CN110188150A (en) | The modeling method and computer readable storage medium of distribution network line figure | |
| CN108256218B (en) | Underground communication roadway fine modeling method based on actually measured waist line data | |
| CN109376586A (en) | Lane boundary line interactive mode extraction method based on laser point cloud | |
| CN104361185A (en) | Wire distribution space automatic generating method for cable virtual design | |
| CN113312778A (en) | Unstructured grid generation method adaptive to model geometric characteristics | |
| CN107908899B (en) | Line selection system and line selection method for construction road of wind power plant | |
| CN113361002A (en) | Ship cable laying design method and system based on AM software | |
| CN115455512A (en) | Three-dimensional geological model two-dimensional plotting method based on 3DE platform | |
| CN111815016A (en) | Power transmission line path optimization method and computer program product | |
| CN113420359B (en) | Method for automatically transmitting parameters to well placement based on REVIT (remote visual inspection) electric power engineering general diagram | |
| CN107818233A (en) | A kind of nuclear power plant's Design of Cable Layout method for optimizing route and its system | |
| CN109460564B (en) | Power grid tidal current graph wiring method | |
| CN114547716A (en) | Multi-degree-of-freedom 3D printing curved surface slice and path planning method | |
| CN108416121B (en) | A kind of spacecraft cable system three-dimensional design method | |
| CN117422041A (en) | Training method for automatic wiring model of analog chip and automatic wiring method | |
| CN110503727B (en) | Batch rapid splicing method for CAD arbitrary multi-section lines |
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 |