A harness three-dimensional model design method, an intelligent terminal and a storage medium

Abstract

The application discloses a kind of based on graph search and path multiplexing wire harness three-dimensional model design method, intelligent terminal and storage medium, it is applied to the technical field of digital industrial design service, including the following steps: obtaining the voxel data corresponding to each component of complex equipment, by establishing the mapping relationship between voxel coordinates and physical coordinates, projection point is obtained;According to voxel data and projection point, and cross sheet metal path and sheet metal internal path, construct high-level adjacency graph, by executing path search, obtain the current path;The voxel data corresponding to the existing wire harness path or the multiplexed path is discounted, and the candidate path is obtained, which is spliced or updated with the current path to generate the wire harness three-dimensional model of complex equipment.The application realizes the generation of wire harness three-dimensional model with cross-domain adaptation, full-automatic generation and multi-constraint intelligent optimization, and has important engineering application value.

Description

Technical Field

[0001] This invention relates to the field of digital industrial design service technology, and more specifically, to a method for designing three-dimensional digital models of wire harnesses based on graph search and path reuse, an intelligent terminal, and a storage medium. Background Technology

[0002] In the field of digital industrial design service technology, electrical wiring harnesses are core components for power and signal transmission in various functional modules of complex equipment. 3D model design of wiring harnesses is a crucial step in the digital R&D of equipment, and its design quality directly determines the electrical performance, manufacturing and maintenance capabilities of the equipment, while also affecting weight control and spatial layout. Currently, 3D modeling of wiring harnesses mainly relies on manual design, which suffers from core problems such as strong dependence on experience, low efficiency, high iteration costs, poor quality consistency, and insufficient versatility. Therefore, there is an urgent need to design a cross-domain adaptable, fully automated, and multi-constraint intelligent optimization technology for generating 3D models of wiring harnesses, which has significant engineering application value. Summary of the Invention

[0003] To address the aforementioned issues, the present invention aims to provide a wire harness 3D digital model design method based on graph search and path reuse, applicable to the field of digital industrial design service technology. This method aims to solve the current problems in the field of wire harness 3D design, which lack a universal design solution that is cross-domain, fully automated, and intelligent, and cannot take into account multiple constraints such as geometric structure, engineering specifications, and process, making it difficult to eradicate various industry pain points of traditional design.

[0004] To achieve the above technical objectives, this application provides a method for designing 3D digital models of wire harnesses based on graph search and path reuse in the field of digital industrial design service technology, comprising the following steps: Obtain voxel data corresponding to each component of complex equipment, and obtain projection points by establishing the mapping relationship between voxel coordinates and physical coordinates; Based on the voxel data and projection points, as well as the sheet metal path and the path within the sheet metal, a high-level adjacency graph is constructed, and the current path is obtained by performing a path search. Discounting is performed on the voxel data corresponding to existing or reused wire harness paths to obtain candidate paths, which are then spliced ​​or updated with the current path to generate a 3D digital model of the wire harness for complex equipment.

[0005] Preferably, during the construction of the high-level adjacency graph, the harness start-point node and harness end-point node of the high-level adjacency graph are generated based on the point configuration file of the complex equipment and the assembly SDF metadata initialization graph.

[0006] Preferably, in the process of constructing the high-level adjacency graph, the paths between sheet metal parts are used as connection points and connection edges to generate the high-level adjacency graph.

[0007] Preferably, in the process of constructing the high-level adjacency graph, the high-level adjacency graph is generated by using the projection points and projection edges corresponding to the endpoint projection paths.

[0008] Preferably, in the process of constructing the high-level adjacency graph, the surface paths between projection points and connection points on the same sheet metal are used as graph edges to generate the high-level adjacency graph.

[0009] Preferably, in the process of constructing the high-level adjacency graph, a graph search method is used, which combines voxel movement cost, SDF obstacle avoidance penalty and safe distance constraint to filter out impassable paths.

[0010] Preferably, when obtaining candidate paths, when a harness accepts the reuse of a path voxel, projection point, or connection channel of another harness, the two are grouped into the same harness group to form a grouping relationship, and this grouping relationship is maintained in subsequent iterations to generate candidate paths.

[0011] Preferably, when obtaining candidate paths, the small wire harness group is given priority to try existing paths or common paths connecting the large wire harness group. If the candidate path obtained by re-searching based on the discounted voxels of the large wire harness group can reduce the overall cost, then the path is accepted as the result and grouping and merging are performed to generate candidate paths.

[0012] Preferably, when performing splicing or updating, the graph edge paths between each adjacent node are read sequentially according to the node sequence obtained by searching the high-level adjacency graph, and spliced ​​or updated into complete voxel paths according to the connection relationship of the starting projection path, sheet metal surface path, cross sheet metal path, and ending projection path to generate a three-dimensional digital model of the wire harness.

[0013] Preferably, when splicing the complete boolean path, when the path passes through multiple sheet metal pieces, the sheet metal surface path and the cross-sheet metal path corresponding to the selected edge are spliced ​​in sequence, and duplicate connection points are removed at the connection points of each path segment to form a path point sequence, so as to generate a three-dimensional digital model of the wire harness.

[0014] Based on the same inventive concept, this application also provides a smart terminal, including: a memory and a processor, wherein the memory stores a wire harness three-dimensional digital model design program, and when the wire harness three-dimensional digital model design program is executed by the processor, it implements the steps of the method described above.

[0015] Based on the same inventive concept, this application also provides a storage medium storing a computer program that, when executed by a processor, implements the steps of the method described above.

[0016] This application utilizes graph search and path reuse technology to conduct 3D digital model design of wire harnesses. By leveraging voxel data processing, adjacency graph construction, path search, and reuse splicing processes, it achieves automation and intelligence throughout the entire wire harness design process. It effectively adapts to multiple constraints such as geometric structure, engineering specifications, and production processes, breaking through the limitations of traditional design modes. It not only improves the efficiency of wire harness path planning and digital model construction but also ensures the compliance and practicality of the design results. It systematically solves the pain points of the lack of universal intelligent design solutions and the difficulty in balancing multiple constraints in the industry.

[0017] This invention solves the problems of low automation and excessive manual intervention in wire harness design, and realizes full-process automation from connection definition to three-dimensional digital model.

[0018] This invention significantly shortens the design cycle and reduces reliance on manpower, achieving a dual optimization of design efficiency and cost.

[0019] This invention addresses the pain points of slow response to design changes and high global rework costs, and enables automatic iteration of the model as requirements change.

[0020] This invention solves the problems of poor cross-domain applicability and strong platform binding of existing tools, and has the ability to adapt to multiple domains and platforms. Attached Figure Description

[0021] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0022] Figure 1 This is a schematic diagram illustrating the execution logic of the method described in this invention.

[0023] Figure 2 This is a schematic diagram of the method described in this invention. Detailed Implementation

[0024] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. The components of the embodiments of this application described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of this application provided in the accompanying drawings is not intended to limit the scope of the claimed application, but merely represents selected embodiments of this application. All other embodiments obtained by those skilled in the art based on the embodiments of this application without inventive effort are within the scope of protection of this application.

[0025] First Embodiment like Figures 1-2 As shown, this invention provides a wire harness 3D digital model design method based on graph search and path reuse in the field of digital industrial design service technology. It consists of six stages: data preprocessing, path element generation, graph construction, global path search, path reuse optimization, and 3D curve generation.

[0026] In one embodiment, this invention addresses the automatic generation of 3D digital models of complex equipment wiring harnesses. Input data includes a 3D CAD model of the complex equipment, start and end point coordinate configurations, wiring harness planning parameters, and an output directory. Output data includes a high-level path diagram, voxel path files, optimized wiring harness path files, and STEP 3D curve files readable by CAD software. CAD stands for Computer Aided Design. STEP (Standard for the Exchange of Product Model Data) is an internationally recognized standard for 3D digital model / product data exchange (ISO 10303), primarily used for transferring 3D models, geometric information, assembly structures, attributes, and other data between different CAD, CAE, and CAM software. It solves the problems of incompatibility between different design software formats and the loss of model features, and is the mainstream format for cross-software interaction of 3D models of wiring harnesses and components in industries such as machinery, automotive, and aerospace. Exemplarily, in this application, "path" refers to a wiring harness path.

[0027] Step S1000 Data Preprocessing Stage: 3D Digital Model Voxelization and SDF (Signed Distance Field) Generation.

[0028] In one embodiment, step S1000 involves inputting a 3D CAD model; converting the 3D CAD model into voxel data; generating assembly SDF and obstacle SDF based on the voxel data; extracting walkable surface voxels; and establishing a mapping relationship between physical coordinates and voxel coordinates to obtain projection points. For example, in a computer-aided design scenario, SDF (Signed Distance Field) is an implicit geometric representation that maps each point in 3D space to the distance to the nearest geometric surface, with a sign. For instance, a point outside represents a positive distance, a point on a surface represents a distance of 0, and a point inside represents a negative distance. SDF is a voxelized field description, a distance function expression.

[0029] For example, the present invention first decomposes, triangulates, and voxels the input complex equipment STEP model to generate voxel data corresponding to each component. Then, the voxel data is assembled to form an assembly voxel model, and the assembly SDF and obstacle SDF are calculated. The assembly SDF is used to determine whether the path crosses the structural entity, and the obstacle SDF is used to calculate the safe distance between the wiring harness and the obstacle and form a penalty term. Subsequently, the collapsible voxel coordinates are extracted from the sheet metal surface or the routeable area to form a candidate space for subsequent path search.

[0030] For example, the present invention reads the STEP format three-dimensional digital model of complex equipment, splits the assembly into multiple component shapes, meshes each shape and converts it into voxel data, and saves it as an NPZ format voxel file; then assembles multiple voxel files into an assembly voxel model, generating an assembly SDF file and an obstacle SDF file, wherein the assembly SDF is used for collision detection; and the obstacle SDF is used for safe distance checking.

[0031] For example, the present invention maps voxel coordinates to physical coordinates by converting them to each other using origin and voxel_size, and uses this mapping to maintain coordinate consistency when performing path search, path splicing and curve output.

[0032] For example, origin is the origin / starting point of the voxel coordinate system, used to represent the initial three-dimensional coordinates of the entire voxel grid in the world coordinate system, wherein the grid coordinates of all voxels are offset based on this origin.

[0033] For example, voxel_size is the voxel size, which is used to control the precision of 3D spatial discretization. The smaller the value, the finer the voxel, the higher the resolution, and the greater the computational cost; the larger the value, the more drastic the downsampling, the faster the speed, and the more details are lost. Its role is to determine the granularity of voxelization, rasterization, and downsampling.

[0034] For example, the present invention converts continuous CAD geometry into a computable discrete voxel space, enabling collision detection, safety clearance judgment, and surface constraints to be performed in a unified coordinate system, thereby solving the problem of relying on manual identification of avoidance space and routing paths in traditional CAD environments.

[0035] Step S1001: Extraction of voxels from the traceable surface.

[0036] In one embodiment, step S1001 obtains a traceable surface file based on the surface voxel data of the sheet metal or support structure, wherein each traceable surface file contains the voxel coordinates of the sheet metal area that is passable.

[0037] For example, the present invention transforms the engineering constraints that the wire harness should be arranged along the sheet metal or support structure into a discrete set of walkable voxels, thereby restricting the subsequent surface path search to the walkable area.

[0038] Step S1002: Generate the path element between sheet metal parts.

[0039] In step S1002 of one embodiment, the BFS distance field file, the runnable surface voxel file, and the assembly SDF file are loaded, and a mapping between the BFS file and the surface voxel file is established according to the sheet metal number. For sheet metal pairs composed of different sheet metals, cross-sheet metal path calculation tasks are established respectively. Each task reads the starting sheet metal voxel, the target sheet metal voxel, and the BFS distance field, combines the SDF to determine the collision or safety distance, calculates the connection path between sheet metals and its length, and stores the obtained path element, wherein the path element is used to represent the feasible connection between discontinuous runnable areas.

[0040] For example, BFS stands for Breadth-First Search, and a BFS distance field file indicates that the algorithm used to generate this distance field is breadth-first search.

[0041] Step S1003: Generate the projection path element from the endpoint to the sheet metal.

[0042] In step S1003 of one embodiment, the start point and end point are read from the point configuration file and converted into voxel coordinates.

[0043] For example, for each sheet metal piece, a projection search from the endpoint to the sheet metal surface is performed using a shared dynamic path cost map by loading the corresponding routeable surface coordinates and BFS distance field.

[0044] For example, voxels that have been used by the projection path are recorded in the path cost map, and subsequent projection paths are guided to reuse existing channels, thereby forming a local bundle merging trend and storing the projection path results.

[0045] In one embodiment, steps S1001 to S1003 are the path element generation stage.

[0046] Step S1004: Graph construction stage of high-level adjacency graph: initial graph construction and edge supplementation of high-level adjacency graph.

[0047] In step S1004 of one embodiment, a high-level adjacency graph is constructed based on voxel data and projection points.

[0048] For example, using the assembly SDF metadata generated from voxel data, an initial graph is constructed with the point configuration file of the complex equipment to obtain the starting node and ending node of the harness; based on the inter-sheet metal path elements and the projection path elements from the endpoint to the sheet metal obtained through steps S1001 to S1003, graph edge supplementation is performed.

[0049] For example, the paths between sheet metal parts are added as connection points and connection edges to the initial drawing to form a high-level adjacency graph.

[0050] For example, the projection points and projection edges corresponding to the endpoint projection paths are added to the initial graph to form a higher-level adjacency graph.

[0051] For example, a high-level adjacency graph is formed by calculating the surface paths between projection points and connection points on the same sheet metal and writing these surface paths into the graph edges of the initial graph.

[0052] For example, the graph nodes of the high-level adjacency graph include harness start point, harness end point, projection point, and connection point; the graph edges of the high-level adjacency graph include projection path, sheet metal path, and sheet metal surface path; the graph edge weight of the high-level adjacency graph is the corresponding path length or path cost.

[0053] Step S1005 is the calculation of the path on the sheet metal surface.

[0054] In step S1005 of one embodiment, for each sheet metal, the projection points and connection points belonging to the sheet metal are extracted from the high-level adjacency graph, and path planning is performed within the set of voxels on the traceable surface of the sheet metal.

[0055] For example, during the search, a 26-neighborhood movement direction is used, and the movement cost is calculated based on the movement distance in a straight line, face diagonal, and volume diagonal. At the same time, the SDF value is read, and an impassable penalty is imposed on voxels that enter the interior of the obstacle, and a progressive penalty is imposed on voxels that are less than the safe distance.

[0056] For example, the safety distance is calculated from the harness radius, safety gap and voxel size, the penalty inside the obstacle is the maximum value, and the penalty within the safety distance increases as the SDF distance decreases.

[0057] Step S1006: Path search of the high-level adjacency graph.

[0058] In step S1006 of one embodiment, graph_adjacency6 is read and an adjacency list for Dijkstra search is constructed.

[0059] For example, for each endpoint, the system calculates the shortest path starting from the starting node; the endpoint node is only used as the target node and not as an intermediate transition node for other paths, so as to avoid the harness path passing through non-target connectors. The searched node sequence is restored to the voxel path of the corresponding high-level adjacency graph edge and saved as the initial solution.

[0060] In one embodiment, through the design of steps S1003 to S1006 above, the present invention generates projection path elements for connecting endpoints and sheet metal areas; generates connection path elements for between sheet metals and within sheet metals; abstracts the path elements as weighted graph edges of a high-level adjacency graph; abstracts endpoints, projection points, and connection points as graph nodes of a high-level adjacency graph; and searches for harness paths from the starting point to each endpoint on the high-level adjacency graph.

[0061] In one embodiment, through the design of steps S1003 to S1006 above, the present invention does not directly search all wire harness paths in the complete three-dimensional space at once. Instead, it first generates constraint path elements that can be reused by high-level planning, including projection paths from endpoints to the sheet metal walkable areas, cross-region connection paths between sheet metals, and surface paths between projection points and connection points on the same sheet metal surface. When generating the above path elements, BFS distance field, heuristic cost search, shortest path search, or equivalent graph search methods are used, combined with voxel movement cost, SDF obstacle avoidance penalty, and safety distance constraints, to filter out impassable paths, and write the path geometry, path length, endpoints, and the sheet metal area to which they belong into the graph edges of the high-level adjacency graph. Then, the high-level adjacency graph is constructed with the start point, end point, projection point, and connection point as graph nodes of the high-level adjacency graph, and the constraint path elements as graph edges of the high-level adjacency graph, and path search is performed on the high-level adjacency graph.

[0062] For example, the present invention breaks down complex wiring harness planning into two levels: "local geometric feasibility calculation" and "global topology path selection", which reduces the difficulty of combination search when wiring across discontinuous sheet metal areas.

[0063] In one embodiment, steps S1005 to S1006 are the global path search phase.

[0064] Step S1007: Path reuse and grouping optimization.

[0065] In step S1007 of one embodiment, voxels and projection points used in existing harness paths are extracted, and the corresponding path memory, cost map and harness grouping relationship are maintained.

[0066] For example, for the current harness to be optimized, this invention first sets the voxels that have been used or reused by other harnesses as discounted costs, and then re-searches for candidate paths for the current harness based on the discounted cost map. These candidate paths can either pass through existing path voxels for reuse, or explore new voxels when existing paths cannot form a better connection. This invention compares the cost of the candidate path with the cost of the current path, accepting the candidate path only when its cost is lower, and updating the path memory and cost map accordingly. When a harness accepts the reuse of a path voxel, projection point, or connection channel of another harness, both are grouped into the same harness group to form a grouping relationship, which is maintained in subsequent iterations. This invention prioritizes smaller harness groups trying to connect to existing paths or common paths of larger harness groups. If a candidate path obtained by re-searching based on the discounted voxels of the larger harness group can reduce the overall cost, then the path is accepted as the result and group merging is performed. By repeating the above process, the present invention allows shorter branches to gradually converge toward existing common trunk paths, and multiple small wire harness groups to gradually merge into larger common trunk wire harness groups, while retaining the ability to search for new channels.

[0067] Step S1008, path splicing.

[0068] In step S1008 of one embodiment, for each endpoint line bundle, the graph edge path between each adjacent node is read sequentially according to the node sequence obtained by searching the high-level adjacency graph, and the complete voxel path is spliced ​​according to the connection relationship of the starting point projection path, sheet metal surface path, cross sheet metal path, and endpoint projection path; when the path passes through multiple sheet metals, the sheet metal surface path and cross sheet metal path corresponding to the graph edge of the selected high-level adjacency graph are spliced ​​sequentially, and duplicate connection points are removed at the connection of each path segment to form an output path point sequence.

[0069] In one embodiment, in the design of steps S1007 to S1008, the present invention records the voxels corresponding to existing harness paths or reused paths; discounts the passage cost of the voxels; re-searches for candidate paths for the current harness based on the discounted cost map; compares the cost of the candidate path with the cost of the current path; accepts the candidate path and updates the path memory when the cost of the candidate path is lower; establishes or updates harness groups according to the accepted reuse relationship; enables smaller harness groups to perform candidate reuse replanning based on the path memory of larger harness groups; performs group merging when the candidate paths between groups reduce the overall cost; and outputs a harness network containing common trunk paths and branch paths.

[0070] In one embodiment, through the design of steps S1007 to S1008, the present invention maintains the path cost map, path memory, and wire harness grouping relationship during the endpoint projection, sheet metal surface path calculation, and final wire harness path optimization processes.

[0071] For example, the present invention first records voxels that have been used or reused by other harnesses, and discounts the cost of these voxels in the cost map, making them more likely to be traversed in subsequent harness searches. Then, for the current harness, a path search is performed again using the discounted cost map, so that the current harness can reuse low-cost voxels in existing paths and continue to explore new voxel channels when necessary. The system compares the cost of the candidate paths obtained from the replanning with the original path of the current harness. Only when the total cost of the candidate path is lower than the cost of the current path is the candidate path accepted, and the path memory and cost map are updated simultaneously.

[0072] For example, based on candidate reuse replanning, the present invention further introduces the idea of ​​grouping and merging: when a wire harness reuses the path voxel, projection point or connection channel of another wire harness through a candidate path, and the candidate path is accepted, the two wire harnesses are assigned to the same wire harness group; the wire harness groups that have formed a reuse relationship maintain the grouping relationship in subsequent iterations, so as to avoid the wire harnesses being frequently split and re-merged in repeated optimization.

[0073] For example, after the wire harness group is formed, the present invention organizes subsequent optimization according to the group size, so that the smaller wire harness group will preferentially try to connect to the existing path or common path of the larger wire harness group; if the candidate path obtained by re-searching based on the discounted voxel of the larger wire harness group can reduce the overall cost of the current wire harness or the current wire harness group, the merging result is accepted and the smaller wire harness group is merged into the larger wire harness group.

[0074] For example, after completing the inter-group merging, the present invention can also continue to perform candidate reuse replanning within the same harness group, so that the branches within the group move further toward the common trunk path.

[0075] For example, the present invention weighs the costs among “reduced cost of existing path voxels”, “new voxels can still be explored”, and “accepted reuse relationships are stably preserved”; by replanning candidate reuses to form local shared paths, and by combining and gradually expanding the local shared paths into a more stable common trunk bundle structure, the present invention solves the problems of path dispersion, unstable common trunk, low material utilization and inconvenient subsequent assembly caused by independent planning of multiple bundles.

[0076] In one embodiment, steps S1007 to S1008 are the path reuse optimization stage.

[0077] Step S1009: Three-dimensional curve digital model generation stage.

[0078] In step S1009 of one embodiment, the present invention converts the voxel path into physical space coordinates according to physical_coord=voxel_coord*voxel_size+origin; duplicate points and overly close points are deleted from the path points, outliers are removed using the Z-score method based on the distance between adjacent points, and then a moving average is performed for smoothing; subsequently, cubic B-splines are used for global fitting, the smoothing factor is adaptively calculated according to the number of path points and the average distance between adjacent points, and after fitting, the first and last points of the fitted curve are forcibly corrected to the first and last points of the original path; finally, the system creates B-spline edges through OpenCASCADE, writes out a single wire harness STEP file, and can further merge multiple STEP files to form a complete wire harness 3D digital model.

[0079] For example, physical_coord=voxel_coord*voxel_size+origin is a coordinate transformation formula for three-dimensional volume data (CT, MRI, point cloud, and 3D mesh, etc.), which is used to convert the voxel index coordinates in computer memory into real physical coordinates in the real world.

[0080] Second Embodiment Please refer to Figure 2 This application provides a method for designing 3D digital models of wire harnesses based on graph search and path reuse in the field of digital industrial design service technology, including the following steps: Obtain voxel data corresponding to each component of complex equipment, and obtain projection points by establishing the mapping relationship between voxel coordinates and physical coordinates; Based on the voxel data and projection points, a high-level adjacency graph is constructed, and the current path is obtained by performing a path search. Discounting is performed on the voxel data corresponding to existing or reused wire harness paths to obtain candidate paths, which are then stitched together with the current path to generate a 3D digital model of the wire harness for complex equipment.

[0081] For example, voxel data is three-dimensional spatial unit data formed by spatially meshing complex equipment parts, which can accurately represent the spatial shape of the parts; projection points are spatial corresponding points obtained by mapping and converting voxel coordinates to physical coordinates; high-level adjacency graph is a spatial topological association model built on voxels and projection points.

[0082] For example, firstly, by collecting voxel data of complex equipment components, a mapping relationship between voxel coordinates and physical coordinates is established to generate projection points. This step can accurately reconstruct the real spatial structure of the equipment, providing a reliable spatial data foundation for subsequent path planning. Secondly, a high-level adjacency graph is constructed by combining voxel data and projection points, and path search is carried out. Based on the topology model, the initial path planning of the harness is completed, which can quickly plan the harness direction that meets the spatial geometric requirements. Finally, the voxel data of the existing harness reuse path is discounted to obtain candidate paths, which are then stitched with the current path to generate a complete 3D digital model. This not only significantly reduces the amount of repetitive design work and improves design efficiency through path reuse, but also optimizes path adaptability through data discounting, so that the final digital model simultaneously conforms to the geometric structure, engineering specifications, and process requirements.

[0083] Preferably, during the construction of the high-level adjacency graph, an initial graph is obtained based on the point configuration file of the complex equipment and the assembly SDF metadata initialization graph, and the harness start node and harness end node of the high-level adjacency graph are generated.

[0084] For example, when constructing a high-level adjacency graph, the point configuration file of the complex equipment and the assembly SDF metadata are retrieved to complete the graph structure initialization, obtaining an initial graph to determine the start and end nodes of the wiring harness layout. This approach can accurately locate the wiring harness layout boundary based on standardized metadata, standardize the node generation logic, ensure that the adjacency graph is consistent with the actual equipment assembly standards and design requirements, and improve the accuracy and standardization of path search.

[0085] Preferably, in the process of constructing the high-level adjacency graph, the paths between sheet metal parts are used as connection points and connection edges to generate the high-level adjacency graph.

[0086] For example, when constructing a high-level adjacency graph, the paths between sheet metal parts are set as connecting nodes and connecting edges in the graph structure to improve the overall topology. This method closely matches the actual assembly space characteristics of the equipment, accurately reproducing the wiring channels formed by the sheet metal structure, making the adjacency graph more consistent with real working conditions. It not only ensures that the wiring harness path planning meets the spatial layout requirements, but also effectively avoids structural interference, further improving the rationality and feasibility of path search results.

[0087] Preferably, in the process of constructing the high-level adjacency graph, the high-level adjacency graph is generated by using the projection points and projection edges corresponding to the endpoint projection paths.

[0088] For example, when building a high-level adjacency graph, the projection points and edges corresponding to the projection paths of the harness endpoints are used as core topology building elements to construct a complete high-level adjacency graph topology structure, replacing the traditional coarse spatial modeling method. This method constructs the graph structure based on accurate coordinate projection data, which can accurately anchor the spatial position of the harness endpoints and the wiring extension trajectory, refine the topological details of the adjacency graph, effectively eliminate spatial modeling deviations, and ensure that the constructed topology model fully conforms to the physical spatial layout of the equipment and the wiring harness layout logic. This significantly improves the accuracy and continuity of subsequent path searches, avoids problems such as path breakpoints, wiring offsets, and poor spatial adaptability, and provides accurate topological support for generating three-dimensional wiring harness paths that conform to actual assembly conditions.

[0089] Preferably, in the process of constructing the high-level adjacency graph, the surface paths between projection points and connection points on the same sheet metal are used as graph edges to generate the high-level adjacency graph.

[0090] For example, when constructing a high-level adjacency graph, the paths between projection points and connection points on the same sheet metal surface are defined as edges in the graph structure, thus completing the construction of the adjacency graph. This method closely follows the actual wiring space and routing patterns on the sheet metal surface, improves the topological connection relationships, and allows the model to highly reproduce the on-site wiring conditions. This ensures that the planned wire harness paths conform to the sheet metal surface layout requirements, avoids spatial conflicts, and makes subsequent path search results more consistent with engineering realities, thereby improving the practicality and design accuracy of the wire harness digital model.

[0091] Preferably, in the process of constructing the high-level adjacency graph, a graph search method is used, which combines voxel movement cost, SDF obstacle avoidance penalty and safe distance constraint to filter out impassable paths.

[0092] For example, when constructing a high-level adjacency graph, a graph search algorithm is used to comprehensively consider voxel movement costs, SDF obstacle avoidance penalties, and safe distance constraints to filter and eliminate various paths, removing those that cannot be properly routed. This approach controls the rationality of paths from multiple dimensions, including spatial access costs, obstacle avoidance, and wiring safety standards, effectively avoiding structural obstacles in equipment, ensuring that wiring harnesses maintain compliant spacing with surrounding components, significantly improving the safety and feasibility of path planning, and reducing the workload of subsequent design modifications.

[0093] Preferably, when obtaining candidate paths, when a harness accepts the reuse of a path voxel, projection point, or connection channel of another harness, the two are grouped into the same harness group to form a grouping relationship, and this grouping relationship is maintained in subsequent iterations to generate candidate paths.

[0094] For example, during the extraction of candidate paths, if a harness reuses the path voxels, projection points, or connection channels of other harnesses, the two are grouped into the same harness group, and the grouping relationship is fixed. Subsequent iterations are then performed based on this group to generate candidate paths. This approach can lock the associated layout logic between harnesses, ensuring that reused paths remain consistent in iterative design, avoiding routing errors and connection failures. At the same time, relying on group management simplifies the path selection process, further improving the regularity of candidate paths and overall design efficiency.

[0095] Preferably, when obtaining candidate paths, the small wire harness group is given priority to try existing paths or common paths connecting the large wire harness group. If the candidate path obtained by re-searching based on the discounted voxels of the large wire harness group can reduce the overall cost, then the path is accepted as the result and grouping and merging are performed to generate candidate paths.

[0096] For example, existing paths and shared trunk channels for connecting small harness groups to large harness groups are prioritized. A new path search is then conducted using discounted voxels from the large harness group. When a newly generated path reduces the overall deployment cost, that path is adopted, and the harness groups are merged. This strategy follows the engineering principles of harness deployment, rationally achieves path reuse, effectively reduces overall cabling costs, optimizes space utilization, and simplifies the topology through grouping and merging, ensuring that the final candidate path balances economy and rationality.

[0097] Preferably, during the splicing process, the graph edge paths between adjacent nodes are read sequentially according to the node sequence obtained by searching the high-level adjacency graph, and the complete voxel path is spliced ​​according to the connection relationship of the starting projection path, sheet metal surface path, cross sheet metal path, and ending projection path to generate a three-dimensional digital model of the wire harness.

[0098] For example, during path splicing, the node sequence output from the high-level adjacency graph is used to sequentially retrieve the graph edge paths between adjacent nodes. The entire voxel path is then spliced ​​according to the predetermined logic of the starting projection path, sheet metal surface path, cross-sheet metal path, and ending projection path, ultimately constructing a 3D model of the wiring harness. This method follows the actual wiring configuration and spatial orientation of the equipment, systematically integrating different types of wiring paths to ensure overall wiring continuity and neat connections. It effectively avoids problems such as path misalignment and inconsistencies in connection with operating conditions, ensuring that the generated 3D model highly matches the on-site assembly requirements and improving the model's accuracy and engineering practicality.

[0099] Preferably, when splicing the complete boolean path, when the path passes through multiple sheet metal pieces, the sheet metal surface path and the cross-sheet metal path corresponding to the selected edge are spliced ​​in sequence, and duplicate connection points are removed at the connection points of each path segment to form a path point sequence, so as to generate a three-dimensional digital model of the wire harness.

[0100] For example, if the wiring harness path traverses multiple sheet metal parts, the sheet metal surface paths corresponding to the drawing edges and the cross-sheet metal paths will be combined sequentially. Duplicate connection points will be removed at the junctions of each path segment to form a complete sequence of path points before constructing the 3D model of the wiring harness. This operation streamlines the routing logic across multiple sheet metal areas, simplifies path nodes, avoids redundancy and routing bottlenecks, and ensures a continuous and smooth overall path with a concise structure. This further improves the regularity and spatial fit of the 3D model, and also guarantees the smooth progress of subsequent simulation and assembly work.

[0101] In one embodiment, the present invention splices the voxel paths obtained by graph search in the order of "starting point projection path, sheet metal surface path, cross-sheet metal path, and ending point projection path," removes duplicate points at the connection points, and converts the voxel coordinates into physical space coordinates based on the voxel origin and voxel dimensions. Subsequently, duplicate points are removed, outliers are detected, moving average smoothing is applied, and cubic B-spline fitting is performed on the path points, forcibly maintaining the starting and ending points of the fitted curve consistent with the original path. Finally, B-spline edges are generated through OpenCASCADE and a STEP file is output. This innovation allows the planning results to go beyond a sequence of path points and automatically form a 3D line harness curve model that can be imported into CAD software. Its main key operations include: splicing the projection path elements, sheet metal surface path elements, and cross-sheet metal path elements selected by graph search; converting voxel coordinates into physical coordinates; cleaning and smoothing the path points; performing B-spline fitting on the cleaned path points while preserving the endpoints; and outputting a 3D curve file that can be read by CAD.

[0102] To address the problems in existing technologies, such as the need to manually specify the start point, end point, and waypoints in the CAD environment, the software only generating a single geometric path based on preset rules, and the need for manual completion of branch structures, auxiliary features, and avoidance adjustments, this invention achieves a one-click interactive mode from connector selection and parameter configuration to final generation. It automatically completes all core aspects such as connection relationship identification, spatial path calculation, harness geometry construction, and engineering specification verification. Engineers only need to select the start / end point connectors and set wiring parameters on the interface to directly obtain a complete 3D harness digital model without any manual segmentation modeling operations, achieving a qualitative leap in automation.

[0103] In existing technologies, the design cycle for wiring harnesses of complex equipment is typically measured in weeks or even months, and heavily relies on experienced senior engineers. This invention compresses the design process to minutes or hours, enabling engineers to quickly obtain multiple feasible solutions for comparison and evaluation. Simultaneously, the system embeds engineering experience (such as bending radius rules, avoidance strategies, and fixed point layout specifications) as algorithmic constraints, reducing reliance on individual experience. Even junior engineers can produce design results that meet industry standards, thereby significantly saving labor costs and improving the overall output efficiency of the team.

[0104] In existing technologies, when equipment structures change, the constructed wiring harness digital models often fail over a large area, requiring engineers to manually replan paths and rebuild the model segment by segment, with modification costs approaching redesign. This invention adopts an architecture that decouples connection relationships from 3D geometry. The wiring harness path is calculated and generated in real time by connection relationships and spatial constraints, rather than statically stored geometric entities. When connector positions are adjusted, added, or removed, or the wiring environment changes, path calculation can be automatically retried and the 3D digital model updated, realizing a closed loop of "requirement change → automatic recalculation → real-time model update". This avoids global rework caused by local changes and greatly improves the agility of design iteration.

[0105] Addressing the issue that existing CAD software wiring harness modules are typically developed for specific fields (such as automotive) or platforms (such as CATIA), making it difficult to migrate technical solutions to fields like shipbuilding, aviation, and nuclear power, and resulting in deep integration with CAD platforms, this invention addresses these problems. It abstracts a universal wiring harness connection relationship model, a set of spatial constraint rules, and a geometry generation interface. This parameterizes domain differences (such as bending radius standards, fixed point spacing requirements, and material specifications) into configurable rules and encapsulates platform differences (such as CATIA and NX) into standardized output interfaces. This constructs a cross-domain, cross-platform universal technical framework. The same core algorithm can adapt to engineering specifications across different industries, and the same system can output 3D digital models for different CAD platforms, significantly improving the reusability and application breadth of the technical solution.

[0106] This application also provides a smart terminal, including a memory and a processor. The memory stores a wire harness three-dimensional digital model design program. When the wire harness three-dimensional digital model design program is executed by the processor, it implements the steps of the wire harness three-dimensional digital model design method in any of the above embodiments.

[0107] This application embodiment also provides a storage medium storing a wire harness three-dimensional digital model design program. When the wire harness three-dimensional digital model design program is executed by a processor, it implements the steps of the wire harness three-dimensional digital model design method in any of the above embodiments.

[0108] In the embodiments of the smart terminal and storage medium provided in this application, all the technical features of any of the above-described embodiments of the three-dimensional digital model design method for wire harnesses may be included. The extended and explanatory content of the specification is basically the same as that of the embodiments of the above methods, and will not be repeated here.

[0109] This application also provides a computer program product, which includes computer program code. When the computer program code is run on a computer, it causes the computer to perform the methods described in the various possible implementations above.

[0110] This application also provides a chip, including a memory and a processor. The memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a device with the chip installed performs the methods described in the various possible implementations above.

[0111] It should be understood that although the steps in the flowcharts of this application's embodiments are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowchart may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily completed at the same time, but can be executed at different times, and their execution order is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the sub-steps or stages of other steps.

[0112] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this invention and their equivalents, this invention also intends to include these modifications and variations.

Claims

1. A method for designing a three-dimensional digital model of a wire harness, characterized in that, Includes the following steps: Obtain voxel data corresponding to each component of complex equipment, and obtain projection points by establishing the mapping relationship between voxel coordinates and physical coordinates; Based on the voxel data and the projection points, as well as the cross-sheet metal path and the in-sheet metal path, a high-level adjacency graph is constructed, and the current path is obtained by performing a path search. Discounting is performed on the voxel data corresponding to the existing harness path or the reused path to obtain candidate paths, which are then used to stitch together or update the current path to generate a three-dimensional digital model of the harness of the complex equipment.

2. The method for designing a three-dimensional digital model of a wire harness according to claim 1, characterized in that: During the construction of the high-level adjacency graph, based on the point configuration file of the complex equipment and the assembly SDF metadata initialization graph, the harness start node and harness end node of the high-level adjacency graph are generated.

3. The method for designing a three-dimensional digital model of a wire harness according to claim 1, characterized in that: In the process of constructing the high-level adjacency graph, the paths between sheet metals are used as connection points and connection edges. The projection points and projection edges corresponding to the endpoint projection paths are used, and / or the surface paths between projection points and connection points on the same sheet metal are used as graph edges to generate the high-level adjacency graph.

4. The method for designing a three-dimensional digital model of a wire harness according to claim 1, characterized in that: In the process of constructing the high-level adjacency graph, a graph search method is used, which combines voxel movement cost, SDF obstacle avoidance penalty and safe distance constraint to filter out impassable paths.

5. The method for designing a three-dimensional digital model of a wire harness according to claim 1, characterized in that: When obtaining candidate paths, when a harness accepts the reuse of a path voxel, projection point, or connection channel of another harness, the two are grouped into the same harness group to form a grouping relationship, and this grouping relationship is maintained in subsequent iterations to generate the candidate paths.

6. The method for designing a three-dimensional digital model of a wire harness according to claim 1, characterized in that: When obtaining candidate paths, the existing paths or common paths connecting the small wire harness group to the large wire harness group are tried first. If the candidate path obtained by re-searching based on the discounted voxels of the large wire harness group can reduce the overall cost, the path is accepted as the result and grouping and merging are performed to generate the candidate path.

7. A method for designing a three-dimensional digital model of a wire harness according to any one of claims 1-6, characterized in that: When performing splicing or updating, the graph edge paths between each adjacent node are read sequentially according to the node sequence obtained by searching the high-level adjacency graph, and spliced ​​or updated into complete voxel paths according to the connection relationship of the starting projection path, sheet metal surface path, cross sheet metal path, and ending projection path to generate the three-dimensional digital model of the wire harness.

8. The method for designing a three-dimensional digital model of a wire harness according to claim 7, characterized in that: When splicing the complete boolean path, when the path passes through multiple sheet metal pieces, the sheet metal surface path and the cross-sheet metal path corresponding to the selected edge are spliced ​​in sequence, and duplicate connection points are removed at the connection points of each path segment to form a path point sequence to generate the three-dimensional digital model of the wire harness.

9. A smart terminal, characterized in that, The smart terminal includes a processor and a memory; The memory stores a computer program, which, when executed by the processor, implements the steps of a wire harness three-dimensional digital model design method as described in any one of claims 1-8.

10. A storage medium, characterized in that, The storage medium stores a computer program, which, when executed by a processor, implements the steps of a wire harness three-dimensional digital model design method as described in any one of claims 1-8.

Images