Multi-stage combination automatic optimization method and system for satellite three-dimensional cable network path

Abstract

The invention provides a multi-stage combination automatic optimization method for a satellite three-dimensional cable network path, and the method comprises the steps: judging the membership of a cable binding support, a connector and a cabin plate through reading a satellite three-dimensional satellite model, and defining the attributes of a cabin penetrating hole and a cross-plate connection point; constructing a three-layer information table of a cable network, a cable bundle and a cable branch; selecting the longest different plate / same plate branch as a main branch according to cabin plates at the head end and the tail end of the branch; decomposing stage by stage according to the distribution of main and branch cabin plates, and performing path optimization by adopting a plate path optimization algorithm based on a Floyd algorithm, an intra-region path optimization algorithm and a region path optimization algorithm; the slave branch selects the nearest access point for optimization based on the main branch path; and circularly processing all the cable bundles to complete the path planning of the whole cable network. Therefore, automatic optimization of the three-dimensional cable network path of the satellite deck is realized, the problems of low efficiency and poor quality of manual design of a general module are solved, and the method is adaptive to a whole satellite and a multi-deck satellite with a single / multi-plane deck and has universality.

Description

Technical Field

[0001] This invention relates to the field of satellite cable design technology, and in particular to a multi-stage combination automatic optimization method and system for satellite three-dimensional cable network paths. Background Technology

[0002] Satellite cables consist of several physically separated cable bundles. Each bundle contains multiple cable branches, and each branch contains two connectors and the cables connecting them. Different branches may share some connectors. The internal connections of each cable bundle form a mesh, which is called a cable network. However, for practical production and installation needs, the actual cable network cannot be a "mesh" but rather a "fishbone" shape. The specific design requirements are as follows:

[0003] 1. A single bundle of cables can span multiple compartments, or span multiple areas separated by multiple partitions within a single compartment, or be installed only within a single area of ​​a single compartment. It must be laid out in a two-dimensional plane within the compartment by relying on the cable binding bracket within the compartment. That is, the cable bundle laid out in multiple compartments must be decomposed into multiple two-dimensional layouts within the compartments, and "flying wires" in three-dimensional space are not allowed.

[0004] 2. If cables need to be laid in multiple compartments, they must be connected to subsequent compartments from the current compartment through the designated compartment connection brackets to achieve cable laying in multiple compartments. Cables cannot be laid across compartments arbitrarily.

[0005] 3. If cables need to be laid in two areas of a compartment separated by a bulkhead or multiple areas separated by multiple bulkheads, they must be laid from area A to area B of the compartment through the designated through holes in the bulkhead.

[0006] 4. If cables need to be laid on both sides of the compartment, they must be laid through the designated through holes on the compartment to achieve the laying of cables on both sides of the compartment.

[0007] 5. The cable has one and only one main branch, and the others are secondary branches. The secondary branches must be connected from the access point on the existing branch according to the nearest access principle.

[0008] 6. The main branches and all branch paths of the cable shall follow the principle of the shortest length. If the cable needs to be laid through multiple compartments, the principle of the minimum number of compartments to be passed shall be followed. If a specific compartment is specified, the principle of the minimum number of compartments to be passed shall be followed. If multiple compartment connection brackets are set between compartments, the principle of the shortest path length shall be used. If multiple through holes are set on the bulkhead or compartment, the principle of the shortest path length shall be used.

[0009] 7. The main branch of the cable is determined by the branch that passes through the most compartments in the cable bundle. If there are multiple branches that meet the condition of passing through the most compartments, the branch with the longest path is selected. If all branches are in the same compartment, the branch with the longest path is selected. At the same time, requirement 5 must also be met when determining the main branch path.

[0010] 8. The cable should have an additional 50-80mm section at the electrical connector, and the overall length should be increased by 3% to facilitate the operation during the final assembly stage; the cable should be bundled and fixed in layers on the support according to the signal transmission to meet electromagnetic compatibility requirements.

[0011] 9. Except for the two ends of the main branch where electrical connectors are connected, each cable bundle must have one end as the branch point and the other end as the electrical connector to avoid cable loops that could cause short circuits; the branch point should be located close to the cable binding bracket.

[0012] The goal of satellite cable network design is to minimize cable paths while meeting functional requirements. Currently, satellite cable networks have transitioned from a "physical wooden model" design to a "3D virtual" design model. Designers primarily use the General Electric design module in mainstream 3D design software in a manual mode to design satellite cable network paths. The specific process is as follows:

[0013] 1. Check the cable connection table and break down each cable bundle;

[0014] 2. Select to perform 3D virtual design of cable bundles;

[0015] 3. Check the electrical connector connections of the cable bundle (cai), and take the longest branch as the main branch of the cable bundle, and the other branches as secondary branches;

[0016] 4. Based on the location of instruments, electrical connectors, and cable binding brackets in the satellite 3D model, the main branch paths of the cable bundle are planned according to the principle of shortest length based on personal experience;

[0017] 5. Using the electrical design module, manually connect the main branch of the cable bundle, that is, the electrical connectors at both ends of the branch and all the cable binding brackets along the path, without any interference;

[0018] 6. Set length allowances for the beginning and end of the main branches of the cable bundle, intermediate bends, and the entire bundle;

[0019] 7. Select the electrical connector location of the secondary branch brj of the cable bundle cai. Using the nearest access principle, manually set the access point of secondary branch 1 on the main branch. This point must be on the binding bracket of the main branch.

[0020] 8. Using the shortest length principle, plan the path from the access point of branch 1 to the electrical connector, and draw the path from branch 1 as in steps 5 and 6.

[0021] 9. Draw other branches sequentially using the nearest access principle. A branch can be accessed from an already drawn main branch or from other already drawn branches. That is, a cable bundle can contain multiple levels of branches.

[0022] 10. Repeat steps 2 through 9 to complete the drawing of all cable bundles.

[0023] In summary, the core of satellite cable network design is cable path planning, with the goal of minimizing cable paths while meeting functional requirements. Due to the massive scale of satellite cable networks—for example, communication satellites typically have over 100 cable bundles, over 1000 electrical connectors, and over 400 cable ties—with the largest bundles exceeding 10 branch layers and over 500 branches, the repetitive workload of manually designing cable paths is enormous and complex. This is especially problematic with cable bundles having a large number of branch layers and branches, which easily leads to errors and short circuits. Currently, the three-dimensional cable network layout design cycle for communication satellites is approximately 30 to 40 days, with cable path design accounting for over 60% of the time, becoming a bottleneck restricting the efficiency of satellite cable network layout design. Furthermore, designers relying on personal experience for path planning struggle to achieve optimized path design. When multiple designers collaborate, it's difficult to maintain consistent standards, further hindering path optimization and resulting in low-quality cable network design, leading to problems such as disorganized layouts and excessive weight. Therefore, there is an urgent need to provide an automatic optimization method for satellite three-dimensional cable network paths to achieve automatic optimization design of cable path routing in a digital environment.

[0024] Satellite 3D cable network path optimization design is an application of path optimization technology in the field of satellite development. Currently, publicly available information shows that there is not much research on automatic path optimization algorithms for satellite 3D cable networks. Summary of the Invention

[0025] To overcome the aforementioned technical deficiencies, the present invention aims to provide a multi-stage combination automatic optimization method and system for satellite three-dimensional cable network paths. This method and system are used to achieve automatic optimization design of cable network paths in the three-dimensional space of satellite compartments and panel structures. It solves the problems of low efficiency, poor quality, and suboptimal design caused by repetitive manual work when defining cable network paths using general electrical design modules. At the same time, it is applicable to satellites composed of single or multiple planar panels to form a complete satellite structure or to form a multi-section structure, and has a certain degree of versatility.

[0026] To achieve the above-mentioned technical effects, on the one hand, this invention provides a multi-stage automatic optimization method for satellite three-dimensional cable network paths, including the following steps:

[0027] (a) Read the satellite's three-dimensional model and determine the relationship between the cable binding brackets and electrical connectors and the cabin panels through Boolean operations;

[0028] (b) Define the cable penetration hole properties on the 3D model of the compartment and define the cable cross-compartment connection point properties on the brackets belonging to the two compartments.

[0029] (c) Read the cable connection relationship table and construct a three-level information table; the three-level information table includes the cable network information table elec_list={ca1,ca2,...,can}, the cable bundle information table cai=[br1,br2,...,brm] and the cable branch information table brj=(s_conj,e_conj); s_conj is the first end connector of branch j, and e_conj is the last end connector of branch j;

[0030] (d) Determine the main branch of the cable bundle:

[0031] Based on whether the beginning and end of the branch belong to the same compartment, create a list of branches on the same board corresponding to the cable bundle: cai_slist1 = [(s_conm, e_conm, l m )] and the heterogeneous branch list cai_slist2=[(s_conn,e_conn,l n )], where l m The spatial distance between the front and rear connectors of corresponding branches on the same compartment plate, l n Spacing between the front and rear connectors of different compartment branches;

[0032] If the heterogeneous branch list is empty, then l m The largest branch on the same board is taken as the main branch; if the list of branches on different boards is not empty, then l is taken as the main branch. n The largest cross-board branch is designated as the main branch;

[0033] (e) Based on the membership relationship, determine the compartment to which the first and last connectors of the main branch belong, and perform path optimization for the main branch based on the belonging compartment:

[0034] If the first and last connectors belong to the same compartment and the same area, then the intra-area path optimization algorithm based on the Floyd algorithm is called to optimize the cable path.

[0035] If the first and last connectors belong to different areas of the same compartment, the branch is decomposed into g+1 segments based on the number of partitions g between the first and last connectors, and the area path optimization algorithm and the intra-area path optimization algorithm are called to optimize the cable path in stages.

[0036] If the first and last connectors belong to different compartments, the board path optimization algorithm, the area path optimization algorithm, and the area path optimization algorithm are called to optimize the cable path in stages.

[0037] Create a main branch path point table to store all optimized path points;

[0038] (f) Perform path optimization on the branch:

[0039] Determine whether there is a duplicate of the first and / or last connectors of the branch and the main branch. If there is no duplicate, calculate the distance between the first and / or last connectors and each main branch path point in the main branch path point table, and select the target path point with the shortest distance as the access point of the branch.

[0040] The access points for other branches are determined sequentially to complete the branch path optimization.

[0041] (g) Steps (d) to (f) are executed sequentially for other cable bundles in the cable network information table to complete the path optimization for all cable bundles.

[0042] Furthermore, the path optimization algorithm within the region includes:

[0043] Obtain the coordinates of electrical connectors and cable tie brackets belonging to the optimization area to create a list of path optimization coordinates;

[0044] Construct an n×n distance matrix dist, where dist[i,j] represents the shortest distance from point i to point j. When there are no obstacles between two points and the distance is less than or equal to the maximum binding spacing, dist[i,j] is equal to the actual calculated distance; otherwise, dist[i,j] is infinite and unreachable.

[0045] The Floyd algorithm is used to calculate the shortest obstacle avoidance path between the first and last ends.

[0046] Furthermore, the step of decomposing the branch into g+1 segments based on the number of partitions g between the first and last connectors, and then using the regional path optimization algorithm and the intra-regional path optimization algorithm to optimize the cable path in stages, includes:

[0047] Based on the number of partitions g between the first and last connectors, the branch is divided into g+1 regions. Starting from the initial region where the first connector is located and ending at the g+1th region where the last connector is located, the region path is optimized and a region path table is created.

[0048] Starting from the initial region, select the shortest cable penetration hole on the corresponding partition for each adjacent region and add it to the region access table;

[0049] Based on the regional pathway table, the path optimization algorithm within each region is sequentially invoked to perform path optimization for each stage within the region.

[0050] Furthermore, the cable path optimization algorithm, the regional path optimization algorithm, and the regional path optimization algorithm are used to optimize the cable path in stages, including:

[0051] Based on the defined cross-plate connection points, create a deck_link table: deck_link = [(d1,d2),(d1,d3),...,(dm,dn)].

[0052] Construct an n×n deck road matrix, where deck road[di,dj] represents the deck road from deck di to deck dj. If (di,dj)∈deck_link, then deck road[di,dj]=1; otherwise, deck road[di,dj]=IMF, where IMF is infinity. If a specified deck di or deck dj must pass through and (di,dj)∈deck_link, then deck road[di,dj]=-10.

[0053] The Floyd algorithm is used to calculate the minimum path value between the forward and end panels, and an optimized panel path table is generated.

[0054] The branch path is decomposed into each compartment in the optimization board path table and segmented path optimization is performed sequentially. It is determined whether there is a partition on the path to be optimized. If there is, the regional path optimization algorithm and the regional path optimization algorithm are called to optimize the cable path in stages. If there is no partition, the regional path optimization algorithm is called to optimize the cable path.

[0055] Furthermore, determining whether there is a partition on the path to be optimized includes:

[0056] Obtain the cross-plate connection point between adjacent panels. If there are multiple cross-plate connection points, select the target cross-plate connection point according to the shortest distance principle.

[0057] Determine whether there is a partition between the connector on the cabin plate and the corresponding target cross-plate connection point.

[0058] Furthermore, the determination of the affiliation relationship includes:

[0059] The fit between the cable binding bracket, electrical connector and the cabin plate is determined by Boolean operation of the model;

[0060] Based on the aforementioned fit, the cable binding brackets and electrical connectors are assigned to their respective compartments.

[0061] On the other hand, the present invention also provides a multi-stage combined automatic optimization system for satellite three-dimensional cable network paths, the system being configured to implement the method described above.

[0062] Compared with the prior art, the present invention has the following beneficial effects:

[0063] (1) The present invention adopts a step-by-step decomposition method and finally decomposes it into the smallest indivisible region, which simplifies the complex cable path optimization problem in three dimensions or across multiple regions into a simple combination path optimization within a two-dimensional region, thereby simplifying and making the satellite cable network path optimization problem feasible.

[0064] (2) The present invention adopts corresponding independent optimization algorithms for different decomposition stages, and achieves full coverage and adaptability of different decomposition results by combining different optimization algorithms, thereby obtaining optimized path search results.

[0065] (3) The present invention can be applied to the automatic optimization of satellite cable network paths that are installed based on the cabin panels, and can be extended to other spacecraft or equipment composed of cabin panels, thus possessing versatility.

[0066] (4) This invention uses less manual interaction, and the path optimization process is fully automated, effectively replacing the manual path setting process. It can significantly reduce the workload of designers and improve the efficiency and quality of satellite cable network path design. Attached Figure Description

[0067] Figure 1 A flowchart illustrating the steps of a multi-stage combined automatic optimization method for satellite three-dimensional cable network paths provided in an embodiment of the present invention;

[0068] Figure 2 The automatic cable path optimization effect diagram of the multi-stage combination automatic optimization method for satellite three-dimensional cable network paths provided in an embodiment of the present invention is shown.

[0069] Figure 3 This is a schematic diagram of a cable bundle mesh connection.

[0070] Figure 4 This is a schematic diagram of a fishbone-shaped connection relationship for a cable bundle;

[0071] Figure 5 A flowchart illustrating the multi-stage combined automatic optimization method for satellite three-dimensional cable network paths provided in an embodiment of the present invention;

[0072] Figure 6 The flowchart of the automatic optimization method for multi-stage combination of satellite three-dimensional cable network paths based on the Floyd algorithm is provided in an embodiment of the present invention.

[0073] Figure 7 A flowchart illustrating the steps of the automatic regional path optimization algorithm in a multi-stage combined automatic optimization method for satellite three-dimensional cable network paths provided in an embodiment of the present invention.

[0074] Figure 8The flowchart illustrates the steps of a multi-stage combined automatic optimization method for satellite three-dimensional cable network paths provided in an embodiment of the present invention, specifically an automatic path optimization algorithm within a region based on the Floyd algorithm. Detailed Implementation

[0075] 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.

[0076] 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.

[0077] 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.

[0078] Before describing the embodiments of this application in detail, the technical concept of this application is briefly described first: The multi-stage combination automatic optimization method for satellite three-dimensional cable network paths provided by this invention decomposes the three-dimensional cable network into three stages according to the production and installation requirements of satellite cable networks: between multiple compartments, between multiple regions within a single compartment, and within a single region within a single compartment. Finally, it is transformed into a two-dimensional layout with a single region within a single compartment as the smallest stage, realizing the dimensionality reduction and simplification of the cable network from three-dimensional to two-dimensional. By adopting a board path optimization algorithm based on the Floyd algorithm, a path optimization algorithm within the region, and a regional path optimization algorithm, the automatic optimization design of the cable path is realized by combining them.

[0079] The specific principles of the multi-stage combination automatic optimization method for satellite three-dimensional cable network paths of this application will be described below with reference to specific embodiments.

[0080] Figure 1 This invention illustrates a multi-stage automatic optimization method for satellite three-dimensional cable network paths, comprising the following steps:

[0081] S101: Read the satellite's 3D model and determine the membership relationship between the cable tying brackets and electrical connectors and the cabin panels through Boolean operations. The membership determination includes: determining the fit relationship between the cable tying brackets, electrical connectors, and cabin panels through Boolean operations on the model; and assigning the cable tying brackets and electrical connectors to their respective cabin panels based on the fit relationship.

[0082] In specific implementation, this embodiment obtains the spatial outline geometric information of the cabin by reading the satellite three-dimensional model. The cable binding bracket, electrical connector and the cabin are determined by Boolean operation of the model according to the rule that they are attached to each other. The cable binding bracket and electrical connector are divided into cabins according to their affiliation.

[0083] The connection relationship of the cable bundle is as follows Figures 3-4 As shown.

[0084] S102: Define the cable penetration hole attributes on the 3D model of the compartment, and define the cable cross-plate connection point attributes on the supports belonging to the two compartments; specifically, define the cable penetration hole attributes on the 3D model of the compartment, and simultaneously define the cable cross-plate connection point attributes on the two compartments through the supports belonging to the two compartments.

[0085] S103: Read the cable connection relationship table and construct a three-level information table; the three-level information table includes the cable network information table elec_list = {ca1, ca2, ..., can}, the cable bundle information table cai = [br1, br2, ..., brm], and the cable branch information table brj = (s_conj, e_conj); s_conj is the first connector of branch j, and e_conj is the last connector of branch j; specifically, by reading the cable branch connection relationship table, all cable bundles are decomposed. The cable bundle contains branches and electrical connectors for branch connections. A three-level information table is created from top to bottom in the format of "cable bundle → branch → first and last connectors": the first-level cable network information table elec_list = {ca1, ca2, ..., can}, the second-level cable bundle information table cai = [br1, br2, ..., brm], and the third-level cable branch information table brj = (s_conj, e_conj). In subsequent steps, path optimization is performed on each cable bundle in elec_list in sequence.

[0086] S104: Determine the main branch of the cable bundle:

[0087] Based on whether the beginning and end of the branch belong to the same compartment, create a list of branches on the same board corresponding to the cable bundle: cai_slist1 = [(s_conm, e_conm, l m )] and the heterogeneous branch list cai_slist2=[(s_conn,e_conn,l n )], where l m The spatial distance between the front and rear connectors of corresponding branches on the same compartment plate, l n This refers to the spatial distance between the first and last connectors of branches corresponding to different compartments; if the list of different compartment branches is empty, then l m The largest branch on the same board is taken as the main branch; if the list of branches on different boards is not empty, then l is taken as the main branch. n The largest cross-board branch is designated as the main branch;

[0088] Taking the determination of the main branch br1 corresponding to cable bundle cai as an example, create cable bundle s main branch determination tables cai_slist1 and scai_slist2 according to whether the first and last connectors are on the same board. cai_slist1 is the list of branches on the same board, and scai_slist2 is the list of branches on different boards. By determining the board where the first and last connectors of each branch in the cable bundle cai branch list are located, if the first and last connectors of a certain branch brm belong to the same board, calculate the spatial distance between its first and last connectors. The spatial coordinates of the first connector are (x m1 y m1 , z m1 The spatial coordinates of the end connector are (x... m2 y m2 , z m2 Add the branch brm to cai_slist1 = [(s_conm,e_conm,l m If the connectors at the beginning and end of a branch BRN do not belong to the same compartment, calculate the spatial distance l between the connectors at the beginning and end of the branch BRN. n Add to cai_slist2 = [(s_conn, e_conn, l n )], and so on to complete all branch classifications.

[0089] The main branch is determined based on cai_slist1 and scai_slist2. If scai_slist2 is empty, only cai_slist1 is determined, and l is taken. m The largest branch is the main branch br1; if scai_slist2 is not empty, then only scai_slist2 is evaluated, and l is selected. n The largest branch is the main branch br1, and the main branch of each cable bundle is br1, with secondary branches being br2,...,brn.

[0090] S105: Based on the aforementioned membership relationship, determine the compartment to which the first and last connectors of the main branch belong, and perform path optimization for the main branch based on the belonging compartment:

[0091] If the first and last connectors belong to the same compartment and the same area, then the intra-area path optimization algorithm based on the Floyd algorithm is called to optimize the cable path.

[0092] If the first and last connectors belong to different areas of the same compartment, the branch is decomposed into g+1 segments based on the number of partitions g between the first and last connectors, and the area path optimization algorithm and the intra-area path optimization algorithm are called to optimize the cable path in stages.

[0093] If the first and last connectors belong to different compartments, the board path optimization algorithm, the area path optimization algorithm, and the area path optimization algorithm are called to optimize the cable path in stages.

[0094] Create a main branch path point table to store all optimized path points;

[0095] In specific implementation, based on the electrical connector affiliation established in step S101, the compartment to which the first and last connectors of the main branch belong are determined. Accordingly, the cable path optimization is decomposed into stages. If they belong to the same compartment and region, only one stage (same compartment and region) is included, and the single-stage optimization algorithm within the region is applied. Figure 8 The process shown optimizes cable paths. If the cable belongs to different areas of the same compartment, the branch will be divided into g+1 segments based on the number of spacers g of the connector. This includes two stages: between areas on the same board and within the same area on the same board. A combination of the area path optimization algorithm and the two-stage optimization algorithm within the same area is used to proceed to the next step. Figure 7 The process shown optimizes cable paths. If the cables belong to different compartments, the board path optimization algorithm decomposes the cables into multiple boards, and then performs region determination within each board. If different regions exist within the same board, a three-stage algorithm combination of board path optimization algorithm + region path optimization algorithm + region optimization is used. If all cables belong to the same board and region, a two-stage algorithm combination of board path optimization algorithm + region optimization is used, transitioning to the next step. Figure 6 The process shown is used to optimize the cable path. Then, a path point data table `br1_points` is created to store the optimized path points for `br1`.

[0096] In one specific embodiment, the intra-regional path optimization algorithm includes:

[0097] Obtain the coordinates of electrical connectors and cable binding brackets belonging to the optimization area to create a path optimization coordinate list; construct an n×n distance matrix dist, where dist[i,j] represents the shortest distance from point i to point j; when there are no obstacles between two points and the distance is less than or equal to the maximum binding spacing, dist[i,j] equals the actual calculated distance, otherwise dist[i,j] is infinite and unreachable; use the Floyd algorithm to calculate the shortest obstacle avoidance path between the first and last ends.

[0098] See Figure 8 Path optimization within the same board and region is implemented based on the Floyd algorithm, and the specific process is as follows:

[0099] (a) Obtain the coordinates of electrical connectors and the coordinates of cable binding brackets belonging to the optimization area, and create a path optimization coordinate list points = [(x1,y1),(x2,y2),...,(xn,yn)];

[0100] (b) Construct an n×n distance matrix dist, where dist[i,j] represents the shortest distance from point i to point j. If i = j, then dist[i,j] = 0. If the straight-line distance between two points is less than the set maximum binding spacing max_dist, and the line segment formed by the two points does not interfere with the instrument and equipment model in the optimization area, then dist[i,j] is the actual calculated distance. Otherwise, dist[i,j] is infinite INF, meaning it cannot be reached.

[0101] (c) The Floyd algorithm is used to calculate the shortest and obstacle-avoiding connection path of the first and last connectors through the cable binding bracket in the area, and the path points are added to br1_points=(s_con1_p,p2,...,e_con1_p).

[0102] In one specific implementation, the step of decomposing the branch into g+1 segments based on the number of partitions g between the first and last connectors, and then calling the regional path optimization algorithm and the intra-regional path optimization algorithm to perform cable path optimization in stages includes:

[0103] Based on the number of partitions g between the first and last connectors, the branch is divided into g+1 regions. Starting from the initial region where the first connector is located and ending at the g+1th region where the last connector is located, regional path optimization is performed to create a regional path table. Starting from the initial region, the shortest cable penetration hole is selected on the corresponding partition for adjacent regions and added to the regional path table. According to the regional path table, the path optimization algorithm within each region is called sequentially to perform path optimization for each stage within the region.

[0104] See Figure 7 A combination of regional pathway optimization algorithm and intra-regional path optimization algorithm is used to optimize paths in different regions of the same board. The specific process is as follows:

[0105] (a) Determine the number of partitions g between the front and rear connectors on the cabin plate, divide the branch into g+1 segments, start from region 1 where the front connector is located and end at region g+1 where the rear connector is located to optimize the regional path and create the regional path table cai_region.

[0106] (b) Obtain the cable penetration holes on the partition of the separation area 1, create a hole list holes1 = [ho11,ho12,...,ho1n], calculate the distance between each hole and the head connector s_con, select the penetration hole ho1i according to the shortest distance rule, and add it to the area access table cai_region = [(s_con,ho1i,1)].

[0107] (c) Obtain the cable penetration holes on the partition of the separation region 2, create a hole list holes2 = [ho21,ho22,...,ho2n], calculate the distance between each hole and the selected penetration hole ho1i in the previous region 1, select the penetration hole ho2i according to the shortest distance rule, and add it to the region access table cai_region = [(s_con,ho1i,1),(ho1i,ho2j,2)];

[0108] (d) Follow the above process until the end connector is located in the region g+1 of the bulkhead through hole hogn, and add it to the region path table cai_region=[(s_con,ho1i,1),(ho1i,ho2j,2),...,(hogn,e_con,g+1)] to complete the path optimization between regions.

[0109] (e) Based on the regional path table cai_region, call step 6 in sequence to complete the path optimization of each stage in each region, and add the path points to br1_points=(s_con1_p,p2,...,e_con1_p).

[0110] In one specific implementation, the cable path optimization algorithm, the regional path optimization algorithm, and the regional path optimization algorithm are used to optimize the cable path in stages, including:

[0111] Based on the defined cross-plate connection points, create a plate adjacency list `deck_link = [(d1,d2),(d1,d3),...,(dm,dn)]`; construct an n×n plate path matrix `deck_road`, where `deck_road[di,dj]` represents the plate path from plate `di` to plate `dj`; if (di,dj)∈deck_link, then `deck_road[di,dj] = 1`; otherwise, `deck_road[di,dj] = IMF`, where IMF is infinity; if plate `di` or `dj` is specified... If deck dj must pass through and (di,dj)∈deck_link, then deck_road[di,dj]=-10; the minimum path value between the first and last decks is calculated using the Floyd algorithm to generate an optimized deck path table; the branch path is decomposed into each deck in the optimized deck path table, and segmented path optimization is performed sequentially. It is determined whether there is a partition on the path to be optimized. If there is, the regional path optimization algorithm and the regional path optimization algorithm are called to optimize the cable path in stages; if there is no partition, the regional path optimization algorithm is called to optimize the cable path. Among them, determining whether there is a partition on the path to be optimized includes: obtaining the cross-deck connection point between adjacent decks; if there are multiple cross-deck connection points, the shortest distance principle is used to select the target cross-deck connection point; and determining whether there is a partition between the connector on the deck and the corresponding target cross-deck connection point.

[0112] Furthermore, determining whether there is a partition on the path to be optimized includes:

[0113] Obtain the cross-plate connection point between adjacent compartments. If there are multiple cross-plate connection points, select the target cross-plate connection point according to the shortest distance principle. Determine whether there is a partition between the connector on the compartment and the corresponding target cross-plate connection point.

[0114] See Figure 6 A combination of board path optimization algorithm, region path optimization algorithm, and region path optimization algorithm is used to achieve path optimization for different boards. The specific process is as follows:

[0115] (a) Based on the cross-plate connection points defined in step S102, create a deck_link table: deck_link = [(d1,d2),(d1,d3),...,(dm,dn)];

[0116] (b) Construct an n×n deck road matrix, where deck road[di,dj] represents the deck road from deck di to deck dj. Query the deck adjacency list deck link; if (di,dj)∈deck link, then deck road[di,dj]=1. Then deck_road[di,dj] = IMF cannot cross decks. If a specified deck di or deck dj must pass through and (di,dj)∈deck_link, then deck_road[di,dj] = -10.

[0117] (c) Get the deck where the first connector is located as the starting end s_deck, get the deck where the last connector is located as the last end e_deck, use the Floyd algorithm to calculate the minimum path value of deck_road[s_deck,e_deck], and create the optimal deck path table opt_deckroadlist=[s_deck,di,...,e_deck] to store the decks traversed when the minimum path value is reached;

[0118] (d) Decompose the branch path into each deck in opt_deckroadlist and perform segmented path optimization in sequence. First, obtain the cross-deck connection point between s_deck and di. If there are multiple cross-deck connection points, calculate the distance to the head connector for each. Use the shortest distance principle to determine the selected cross-deck connection point deck_link_bi(pi1,pi2), where pi1 is the point on s_deck and pi2 is the point on di. With the head connector and pi1 as the head and end points, determine whether there is a partition between them on s_deck. If there is, call the path optimization algorithm combination for different areas of the same deck in step 7. If there is no partition, call the path optimization algorithm for the same area of ​​the same deck in step 6.

[0119] (e) Obtain the subsequent deck dj of di in opt_deckroadlist. Similarly, in process (d), obtain the deck di and deck dj closest to deck_link_bi(pi1,pi2) and the deck link point deck_link_bj(pj1,pj2). Using pi2 and pj1 as the starting and ending points, perform path optimization on di in the same way as in process (d). Continue in this manner until the path optimization of the e_deck branch segment where the end connector is located is completed. Complete the path optimization of different decks and add the path points to br1_points=(s_con1_p,p2,...,e_con1_p).

[0120] S106: Optimize the path for the secondary branch: Determine whether there is a duplicate of the first and / or last connectors of the secondary branch and the main branch. If there is no duplicate, calculate the distance between the non-duplicate first and / or last connectors and each main branch path point in the main branch path point table, and select the target path point with the shortest distance as the access point of the secondary branch; determine the access point for other secondary branches in sequence to complete the path optimization of the secondary branch.

[0121] In practice, step S106 follows the specific procedure as follows:

[0122] (a) Obtain branch br2 = (s_con2, e_con2) from cai = [br1, br2, ..., brm]. Determine if there is a duplicate of the connector between s_con2 and br1. If there is no duplicate, calculate the distance between each main branch path point in br1_points and s_con2. Take the path point with the shortest distance (excluding the first and last points) br1_pi as the access point of s_con2. If there is a duplicate, skip it and prohibit duplicate access. Similarly, perform e_con2 access. If there is no duplicate, access point br1_pj. If there is a duplicate, skip it.

[0123] (b) Using br1_pi and s_con2 as the first and last points, repeat steps S104 to S105 to complete the access path optimization for s_con2 and add the path points to br2s_points = (s_con2_p, p2, ..., br1_pi). Similarly, perform access path optimization for e_con2 and add the path points to br2e_points = (br1_pj, p2, ..., e_con_p).

[0124] (c) Sequentially connect other branches in cai = [br1, br2, ..., brm]. The connection point determination process requires searching all existing branches, including the main branch br1 and other branches such as br2s and br2e. Repeat the above operation to complete the optimization of the cai branch path and combine it with the main branch br1 to form the optimized path of cai.

[0125] S107: Execute steps S104 to S106 sequentially for other cable bundles in the cable network information table to complete path optimization for all cable bundles. That is, repeat steps S104 to S106 in sequence for other cable bundles in elec_list to complete path optimization for all cable bundles in elec_list.

[0126] In summary, the specific process of this embodiment is as follows: Figure 5 As shown, by reading the 3D satellite model, the affiliation of cable binding brackets, connectors, and panels is determined, and the attributes of penetration holes and cross-panel connection points are defined. A three-layer information table of cable network, cable bundles, and cable branches is constructed. Based on the first and last panels of the branches, the longest branch with different or the same panels is selected as the main branch. According to the distribution of the main branch panels, the path optimization algorithm based on the Floyd algorithm, the regional path optimization algorithm, and the regional path optimization algorithm are used to optimize the path in stages. The nearest access point is selected from the branches based on the main branch path. All cable bundles are processed iteratively to complete the path planning of the entire cable network.

[0127] This invention employs a step-by-step decomposition method, ultimately decomposing the problem into the smallest indivisible region. This simplifies the complex three-dimensional or multi-regional cable path optimization problem into a simple combination path optimization within a two-dimensional region, thereby simplifying and making feasible the satellite cable network path optimization problem.

[0128] This invention employs corresponding independent optimization algorithms for different decomposition stages, and uses different combinations of optimization algorithms to achieve full coverage and adaptability to different decomposition results, thereby obtaining optimized path search results.

[0129] This invention is applicable to the automatic optimization of satellite cable network paths that are laid out and installed based on the cabin panels, and can be extended to other spacecraft or equipment composed of cabin panels, thus possessing versatility.

[0130] This invention employs minimal human interaction, automates the path optimization process, effectively replaces the manual path setting process, significantly reduces the workload of designers, and improves the efficiency and quality of satellite cable network path design.

[0131] In a specific application example, the specific implementation steps are as follows:

[0132] 1. For example Figure 2 The system reads a 3D model of a satellite communication module and obtains the outline and position information of the south panel (12-0), north panel (13-0), middle panel (32-0), floor panel (11-0), south bulkhead (14-0), north bulkhead (15-0), 41 connectors, and 602 cable binding brackets. It also automatically classifies the electrical connectors and cable binding brackets according to the modules and areas within the modules.

[0133] 2. Define cable penetration holes TIES_14-1 and TIES_14-2 on the south bulkhead (14-0), define cable cross-plate connection points DECK_CONNECT_12_32-1 and DECK_CONNECT_12_32-2 between the south bulkhead (12-0) and the middle bulkhead (32-0), and define cable cross-plate connection points DECK_CONNECT_13_32-1 and DECK_CONNECT_13_32-2 between the north bulkhead (13-0) and the middle bulkhead (32-0);

[0134] 3. Read the cable branch relationship connection table. In this example, only the 12003 cable bundle is included. The cable bundle is automatically parsed.

[0135] 4. Start automatic cable path optimization:

[0136] (1) Set the maximum cable binding spacing to 280mm;

[0137] (2) Automatically determine the main branch and complete the main branch path optimization;

[0138] (3) Automatically complete all branch path optimization.

[0139] This invention also provides a multi-stage combined automatic optimization system for satellite three-dimensional cable network paths. The system is configured to implement the multi-stage combined automatic optimization method for satellite three-dimensional cable network paths as described in the above embodiments. Specifically, this system is configured to execute the steps of the method described in the above embodiments, and the specific steps are as previously described and will not be repeated here.

[0140] 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.

[0141] 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 multi-stage automatic optimization method for satellite three-dimensional cable network paths, characterized in that, Including the following steps: (a) Read the satellite's three-dimensional model and determine the relationship between the cable binding brackets and electrical connectors and the cabin panels through Boolean operations; (b) Define the cable penetration hole properties on the 3D model of the compartment and define the cable cross-compartment connection point properties on the brackets belonging to the two compartments. (c) Read the cable connection relationship table and construct a three-level information table; the three-level information table includes the cable network information table elec_list={ca1,ca2,...,can}, the cable bundle information table cai=[br1,br2,...,brm] and the cable branch information table brj=(s_conj,e_conj); s_conj is the first end connector of branch j, and e_conj is the last end connector of branch j; (d) Determine the main branch of the cable bundle: Based on whether the beginning and end of the branch belong to the same compartment, create a list of branches on the same board corresponding to the cable bundle: cai_slist1 = [(s_conm, e_conm, l m )] and the heterogeneous branch list cai_slist2=[(s_conn,e_conn,l n )], where l m The spatial distance between the front and rear connectors of corresponding branches on the same compartment plate, l n Spacing between the front and rear connectors of different compartment branches; If the heterogeneous branch list is empty, then l m The largest branch on the same board is taken as the main branch; If the heterogeneous branch list is not empty, then l n The largest cross-board branch is designated as the main branch; (e) Based on the membership relationship, determine the compartment to which the first and last connectors of the main branch belong, and perform path optimization for the main branch based on the belonging compartment: If the first and last connectors belong to the same compartment and the same area, then the intra-area path optimization algorithm based on the Floyd algorithm is called to optimize the cable path. If the first and last connectors belong to different areas of the same compartment, the branch is decomposed into g+1 segments based on the number of partitions g between the first and last connectors, and the area path optimization algorithm and the intra-area path optimization algorithm are called to optimize the cable path in stages. If the first and last connectors belong to different compartments, the board path optimization algorithm, the area path optimization algorithm, and the area path optimization algorithm are called to optimize the cable path in stages. Create a main branch path point table to store all optimized path points; (f) Perform path optimization on the branch: Determine whether there is a duplicate of the first and / or last connectors of the branch and the main branch. If there is no duplicate, calculate the distance between the first and / or last connectors and each main branch path point in the main branch path point table, and select the target path point with the shortest distance as the access point of the branch. The access points for other branches are determined sequentially to complete the branch path optimization. (g) Steps (d) to (f) are executed sequentially for other cable bundles in the cable network information table to complete the path optimization for all cable bundles.

2. The multi-stage combined automatic optimization method for satellite three-dimensional cable network paths according to claim 1, characterized in that, The path optimization algorithm within the region includes: Obtain the coordinates of electrical connectors and cable tie brackets belonging to the optimization area to create a list of path optimization coordinates; Construct an n×n distance matrix dist, where dist[i,j] represents the shortest distance from point i to point j. When there are no obstacles between two points and the distance is less than or equal to the maximum binding spacing, dist[i,j] is equal to the actual calculated distance; otherwise, dist[i,j] is infinite and unreachable. The Floyd algorithm is used to calculate the shortest obstacle avoidance path between the first and last ends.

3. The multi-stage combined automatic optimization method for satellite three-dimensional cable network paths according to claim 1, characterized in that, The process involves decomposing the branch into g+1 segments based on the number of partitions g between the first and last connectors, and then using the regional path optimization algorithm and the intra-regional path optimization algorithm to optimize the cable path in stages, including: Based on the number of partitions g between the first and last connectors, the branch is divided into g+1 regions. Starting from the initial region where the first connector is located and ending at the g+1th region where the last connector is located, the region path is optimized and a region path table is created. Starting from the initial region, select the shortest cable penetration hole on the corresponding partition for each adjacent region and add it to the region access table; Based on the regional pathway table, the path optimization algorithm within each region is sequentially invoked to perform path optimization for each stage within the region.

4. The multi-stage combined automatic optimization method for satellite three-dimensional cable network paths according to claim 1, characterized in that, The call board path optimization algorithm, regional path optimization algorithm, and regional path optimization algorithm are used to optimize cable paths in stages, including: Based on the defined cross-plate connection points, create a deck_link table: deck_link = [(d1,d2),(d1,d3),...,(dm,dn)]. Construct an n×n deck road matrix, where deck road[di,dj] represents the deck road from deck di to deck dj. If (di,dj)∈deck_link, then deck road[di,dj]=1; otherwise, deck road[di,dj]=IMF, where IMF is infinity. If a specified deck di or deck dj must pass through and (di,dj)∈deck_link, then deck road[di,dj]=-10. The Floyd algorithm is used to calculate the minimum path value between the forward and end panels, and an optimized panel path table is generated. The branch path is decomposed into each compartment in the optimization board path table and segmented path optimization is performed sequentially. It is determined whether there is a partition on the path to be optimized. If there is, the regional path optimization algorithm and the regional path optimization algorithm are called to optimize the cable path in stages. If there is no partition, the regional path optimization algorithm is called to optimize the cable path.

5. The multi-stage combined automatic optimization method for satellite three-dimensional cable network paths according to claim 4, characterized in that, The determination of whether there is a partition on the path to be optimized includes: Obtain the cross-plate connection point between adjacent panels. If there are multiple cross-plate connection points, select the target cross-plate connection point according to the shortest distance principle. Determine whether there is a partition between the connector on the cabin plate and the corresponding target cross-plate connection point.

6. The multi-stage combined automatic optimization method for satellite three-dimensional cable network paths according to claim 1, characterized in that, The determination of membership includes: The fit between the cable binding bracket, electrical connector and the cabin plate is determined by Boolean operation of the model; Based on the aforementioned fit, the cable binding brackets and electrical connectors are assigned to their respective compartments.

7. A multi-stage combined automatic optimization system for satellite three-dimensional cable network paths, characterized in that, The system is configured to implement the method as described in any one of claims 1 to 6.

Images