Communication satellite cable network automatic routing method, system, storage medium and electronic device
By constructing an undirected graph network and using algorithms to automatically generate cable path tables, the problem of low efficiency in satellite cable network design is solved, achieving fast, regular, and optimized cable paths, which is applicable to various satellite platforms.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- CHINA ACADEMY OF SPACE TECHNOLOGY
- Filing Date
- 2026-03-05
- Publication Date
- 2026-07-10
AI Technical Summary
Existing satellite cable networks are inefficient in design, requiring separate configuration of preset paths for different satellite platforms, which is time-consuming and labor-intensive, and the improvement in cable design efficiency is not significant.
This paper provides an automatic routing method for communication satellite cable networks. By reading the information of connectors, supports and penetration rings in the satellite's 3D model, an undirected graph network is constructed, and the minimum spanning tree algorithm or the shortest path algorithm is used to automatically generate the cable route table, replacing manual design.
It significantly saves designers' time, generates short and lightweight cable paths, greatly improves design efficiency, is applicable to most types of communication satellites, and reduces the workload of later adjustments.
Smart Images

Figure CN122365776A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of satellite design technology, and in particular to an automatic routing method, system, storage medium, and electronic device for communication satellite cable networks. Background Technology
[0002] Three-dimensional cable routing design is one of the key steps affecting the development progress of spacecraft. High-orbit communication satellites have high customization requirements. Most existing satellite structures adopt a modular design, divided into a propulsion and service module and a payload module. The payload module generally uses a panel structure, with a "∏" shape, including north and south panels, north and south partitions, a load-bearing cylinder top plate, and a floor, etc., as shown in the attached diagram. Figure 1 As shown.
[0003] Currently, designers utilize 3D models to design cable network routes. A cable network consists of several physically inseparable cable bundles, each bundle containing multiple cable branches. Each branch includes two connectors and the connecting cables. Equipment and supports are mounted on the deck. Connectors are inserted into the equipment, while the supports, including nylon bases and T-shaped brackets, are used to secure the cables and serve as control points for the cable route. The number and location of equipment and control points are designed and created as a 3D model before the cable network design begins. During the cable network design process, the designer, based on the connection relationships, selects the connectors at the beginning and end of each cable bundle and the sequence of control points to form the cable network route. This route can then be represented using the ordered 3D coordinates of the points.
[0004] Satellite cable networks are large in scale, containing a large number of connectors and branches. Although existing design patterns have introduced the function of automatic path generation, they require separate configuration of the search range of preset paths for different satellite platforms, which is time-consuming and labor-intensive, and the improvement in cable design efficiency is not significant. Summary of the Invention
[0005] To address the problems of existing technologies, this invention proposes an automatic routing method, system, storage medium, and electronic device for communication satellite cable networks. This method solves the problem of low efficiency in constructing preset cable paths and can quickly generate 3D cable models that meet basic design requirements, significantly saving designers' time.
[0006] To achieve the above-mentioned technical effects, on the one hand, the present invention provides an automatic routing method for communication satellite cable networks, comprising: The automatic construction steps of the cable path preset network are as follows: read the type identification and position information of connectors, supports and ferrules in the satellite 3D model, and construct an undirected graph consisting of nodes and edges connecting the nodes as the preset network based on the positional relationship of the supports and ferrules and the interference check results; wherein, the nodes in the preset network include support nodes, ferrule nodes, connector nodes and the straight section control points of the connectors; Automatic cable path acquisition steps: Based on the number of connectors involved in the cable to be routed, the minimum spanning tree algorithm or the shortest path algorithm is automatically selected, and then calculations are performed based on the preset network to generate a cable path table connecting all related connectors.
[0007] Furthermore, the automatic construction step of the cable path preset network specifically includes: a) Determine if a cache file containing preset network information exists. If it exists, read it and execute step (e) directly; otherwise, execute step (b). b) Read the type identifiers and location information of all support components in the satellite 3D model, and construct an initial undirected graph network based on the 3D straight-line distance between the support components; wherein, if the straight-line distance between two support component nodes is greater than a first preset distance threshold, or if the straight-line segment of the two supports interferes with the cabin or instrument equipment, then delete the edge between the two support component nodes. c) Read the type identifier and location information of the transom ring, and add the target transom ring that meets the preset conditions as a node to the undirected graph network; the preset conditions are: the three-dimensional straight-line distance between the transom ring and at least one support node is less than the second preset distance threshold and the straight-line segments of the two do not interfere with the cabin plate or instruments and equipment. d) Serialize and save the type identifiers and location information of the undirected graph network, the support member, and the transom ring as a cache file; e) Read the names and locations of all connectors involved in the current cable to be routed from the satellite 3D model; for each connector read, generate a straight section control point at a given location in its outgoing direction, select the support node that is closest to the straight section control point and has no path interference, and add the connector node, the corresponding straight section control point node, and the edge connecting the two to the undirected graph network to form the final preset network.
[0008] Furthermore, in step (c), when the target through-cabin ring is added to the undirected graph network, a penalty factor is added to the weight of the edge connecting the support node and the through-cabin ring node.
[0009] Furthermore, the step of automatically selecting either the minimum spanning tree algorithm or the shortest path algorithm based on the number of connectors involved in the cable to be routed specifically includes: When the number of connectors involved in the cable to be routed is less than a preset threshold, the cable path table is obtained using an algorithm based on minimum spanning tree. When the number of connectors involved in the cable to be routed is greater than or equal to the preset number threshold, the cable path table is obtained by using an algorithm based on the shortest path.
[0010] Furthermore, the algorithm for obtaining the cable path table based on the minimum spanning tree specifically includes: Construct a first subgraph, in which the nodes are all the connector nodes to be connected, and the edges are the shortest path distance between two of the connector nodes in the preset network. Find the first minimum spanning tree of the first subgraph; Based on the first minimum spanning tree, a second subgraph of the preset network is constructed; wherein, the second subgraph is composed of all nodes on the shortest path corresponding to each edge in the first minimum spanning tree; Find the second minimum spanning tree of the second subgraph; Prune the second minimum spanning tree by deleting nodes with a degree of 1 that are not connector nodes and their connected edges to obtain the resulting graph. Convert the resulting diagram into a cable path table in a specified format.
[0011] Furthermore, the algorithm for obtaining the cable path table based on the shortest path specifically includes: Calculate the shortest path distance between all the connectors to be connected in the preset network, select the two connectors with the longest distance and the shortest path between them as the initial path and add them to the path table; For each of the remaining connectors to be added, find the target node closest to the connector in the path table, and add the shortest path between the node corresponding to the connector and the target node to the path table.
[0012] Furthermore, the cable path table is in a structured data format, which records the main cable bundle path and the cable branch path. The start and end points of the main cable bundle path are both the connectors, and at least one end of the start and end points of the branch path is a connector.
[0013] On the other hand, based on the same inventive structure, the present invention also provides an automatic routing system for communication satellite cable networks, comprising: An automatic construction module for the cable path preset network is used to read the type identification and position information of connectors, supports, and transom rings in the satellite 3D model, and construct an undirected graph consisting of nodes and edges connecting the nodes as the preset network based on the positional relationship of the supports and the transom rings and the interference check results; wherein, the nodes in the preset network include support node, transom ring node, connector node, and the straight section control point of the connector; The automatic cable path acquisition module is used to automatically select the minimum spanning tree algorithm or the shortest path algorithm based on the number of connectors involved in the cable to be routed, and then perform calculations based on the preset network to generate a cable path table connecting all related connectors.
[0014] In addition, a storage medium and an electronic device are provided, the storage medium being used to store a computer program for executing the above-described automatic routing method for communication satellite cable networks.
[0015] The electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the automatic routing method for the communication satellite cable network as described above.
[0016] The automatic cable routing method for communication satellites described in this invention automatically constructs a preset network of cable routing paths by reading the three-dimensional coordinates of direct components in the satellite's digital model. After automatic routing via an algorithm, the resulting cable network has a relatively regular routing, effectively replacing most manual operations by designers and saving manpower. Compared to existing automatic cable routing methods, the method provided by this invention is more intelligent, automatically generating shorter and lighter cable paths; the workload for designers to subsequently adjust cable routing is significantly reduced, improving cable network design efficiency and greatly shortening the development time for three-dimensional cable network routing design. Furthermore, this invention only requires pre-setting the corresponding design parameters and can be applied to the cable network routing design of most types of communication satellites. Attached Figure Description
[0017] Figure 1 This is a schematic diagram of a satellite platform payload bay and its supporting components. Figure 2 A flowchart illustrating the steps of the automatic routing method for communication satellite cable networks provided in an embodiment of the present invention; Figure 3 A flowchart illustrating the automatic construction steps of the cable path preset network in the automatic routing method for communication satellite cable networks provided in an embodiment of the present invention; Figure 4 A flowchart illustrating the algorithm for obtaining the cable path table based on the minimum spanning tree in the automatic routing method for communication satellite cable networks provided in an embodiment of the present invention; Figure 5 A flowchart illustrating the algorithm for obtaining the cable path table based on the shortest path in the automatic routing method for communication satellite cable networks provided in an embodiment of the present invention; Figure 6 This is a schematic diagram illustrating the specific execution flow of the automatic routing method for communication satellite cable networks provided in an embodiment of the present invention; Figure 7 A schematic block diagram of the automatic routing system for the communication satellite cable network provided in another embodiment of the present invention; Figure 8 A schematic diagram of the structure of the computer device provided by the present invention. Detailed Implementation
[0018] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.
[0019] It should be noted that references to "an embodiment," "embodiment," "example embodiment," etc., in this specification refer to the described embodiment including specific features, structures, or characteristics, but not every embodiment must include these specific features, structures, or characteristics. Furthermore, such expressions do not refer to the same embodiment. Moreover, when describing specific features, structures, or characteristics in conjunction with embodiments, whether or not explicitly described, it is indicated that incorporating such features, structures, or characteristics into other embodiments is within the knowledge of those skilled in the art.
[0020] Furthermore, certain terms are used in the specification and subsequent claims to refer to specific components or parts. Those skilled in the art will understand that manufacturers may use different names or terms to refer to the same component or part. This specification and subsequent claims do not distinguish components or parts by differences in name, but rather by differences in function. The terms "comprising" and "including" used throughout the specification and subsequent claims are open-ended and should be interpreted as "including but not limited to." Additionally, the term "connection" here includes any direct and indirect electrical connection means. Indirect electrical connection means include connections made through other means.
[0021] To enable those skilled in the art to reproduce and implement the present invention, the various steps of the automatic routing method and system for communication satellite cable networks will be described in detail below with reference to the accompanying drawings and specific embodiments. These embodiments are specific illustrations of the present invention, and their descriptions are helpful in understanding the present invention, but should not be construed as limiting the present invention.
[0022] Figure 2 and Figure 6 This invention illustrates an embodiment of an automatic routing method for communication satellite cable networks, applicable to public platform satellites. The method includes an automatic construction step S101 of a preset cable path network, an automatic acquisition step S102 of cable paths, and a generation step S103 of a three-dimensional model of the cable entity. Each step is described in detail below: S101: Read the type identification and location information of connectors, supports, and transom rings from the satellite's 3D model. Based on the positional relationships of the supports and transom rings and the interference check results, construct an undirected graph consisting of nodes and edges connecting the nodes as a preset network. The nodes in the preset network include support node nodes, transom ring nodes, connector nodes, and control points for the straight sections leading out of the connectors. The constructed preset network will serve as the topology basis for subsequent path planning.
[0023] See Figure 3 In an optional implementation, step S101 specifically includes: S1011: Determine whether there is a cache file storing preset network information. If it exists, read it and directly execute step S1015; otherwise, execute step S1012.
[0024] S1012: Read the type identifiers and location information of all support components in the satellite 3D model, and construct an initial undirected graph network based on the 3D straight-line distance between the support components; wherein, if the straight-line distance between two support component nodes is greater than a first preset distance threshold, or if the straight-line segment of the two nodes interferes with the cabin panel or instrument equipment, the edge between the two support component nodes is deleted; the type identifiers to be read in this embodiment are specifically the names of connectors, support components, and cabin rings. The names and location information are stored in the 3D model structure tree, and can be easily read by efficiently traversing the structure tree and matching specific part names.
[0025] Preferably, each edge of the undirected graph is assigned a distance weight to indicate the straight-line distance between the two support nodes connected by that edge in three dimensions. If the distance is greater than a first preset distance threshold, the edge is deleted; otherwise, it is retained. Furthermore, during the construction of the initial preset path network, path interference checks must be performed simultaneously. If the straight-line segment between two nodes interferes with the cabin panel or instrument equipment in the three-dimensional model, the edge must be removed.
[0026] S1013: Read the type identifier and location information of the transom ring, and add the target transom ring that meets the preset conditions as a node to the undirected graph network; the preset conditions are: the three-dimensional straight-line distance between the transom ring and at least one support node is less than the second preset distance threshold and the straight-line segments of the two do not interfere with the cabin plate or instruments and equipment.
[0027] The principle for adding a through-cabin ring to an undirected graph network is: the distance between the through-cabin ring and the support in three dimensions is less than a preset threshold value, and the straight line segment does not interfere with the cabin plate or instruments and equipment in three dimensions.
[0028] In practice, when performing interference checks between the cable penetration ring and the support, the cable penetration ring is first offset to a certain extent in the normal direction, and then a three-dimensional solid path is constructed for interference checks to avoid misjudgments caused by excessively small penetration holes on the tank plate. Furthermore, to reduce cable penetration during the addition of the cable penetration ring, a penalty factor is added to the path weight from the support to the cable penetration ring.
[0029] S1014: Serialize and save the type identifiers and location information of the undirected graph network, the support component, and the transom ring as a cache file; specifically, back up the preset path network, the names and location information of the support component and transom ring using serialization technology to obtain the cache file.
[0030] S1015: From the satellite 3D model, read the names and locations of all connectors involved in the current cable to be routed; for each connector read, generate a straight section control point at a given location in its outgoing direction, select the support node closest to the straight section control point and with no path interference, and add the connector node, the corresponding straight section control point node, and the edge connecting them to the undirected graph network to form the final preset network.
[0031] Step S1015 involves sequentially adding the connectors to the initial preset network constructed in the previous steps to obtain the final preset network. For each connector, firstly, a point at a given distance along the connector's outgoing direction is constructed as the straight section control point for the cable exiting at the connector end. Then, a support component closest to this straight section control point and without interference on the path is selected. Finally, the connector, the point at the given distance along the connector's outgoing direction, and the support component are sequentially connected to the existing preset network. The attributes of each node in the preset network are shown in Table 1 below:
[0032] In a specific example, firstly, the type identification and spatial location information of all support components (including T-shaped brackets and nylon bases) and transom rings on the payload bay are read from the satellite's three-dimensional digital model. Some data examples are shown in Tables 2 and 3 below.
[0033] Table 2 shows an example of support component location information:
[0034]
[0035] S102: Based on the number of connectors involved in the cable to be routed, automatically select the minimum spanning tree algorithm or the shortest path algorithm, and then perform calculations based on the preset network to generate a cable path table connecting all related connectors. After constructing the preset network, the system automatically selects an appropriate algorithm to obtain the cable path based on the cable size. Specifically, depending on the number of connectors involved in the current cabling task, it adaptively selects either the minimum spanning tree algorithm (for a small number of connectors, aiming for the overall optimal path) or the shortest path algorithm (for a large number of connectors, improving computational efficiency), performs calculations on the preset network, and automatically outputs a structured cable path connection table.
[0036] The cable path format and matching in this embodiment adopts the path table format and meets the following four requirements: a. The first line is the main cable bundle, which must be connector-to-connector. The connector string exists under the WXXX_CON assembly. b. Starting from the second line, the cable branches can begin from either the branch point or the connector, but a connector name is required, and the branch point must have appeared in the previous line; c. Connectors and coordinates should be separated by commas, and there should be no spaces; d. The coordinate format is [x / y / z].
[0037] A preferred format of the path table in this embodiment is shown in Table 5 below:
[0038] The automatic selection of either the minimum spanning tree algorithm or the shortest path algorithm based on the number of connectors involved in the cable to be routed specifically includes: When the number of connectors involved in the cable to be routed is less than a preset threshold, the cable path table is obtained using a minimum spanning tree algorithm; when the number of connectors involved in the cable to be routed is greater than or equal to the preset threshold, the cable path table is obtained using a shortest path algorithm.
[0039] In this embodiment, the preset quantity threshold is 10. That is, if the number of connectors involved in the cable to be routed is less than 10, the cable path table is obtained by using the minimum spanning tree algorithm; otherwise, if the number of connectors involved in the cable to be routed is greater than or equal to 10, the cable path table is obtained by using the shortest path algorithm.
[0040] See Figure 4 and Figure 6 The algorithm for obtaining the cable path table based on the minimum spanning tree specifically includes: S1021: Construct a first subgraph, where the nodes in the first subgraph are all the connector nodes to be connected, and the edges are the shortest path distance between two of the connector nodes in the preset network; let the first subgraph be... G 1( V 1, E 1) For any The weight of the edge for arrive The shortest distance.
[0041] S1022: Find the first minimum spanning tree of the first subgraph; specifically, find... G First minimum spanning tree of 1 G 2.
[0042] S1023: Based on the first minimum spanning tree, construct a second subgraph of the preset network; wherein, the second subgraph consists of all nodes on the shortest path corresponding to each edge in the first minimum spanning tree; let the second subgraph be... G 3, G 3 is composed of G It consists of all the points on the shortest path corresponding to each edge in equation 2.
[0043] S1024: Find the second minimum spanning tree of the second subgraph; that is, find... G 3 Second minimum spanning tree G 4.
[0044] S1025: Prune the second minimum spanning tree, deleting nodes with degree 1 that are not connector nodes and their connected edges, to obtain the resulting graph; specifically: for G 4. Perform pruning operations, removing branches with a degree of 1 that are not... V Delete the nodes in step 1 along with their corresponding edges to obtain the resulting graph. G 5.
[0045] S1026: Convert the resulting diagram into a cable route table in a specified format. G 5. Convert to path table format.
[0046] See Figure 5 and Figure 6 The algorithm for obtaining the cable path table based on the shortest path specifically includes: S1031: Calculate the shortest path distance between all the connectors to be connected in the preset network, select the two connectors with the longest distance and the shortest path between them, and add them to the path table as the initial path.
[0047] S1032: For each of the remaining connectors to be added, find the target node closest to the connector in the path table, and add the shortest path between the corresponding node and the target node to the path table. That is, when adding the remaining connectors to the path table one by one, for each connector, select the point closest to the connector in the existing path table as the branch path, and add the connector along with the branch path to the path table.
[0048] Furthermore, the cable path table is in a structured data format, which records the main cable bundle path and the cable branch path. The start and end points of the main cable bundle path are both the connectors, and at least one end of the start and end points of the branch path is a connector.
[0049] This embodiment reads the connector information involved in the cable bundle that needs to be routed. Some examples are shown below.
[0050] Table 6 shows an example of connector information:
[0051] In this example, it can be seen that there are 7 connectors to be connected (quantity < 10), so the minimum spanning tree algorithm is automatically selected for path planning.
[0052] Add the connectors read from the table above to the preset path, and the resulting diagram will have the following format:
[0053] The cable path is calculated, and the resulting path table is as follows:
[0054] After obtaining the cable route table, the corresponding cable solid model can be generated in the 3D design software. Specifically, using the cable route table obtained in the previous steps, a cable entity is generated in the 3D design software; by automatically creating the corresponding 3D cable entity model based on the node sequence and connection relationships defined in the cable route table, the conversion from digital path to 3D entity is completed.
[0055] This embodiment uses CATIA software as an example to generate cable entities, but it can also be extended to other 3D design software such as Creo.
[0056] Figure 7 This invention illustrates an automatic routing system 100 for communication satellite cable networks, comprising an automatic construction module 10 for pre-defined cable paths and an automatic acquisition module 20 for cable paths, wherein: The automatic construction module 10 for the cable path preset network is used to read the type identification and position information of connectors, supports, and penetration rings in the satellite 3D model, and construct an undirected graph consisting of nodes and edges connecting the nodes as the preset network based on the positional relationship of the supports and penetration rings and the interference check results; wherein, the nodes in the preset network include support node nodes, penetration ring nodes, connector nodes, and the straight section control points of the connectors; the automatic acquisition module 20 for the cable path is used to automatically select the minimum spanning tree algorithm or the shortest path algorithm according to the number of connectors involved in the cable to be routed, and then perform calculations based on the preset network to generate a cable path table connecting all relevant connectors.
[0057] The specific implementation and operation process of each module in the system 100 described in this embodiment can be understood by referring to the relevant descriptions in the foregoing method embodiments, and all of them can achieve the functions and effects achieved by the corresponding method steps. For the sake of simplicity and to avoid repetition, they will not be described again here.
[0058] In summary, the automatic routing method for communication satellite cable networks described in this invention first automatically constructs a pre-defined cable path network composed of nodes and edges by reading the spatial information of support components, insertion rings, and connectors in the satellite's 3D model. The nodes contain the aforementioned components. Then, based on the number of connectors to be routed, it adaptively selects either a minimum spanning tree algorithm or a shortest path algorithm to automatically calculate and generate an optimal cable path table within the pre-defined network. Finally, based on this path table, it automatically generates a cable entity model in 3D design software. This method replaces the traditional point-by-point design method relying on manual experience with automatic algorithmic planning, achieving rapid, regular, and optimized generation of cable paths. Its advantages include: significantly improving the design efficiency of satellite cable networks and greatly saving manual time and costs; generating shorter and lighter paths, reducing the workload of subsequent adjustments; and possessing good platform adaptability, requiring only parameter adjustments to be applicable to communication satellites of different configurations, demonstrating strong versatility.
[0059] This invention also provides a storage medium for storing a computer program for executing the above-described automatic routing method for communication satellite cable networks. For example, computer program instructions, when executed by a computer, can invoke or provide the methods and / or technical solutions according to this application through the operation of the computer. The program instructions for invoking the methods of this application may be stored in a fixed or removable storage medium, and / or transmitted via data streams in broadcast or other signal carrying media, and / or stored in the storage medium of a computer device operating according to the program instructions. Here, in one embodiment according to this application, it includes a... Figure 8The computer device 400 shown preferably includes a memory 200 for storing computer programs and a processor 300 for executing computer programs. When the computer program is executed by the processor 300, the computer device 400 is triggered to execute the methods and / or technical solutions based on the foregoing embodiments.
[0060] Numerous specific details are set forth in the specification provided herein. However, it will be understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures, and techniques have not been shown in detail so as not to obscure the understanding of this specification.
[0061] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element. Furthermore, it should be noted that the scope of the methods and apparatuses in the embodiments of the present invention is not limited to performing functions in the order shown or discussed, but may also include performing functions substantially simultaneously or in the reverse order, depending on the functions involved. For example, the described methods may be performed in a different order than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.
[0062] Of course, the present invention may have other various embodiments. Without departing from the spirit and essence of the present invention, those skilled in the art can make various corresponding changes and modifications according to the present invention, but these corresponding changes and modifications should all fall within the protection scope of the appended claims.
Claims
1. A method for automatically routing communication satellite cable networks, characterized in that, Including: The automatic construction steps of the cable path preset network are as follows: read the type identification and position information of connectors, supports and ferrules in the satellite 3D model, and construct an undirected graph consisting of nodes and edges connecting the nodes as the preset network based on the positional relationship of the supports and ferrules and the interference check results; wherein, the nodes in the preset network include support nodes, ferrule nodes, connector nodes and the straight section control points of the connectors; Automatic cable path acquisition steps: Based on the number of connectors involved in the cable to be routed, the minimum spanning tree algorithm or the shortest path algorithm is automatically selected, and then calculations are performed based on the preset network to generate a cable path table connecting all related connectors.
2. The method according to claim 1, characterized in that, The automatic construction steps of the preset cable path network specifically include: a) Determine if a cache file containing preset network information exists. If it exists, read it and execute step (e) directly; otherwise, execute step (b). b) Read the type identifiers and location information of all support components in the satellite 3D model, and construct an initial undirected graph network based on the 3D straight-line distance between the support components; wherein, if the straight-line distance between two support component nodes is greater than a first preset distance threshold, or if the straight-line segment of the two supports interferes with the cabin or instrument equipment, then delete the edge between the two support component nodes. c) Read the type identifier and location information of the transom ring, and add the target transom ring that meets the preset conditions as a node to the undirected graph network; the preset conditions are: the three-dimensional straight-line distance between the transom ring and at least one support node is less than the second preset distance threshold and the straight-line segments of the two do not interfere with the cabin plate or instruments and equipment. d) Serialize and save the type identifiers and location information of the undirected graph network, the support member, and the transom ring as a cache file; e) Read the names and locations of all connectors involved in the current cable to be routed from the satellite 3D model; for each connector read, generate a straight section control point at a given location in its outgoing direction, select the support node that is closest to the straight section control point and has no path interference, and add the connector node, the corresponding straight section control point node, and the edge connecting the two to the undirected graph network to form the final preset network.
3. The method according to claim 2, characterized in that, In step (c), when the target through-cabin ring is added to the undirected graph network, a penalty factor is added to the weight of the edge connecting the support node and the through-cabin ring node.
4. The method according to claim 1, characterized in that, The automatic selection of either the minimum spanning tree algorithm or the shortest path algorithm based on the number of connectors involved in the cable to be routed specifically includes: When the number of connectors involved in the cable to be routed is less than a preset threshold, the cable path table is obtained using an algorithm based on minimum spanning tree. When the number of connectors involved in the cable to be routed is greater than or equal to the preset number threshold, the cable path table is obtained by using an algorithm based on the shortest path.
5. The method according to claim 4, characterized in that, The algorithm for obtaining the cable path table based on the minimum spanning tree specifically includes: Construct a first subgraph, in which the nodes are all the connector nodes to be connected, and the edges are the shortest path distance between two of the connector nodes in the preset network. Find the first minimum spanning tree of the first subgraph; Based on the first minimum spanning tree, a second subgraph of the preset network is constructed; wherein, the second subgraph is composed of all nodes on the shortest path corresponding to each edge in the first minimum spanning tree; Find the second minimum spanning tree of the second subgraph; Prune the second minimum spanning tree by deleting nodes with a degree of 1 that are not connector nodes and their connected edges to obtain the resulting graph. Convert the resulting diagram into a cable path table in a specified format.
6. The method according to claim 4, characterized in that, The algorithm for obtaining the cable path table based on the shortest path specifically includes: Calculate the shortest path distance between all the connectors to be connected in the preset network, select the two connectors with the longest distance and the shortest path between them as the initial path and add them to the path table; For each of the remaining connectors to be added, find the target node closest to the connector in the path table, and add the shortest path between the node corresponding to the connector and the target node to the path table.
7. The method according to claim 1, characterized in that, The cable path table is a structured data format that records the main cable bundle path and the cable branch path. The start and end points of the main cable bundle path are both the connectors, and at least one of the start and end points of the branch path is a connector.
8. An automatic routing system for communication satellite cable networks, characterized in that, Including: An automatic construction module for the cable path preset network is used to read the type identification and position information of connectors, supports, and transom rings in the satellite 3D model, and construct an undirected graph consisting of nodes and edges connecting the nodes as the preset network based on the positional relationship of the supports and the transom rings and the interference check results; wherein, the nodes in the preset network include support node, transom ring node, connector node, and the straight section control point of the connector; The automatic cable path acquisition module is used to automatically select the minimum spanning tree algorithm or the shortest path algorithm based on the number of connectors involved in the cable to be routed, and then perform calculations based on the preset network to generate a cable path table connecting all related connectors.
9. A storage medium, characterized in that, Used to store a computer program for executing the automatic routing method for communication satellite cable networks according to any one of claims 1 to 7.
10. An electronic device, characterized in that, The method includes a storage medium, a processor, and a computer program stored on the storage medium and executable on the processor, wherein the processor, when executing the computer program, implements the automatic routing method for communication satellite cable networks as described in any one of claims 1 to 7.