Method for determining a network of tubes in a reference space of a motor vehicle

Abstract

The invention relates to a method for determining a network of tubes in a reference space of a motor vehicle which comprises a plurality of components (C1, C2, C3, C4), the network of tubes comprising a plurality of main tubes (10) extending between two components, the method comprising the following steps implemented by a computer: - for each component, determining a three-dimensional representation and a disposition of the stated component in the reference space; - each main tube extending from a first connection port of a first component to a second connection port of a second component; determining, for each of the first connection port and the second connection port, a disposition datum; and - determining a route for each main tube by calculating an optimal path that runs between the first connection port and the second connection port and taking into account constraints based on the three-dimensional representation and the disposition of each component, the disposition datum of the first connection port and the disposition datum of the second connection port.

Description

DESCRIPTION TITLE OF THE INVENTION: METHOD FOR DETERMINING A NETWORK OF TUBES IN A REFERENCE SPACE OF A MOTOR VEHICLE TECHNICAL FIELD OF THE INVENTION

[0001] The present invention relates generally to the arrangement of components of a motor vehicle.

[0002] The invention relates more particularly to a method for determining a network of tubes in a reference space of a motor vehicle.

[0003] The invention finds a particularly advantageous application for the arrangement of a network of hoses and / or pipes and / or electrical cables between the components of an internal combustion engine of the motor vehicle. STATE OF THE ART

[0004] Motor vehicles are equipped with several networks of tubes extending between different components and allowing the circulation of water, air, oil or even the passage of electrical conductors.

[0005] Determining a routing scheme for these networks is quite complex because it requires taking into account fairly marked geometric constraints, particularly concerning the available space. This combinatorial method is currently implemented manually by the designer of the motor vehicle.

[0006] It therefore does not guarantee that the routing diagrams of these networks are optimal. Furthermore, due to its manual nature, it is quite time-consuming to implement. Finally, changing the layout of a component or a tube requires rethinking the entire routing diagram of the network concerned. PRESENTATION OF THE INVENTION

[0007] In order to overcome the aforementioned drawbacks, the present invention proposes to improve the determination of the tube networks in a motor vehicle.

[0008] More particularly, the invention proposes a method for determining a network of tubes in a reference space of a motor vehicle which comprises a plurality of components, said network of tubes comprising a plurality of main tubes extending between two components, the method comprising the following steps implemented by a computer: - for each component, determination of a three-dimensional representation and a posture of the component concerned in the reference space, - each main tube extending from a first connection port of a first component to a second connection port of a second component, determining, for each of the first connection port and the second connection port, a posture datum, and - determining a path for each main tube by calculating an optimal trajectory extending between the first connection port and the second connection port and taking into account constraints based on the three-dimensional representation and the posture of each component, the posture data of the first connection port and the posture data of the second connection port.

[0009] Thus, according to the present invention, the trajectory of each of the tubes is determined by taking into account all of the data characterizing the reference space and the components it contains. This then makes it possible to optimize the routing scheme of the tube network while respecting the geometric constraints associated with the different components and the reference space.

[0010] Other advantageous and non-limiting characteristics of the method according to the invention, taken individually or in all technically possible combinations, are the following: - the calculation of the optimal trajectory comprises steps of determining a plurality of trajectories extending between the first connection port and the second connection port, and calculating the optimal trajectory by determining the shortest trajectory allowing the bypassing of at least one component present between the first connection port and the second connection port; - the second connection port being located set back from a general surface of the second component, towards the inside of said second component, steps are provided for drawing a segment between the first connection port and the second connection port, selecting a portion of a straight line passing through the segment and corresponding to the crossing of the second component, determining a smallest distance between the second connection port and the end of the portion of the segment which is furthest from the first connection port, and calculating the optimal trajectory by comparing the ratio between said distance and the length of the portion of the segment with a predetermined value; - the tube network also comprises a plurality of secondary tubes, at least one secondary tube extending between a component and one of said main tubes, the method comprising a step of determining the optimal position for connecting the secondary tube to the main tube by minimizing the length of the secondary tube; - the step of determining the optimal connection position includes the minimization of a curvilinear abscissa of the secondary tube; - the step of determining the optimal branch position comprises steps of discretizing the main tube into a plurality of sub-portions, determining, for each discretized sub-portion, an associated branch position, determining the optimal branch position by selecting the determined branch position minimizing the length of the secondary tube from among the branch positions determined for each discretized sub-portion; - the main tube being in the form of a broken line connecting the first connection port to the second connection port, the broken line comprising at least one vertex, a step of smoothing said broken line is provided; - the smoothing step includes adjusting each vertex of the broken line by moving the vertex concerned into a sphere of predetermined radius; - the smoothing step includes minimizing a cost function so as to minimize the length of the tube network, prevent overlaps between tubes and components and prevent overlaps between tubes; - a step of converting the smoothed broken line into three-dimensional tubes is planned.

[0011] Of course, the various features, variants and embodiments of the invention may be combined with each other in various combinations to the extent that they are not incompatible or mutually exclusive. DETAILED DESCRIPTION OF THE INVENTION

[0012] The description which follows with reference to the appended drawings, given as non-limiting examples, will make it clear what the invention consists of and how it can be implemented.

[0013] On the attached drawings:

[0014] - Figure 1 schematically represents a network of hoses in accordance with the present invention;

[0015] - figure 2 schematically represents a first example of the trajectory of a hose extending between a first connection port and a second connection port;

[0016] - figure 3 schematically represents a second example of the trajectory of a hose extending between a first connection port and a second connection port;

[0017] - figure 4 schematically represents an example of connection of a secondary hose present in figure 1;

[0018] - figure 5 illustrates an example of a broken line representing a part of the network of hoses according to the invention;

[0019] - figure 6 represents, in the form of a flowchart, an example of a method for determining a network of hoses in accordance with the invention.

[0020] A motor vehicle typically has a chassis that supports numerous pieces of equipment, including an internal combustion engine.

[0021] Different equipment itself has different components.

[0022] Taking the example of the internal combustion engine, in a conventional manner, it comprises a plurality of components which are housed in an engine compartment delimited between the chassis and the hood of the vehicle. Among these components, we find for example (and in a non-exhaustive manner) an oil pan, a water pump, a fan, a starter, etc.

[0023] Some of the elements and components of the motor vehicle, particularly in the internal combustion engine, are connected to each other by tubes in order to allow the circulation of coolant, the circulation of air, the circulation of lubricant or even the passage of electrical conductors.

[0024] In this description, "tube" means a pipe allowing the circulation of air, coolant, lubricant or the passage of electrical cables between two components.

[0025] We will focus here more particularly on the network of hoses (allowing the circulation of a fluid), but the invention could be applied to all networks.

[0026] In a motor vehicle, the hoses must be arranged in a constrained space so as to occupy a minimum of space while ensuring optimal operation of the motor vehicle's components.

[0027] The present invention therefore aims to arrange a network of hoses which is optimal. In this description, a hose network will be considered to be formed of different portions of hoses extending between the different components of the motor vehicle.

[0028] Figure 1 schematically represents a network 1A of hoses included in a reference space 1 of a motor vehicle. This reference space 1 defines the encompassing envelope containing different components 2, 3, 4, 5, 6, 7 and the network 1A of hoses. This network 1A of hoses comprises a plurality of hoses 10, 20, 30 connecting the different components 2, 3, 4, 5, 6, 7 together (to allow for example the circulation of water, the circulation of air and the circulation of oil).

[0029] For illustration purposes, the reference space 1 is formed for example by the engine compartment. The hoses 10, 20, 30 of the hose network 1A are also intended to be contained in this reference space 1.

[0030] As can be seen in Figure 1, the network 1A of hoses comprises different types of hoses 10, 20, 30.

[0031] First, it comprises a plurality of main hoses 10. The main hoses 10 form a main portion of the network 1A of hoses.

[0032] Each main hose 10 extends between two components 2, 3, 4. More particularly, each main hose 10 extends between a first connection port 2A, 2B, 3A, 3B, 4A, 4B formed on a first component 2, 3, 4 and a second connection port 2A, 2B, 3A, 3B, 4A, 4B formed on a second component 2, 3, 4.

[0033] The main hoses 10 generally have the largest diameters (among the plurality of hoses).

[0034] A plurality of secondary hoses 20 are then provided. The secondary hoses 20 form a secondary portion of the network 1A of hoses.

[0035] Each secondary hose 20 extends either between two components 5, 6, or between a component 5, 6 and a main hose 10. In the latter case, a junction 15 makes it possible to connect the secondary hose 20 to the main hose 10. In other words, each junction 15 corresponds to a T-shaped branch of the network 1A, at which a secondary hose 20 is connected to a main hose 10 of larger cross-section.

[0036] In the example of Figure 1, the network 1A of hoses further comprises a plurality of tertiary hoses 30. The tertiary hoses 30 form a tertiary portion of the network 1A of hoses.

[0037] Here, each tertiary hose 30 extends between a component 7 and a secondary hose 30. A T-junction 25 then makes it possible to connect the tertiary hose 30 to the secondary hose 20. In other words, each junction 25 corresponds to a branch of the network 1A of hoses at which a tertiary hose 30 is connected to a secondary hose 20 of larger cross-section.

[0038] Of course, a tertiary hose could also extend between two components.

[0039] Generally, the hose network comprises a plurality of hose portions in cascade (main, secondary, etc.). Of course, the present invention is not limited to the structure shown in Figure 1. Thus, the hose network could comprise only the main portion, or only the main and secondary portions, or even comprise more than three hose portions.

[0040] The method according to the invention described below aims to determine the optimal trajectory of each hose 10, 20, 30 of the network 1A in the reference space 1.

[0041] This determination is carried out here using a computer processing unit, hereinafter called a calculator.

[0042] This calculator typically includes a processor, memory and various input and output interfaces.

[0043] Thanks to its input interfaces, the calculator is adapted to receive different data, typically data concerning the three-dimensional representation and posture of the components, posture data of each connection port, etc.

[0044] In this description, the term "posture" of a component means the positioning of this component, in the reference space 1, in a predefined spatial position, and according to a predefined orientation. The posture data of each connection port then corresponds to the spatial position and the predefined orientation for the connection of the hose at the connection port. The predefined orientation for the connection of the hose corresponds in practice to the starting and finishing tangents at the connection ports of the hose concerned.

[0045] Thanks to its output interfaces, the calculator is adapted to transmit data concerning the determined optimal trajectory of each hose 10, 20, 30 of the 1A network.

[0046] Thanks to its memory, the computer stores a computer application, consisting of computer programs including instructions whose execution by the processor allows the computer to implement the method described below.

[0047] In general, the method according to the invention aims to make it possible to determine the optimal trajectories of the hoses 10, 20, 30 in the network 1A of hoses. This determination takes into account the geometry of the reference space 1, a three-dimensional representation (i.e. the shape and dimensions) and the posture of each component 2, 3, 4, 5, 6, 7, C1, C2, C3, C4, C5 included in the reference space 1, and connection posture data of the hoses on these components 2, 3, 4, 5, 6, 7, C1, C2, C3, C4, C5. The method according to the invention then makes it possible to optimize the path of each hose of the network 1A in the reference space.

[0048] Figure 6 shows in detail the different stages of the method for determining the network 1A of hoses in the reference space 1. This method can now be described in more detail.

[0049] It is assumed at this stage that the geometry of the reference space 1 in which the network 1A is to be integrated is known and recorded in the computer's memory.

[0050] As shown in Figure 6, the process starts at step E2. In this step, the computer determines the three-dimensional representation and posture of each component 2, 3, 4, C1, C2, C3, C4, C5 included in the reference space 1.

[0051] During this step, the computer also determines, for each connection port P1, P2, P3 on each component C1, C2, C3, C4, C5, an associated posture datum. For each connection port P1, P2, this posture datum comprises the position, in the reference space 1, of the inlet of the connection port P1, P2, P3. It also comprises an orientation datum concerning the connection of a hose 10, 20, 30 to this connection port P1, P2, P3. This orientation datum is for example represented by a vector illustrating a direction of connection of the hose to this connection port. In other words, this vector indicates the connection tangent to be respected at each connection port P1, P2, P3.

[0052] Finally, the calculator also determines a routing diagram for the 1A hose network. This routing diagram lists all the connections to be made using hoses between the identified components. The routing diagram also indicates the type of each hose, i.e. main hose 10, secondary hose 20, etc.

[0053] In practice, all the information available to the calculator at step E2 is, for example, transmitted to the calculator in the form of a table which lists all of this data.

[0054] Typically, this table indicates that port 2B of component 2 should be connected to port 3A of component 3 using a main hose.

[0055] The computer then implements steps of determining the network 1A of hoses, that is to say determining, for each hose 10, 20, 30, the optimal trajectory for connecting a first connection port P1 to a second connection port P2.

[0056] To do this, in step E4, the computer breaks down the network 1A of hoses according to a predefined construction hierarchy. Thus, as can be seen below, according to this breakdown, the construction of the network 1A of hoses begins with the determination of the trajectories of the main hoses 10 of larger diameter. Then, the computer proceeds to determine the trajectories of the secondary hoses 20 and finally to that of the trajectories of the tertiary hoses 30. In this step E4, the computer defines, in a way, the construction plan of the network 1A of hoses. This construction hierarchy is in practice possible to implement here because the steps for drawing the network 1A of hoses described below are implemented digitally by the computer.

[0057] The method continues in step E6 during which the computer determines, according to the decomposition defined in step E4, a path representing the optimal trajectory of each main hose 10 between a first connection port P1 and a second connection port P2. It should be noted that, initially, the path of the network 1A of hoses is carried out in the form of broken lines TB between the connection ports P1, P2 (an example of such a broken line is shown in FIG. 5). In this description, the term “broken line” means a succession of segments which follow one another while forming variable angles between them. A broken line therefore comprises portions of segments and vertices.

[0058] In practice, several configurations must be considered in this step to determine the optimal path of each main hose 10 between the first connection port P1 of a first component C1 and the second connection port P2 of a second component C2.

[0059] In a first configuration (not shown), the space between the first connection port P1 of the first component C1 and the second connection port P2 of the second component C2 is free, i.e. the segment [P1 P2] does not have any intersection with any other element (component or other hose) of the reference space 1. In this case, the optimal trajectory of the hose concerned is represented (and traced) by the segment [P1 P2],

[0060] In a second configuration, shown in Figure 2, one or more elements of the reference space 1, here the components C3, C4, are interposed between the components C1, C2 to be connected by the main hose 10. The segment [P1 P2] therefore has at least one intersection with one of these elements.

[0061] Here too, the trajectory is partly based on the path of the segment [P1 P2]. However, the portions of this segment crossing the components C3, C4 here are replaced by modified portions bypassing the components C3, C4 (figure 2). In other words, these modified portions run along the components C3, C4, here from the outside of the components.

[0062] In practice, the computer implements this bypassing of the components by ensuring that each modified portion is as short as possible. It then determines a plurality of trajectories allowing the bypassing of components C3, C4. Among this plurality of trajectories, the computer selects the shortest trajectory allowing the bypassing of the components while running alongside them.

[0063] This is for example implemented by means of a Djikstra algorithm by considering that the surface of the traversed component is decomposed into a plurality of portions (the plurality of trajectories introduced above) allowing its circumvention (by following it). More details on the Djikstra algorithm can be found in the article by Dijkstra, EW, “A note on two problems in connexion with graphs”, Numer. Math. 1, 269-271 (1959).

[0064] Thus, in this configuration, as shown in Figure 2, the trajectory of each main hose 10 between the first connection port P1 of the first component C1 and the second connection port P2 of the second component C2 is obtained by combining portions extending along the segment [P1 P2] and portions running along the components C3, C4.

[0065] In a third configuration, shown in Figure 3, one of the connection ports, here the second connection port P2 of the second component C2, is not arranged on the general surface of this second component C2 but recessed. This is possible when the general surface of the component is not very detailed and does not necessarily illustrate all the reliefs of this component. Here, the second connection port P2 of the second component C2 is arranged inside the second component C2 relative to the general surface of the latter. In other words here, the connection port C2 is located in a recess formed in the second component C2.

[0066] The determination of the optimal trajectory of each main hose 10 is also based here on the segment [P1 P2] defined between the first connection port P1 of the first component C1 and the second connection port P2 of the second component C2.

[0067] The bypass of component C3 is done in the same way as in Figure 2. On the other hand, the bypass of component C2 is done in a different way.

[0068]

[0069] In practice, the calculator defines two distances relative to the segment [P1 P2],

[0070] On the one hand, it defines the total crossing distance D of the second component C2. This total distance D corresponds to the portion of a straight line passing through the points P1 and P2, which is contained in the second component C2. In other words, according to the notations used in Figure 3, the total distance D corresponds to the length of the segment [AB], the point A belonging to the general surface of the second component C2 closest to the first connection port P1 of the first component C1 and the point B being positioned in the extension of the general surface of the second component C2 furthest from the first connection port P1 of the first component C1. By construction, the points A and B are aligned with the segment [P1 P2],

[0071] On the other hand, the calculator also defines another distance d, extending between the second connection port P2 of the second component C2 and point B.

[0072] In order to determine the optimal trajectory of the main hose 10 in this configuration, the computer determines the ratio between the other distance d and the total distance D. This ratio d / D is then compared to a predetermined value. This predetermined value is for example less than 30%. Preferably, this predetermined value is between 10 and 30%.

[0073] If the d / D ratio is lower than the predetermined value, this means that the second connection port P2 of the second component C2 is closer to point B. As shown in Figure 3, the optimal path of the main hose 10 then passes through point B (and bypasses the second component C2 as described in the second configuration above).

[0074] In the case where the ratio d / D is greater than the predetermined value, the second connection port P2 of the second component is therefore considered to be connected via point A. The optimal trajectory of the main hose 10 follows the segment [P1 P2], emerging from the second component C2 directly via point A.

[0075] Finally, in this third configuration, the optimal trajectory corresponds to that which allows the main hose 10 to “exit” from the second component C2 with a portion of this main hose 10 which passes through the component as short as possible.

[0076] At the end of step E6, the computer has therefore determined, in the form of broken lines TB, the layout of the trajectories of the main hoses 10 listed in the routing diagram obtained in step E2. An example of such a broken line TB extending between the first connection port P1 and the second connection port P2 is shown in FIG. 5.

[0077] According to the construction plan established in step E4, the calculator then determines a path representing the optimal trajectory of each secondary hose 20 (step E8).

[0078] For secondary hoses extending between two connection ports belonging to two components respectively, the three configurations described for the main hoses 10 apply in the same way.

[0079] For secondary hoses 20 extending between a connection port P3 present on a component C5 and a main hose 10 (figure 4), the three configurations described previously apply, by assimilating the junction to a connection port. However, the computer must determine the position of the junction on the main hose 10. In other words, the computer must determine at which level of the main hose 10 the connection is made.

[0080] Generally, the connection can be made at any point on the main hose 10 concerned.

[0081] Preferably, the calculator determines the optimal connection position on the main hose 10 by minimizing the length of the hose. secondary 20 between a connection port P3 on a component C5 and the junction on the main hose 10 (figure 4). In other words, the optimal path of the secondary hose 20 between the connection port P3 and the junction on the main hose 10 is the path that minimizes the length of the secondary hose 20.

[0082] According to a first embodiment, the calculator minimizes the length of the secondary hose 20 by minimizing its curvilinear abscissa. For this, the calculator implements for example a genetic algorithm making it possible to test a plurality of possible configurations for the connection of the secondary hose 20 and to obtain a configuration which approaches the optimal configuration (an infinity of connection possibilities being possible in this case).

[0083] More concretely, the computer can implement this algorithm for a limited time interval (for example a few minutes) and selects the trajectory of the secondary hose 20 having the minimum curvilinear abscissa among all those determined during this limited time interval.

[0084] Alternatively, the computer can test a limited number of connection configurations for the secondary hose 20 and select the trajectory of the secondary hose 20 having the minimum curvilinear abscissa from among all those determined. The computer tests, for example, a few thousand connection configurations for the secondary hose 20.

[0085] According to a second embodiment, shown in Figure 4, the computer defines a discrete number of possibilities for positioning the junction J1, J2, J3, J4 for connecting the secondary hose 20 to the main hose 10. In other words, the computer performs a discretization of the main hose 10 into a finite number of portions. This finite number is for example less than 10.

[0086] In Figure 4, four portions and therefore four possible junctions J1, J2, J3, J4 are provided for connecting the secondary hose 20 to the main hose 10.

[0087] The optimal trajectory of the secondary hose 20 is therefore that, among the finite number of possible junctions, making it possible to minimize the length of the secondary hose 20.

[0088] For example, in the case of Figure 4, the computer determines the optimal trajectory of the secondary hose 20 from among the four possible trajectories 20A, 20B; 20C; 20D corresponding to the four junctions J1, J2, J3, J4 considered, by selecting the one which minimizes the length of the secondary hose.

[0089] Finally, at the end of step E8, the calculator has therefore determined, under in the form of broken lines, the trajectories of the secondary hoses listed in the routing diagram obtained in step E2.

[0090] According to the construction plan established in step E4, the computer then determines a path representing the optimal trajectory of each tertiary hose 30 (step E10). This path is carried out in the same way as that described in step E8 for the secondary hoses 20 and is not described again here.

[0091] Generally speaking, the routing of hoses, other than the main hoses, is carried out according to the methods described previously for the secondary hoses.

[0092] Finally, following the implementation of steps E2 to E10, the computer has a representation of the 1A network of hoses in the form of broken lines TB.

[0093] As shown in Figure 6, the process continues at step E12. This step aims to smooth the broken lines TB forming the network 1A of hoses. More specifically, this step aims to adjust the radii of curvature of the hoses (in particular by introducing curved elbows into the layout in the form of broken lines of each hose) in order in particular to allow the hoses to be moved away from the components (because until now, the optimal trajectory of the hoses runs along, or even merges with, the surface of the components; which is not compatible with the actual manufacturing of the network 1A of hoses, the hoses having a certain diameter and a three-dimensional representation).

[0094] This smoothing step then includes adjusting each vertex of the broken line TB by moving the vertex concerned into a sphere S of predetermined radius (figure 5). The radius of this sphere S is here of the order of a few centimeters, for example less than 10 centimeters. In other words, the calculator adjusts the position of each vertex of the broken line TB by imposing a slight displacement around its initial position.

[0095] In practice, this adjustment (and therefore this displacement of the initial position of each vertex of the broken line TB) is implemented by minimizing a cost function. This cost function is, for example, the curvilinear length of the pipe. In this case, the optimization of the cost function aims to smooth the pipe around an initial configuration formed by broken lines.

[0096] This minimization of the cost function is achieved in particular by imposing certain production constraints. Thus, the calculator requires in particular to also minimize the total length of the 1A network of hoses, to prevent overlaps between the components and the hoses (because this is not achievable during the three-dimensional manufacturing of the 1A network of hoses) or to prevent overlapping between the hoses (also not possible during three-dimensional manufacturing).

[0097] In addition, the calculator can also require compliance with the orientation data (i.e. the starting and ending tangents at the hose connection) at the connection ports.

[0098] In order for the smoothed plot (denoted TL in Figure 5) not to show too many differences with the plot obtained in broken lines TB, the calculator can also impose, when minimizing the cost function, that the sum of the squares of the distances between the initial and final positions of the vertices of the broken lines be less than a threshold value. This threshold value is for example between 1.10' 6 and 1.10- 3 .

[0099] Thus, at the end of step E 12, the computer has a plot of the network 1A of hoses in the form of smoothed broken lines TL, with radii of curvature at the vertices of the initial broken lines (an example of a smoothed broken line TL is shown in figure 5).

[0100] In practice, the calculator can implement several successive adjustment steps, for example by starting by imposing constraints on the total length of the hose network and on non-overlaps, then by imposing compliance with the orientation data at the connection ports.

[0101] Then, in step E14, the computer transforms the smoothed broken lines TL into three-dimensional hoses. In practice, the computer adds a diameter data to each smoothed broken line TL so as to obtain a three-dimensional representation of the network 1A of hoses. This step is for example implemented here by extrusion.

[0102] In step E16, the computer transmits the instructions for manufacturing the network 1A of hoses according to the three-dimensional representation determined in step E14.

[0103] This network 1A of hoses is then manufactured with the components that connect the hoses in the reference space 1, before being installed in the motor vehicle (step E18).

[0104] Thus, advantageously according to the invention, the layout of the hose network is determined in portions, so as to optimize each of the lengths of the hoses. This successive determination for each type of hose allows a correction rapid alignment of the route in the event of layout changes.

[0105] In addition, the trajectory of each of the hoses is determined by taking into account all the data characterizing the reference space, thus making it possible to optimize the routing diagram of the hose network while respecting the geometric constraints.

Claims

CLAIMS 1. Method for determining a network (1A) of tubes in a reference space (1) of a motor vehicle which comprises a plurality of components (2, 3, 4, 5, 6, 7, C1, C2, C3, C4, C5), said network (1A) of tubes comprising a plurality of main tubes (10) extending between two components (2, 3, 4, C1, C2, C3, C4), the method comprising the following steps implemented by a computer: - for each component (2, 3, 4, C1, C2, C3, C4), determination of a three-dimensional representation and a posture of the component (2, 3, 4, C1, C2, C3, C4) concerned in the reference space (1), - each main tube (10) extending from a first connection port (2A, 2B, 3A, 3B, 4A, 4B, P1) of a first component (2, 3, 4, C1, C2, C3, C4) to a second connection port (2A, 2B, 3A, 3B, 4A, 4B, P2) of a second component (2, 3, 4, C1, C2, C3, C4), determining, for each of the first connection port (2A, 2B, 3A, 3B, 4A, 4B, P1) and the second connection port (2A, 2B, 3A, 3B, 4A, 4B, P2), a posture datum, and - determining a path for each main tube (10) by calculating an optimal trajectory extending between the first connection port (2A, 2B, 3A, 3B, 4A, 4B, P1) and the second connection port (2A, 2B, 3A, 3B, 4A, 4B, P2) and taking into account constraints based on the three-dimensional representation and the posture of each component (2, 3, 4, C1, C2, C3, C4), the posture data of the first connection port (2A, 2B, 3A, 3B, 4A, 4B, P1) and the posture data of the second connection port (2A, 2B, 3A, 3B, 4A, 4B, P2).

2. Method according to claim 1, in which the calculation of the optimal trajectory comprises steps of: - determining a plurality of trajectories extending between the first connection port (P1) and the second connection port (P2), and - calculation of the optimal trajectory by determining the shortest trajectory allowing the bypassing of at least one component (C3, C4) present between the first connection port (P1) and the second connection port (P2).

3. Method according to claim 1 or 2, in which, the second connection port (P2) being located set back from a general surface of the second component (C2), towards the interior of said second component (C2), steps are provided: - drawing a segment between the first connection port (P1) and the second connection port (P2), - selection of a portion (AB) of a straight line passing through the segment and corresponding to the crossing of the second component (C2), - determination of a smallest distance (d) between the second connection port (P2) and the end of the portion (AB) of the segment which is furthest from the first connection port (P1), and - calculation of the optimal trajectory by comparing the ratio between said distance (d) and the length (D) of the portion of the segment to a predetermined value.

4. Method according to any one of claims 1 to 3, wherein the network (1A) of tubes also comprises a plurality of secondary tubes (20), at least one secondary tube (20) extending between a component (5, 6, C5) and one of said main tubes (10), the method comprising a step of determining the optimal position for connecting the secondary tube (20) to the main tube (10) by minimizing the length of the secondary tube (20).

5. Method according to claim 4, in which the step of determining the optimal connection position comprises minimizing a curvilinear abscissa of the secondary tube (20).

6. The method of claim 4, wherein the step of determining the optimal branch position comprises steps of: - discretization of the main tube (10) into a plurality of sub-portions, - determination, for each discretized sub-portion, of an associated branching position, - determination of the optimal connection position by selecting the determined connection position minimizing the length of the secondary tube (20) from among the connection positions determined for each discretized sub-portion.

7. Method according to any one of claims 1 to 6, in which, the main tube (10) being in the form of a broken line (TB) connecting the first connection port (P1) to the second connection port (P2), the broken line (TB) comprising at least one vertex, a step of smoothing said broken line (TB) is provided.

8. The method of claim 7, wherein the smoothing step comprises the adjustment of each vertex of the broken line (TB) by moving the vertex concerned in a sphere (S) of predetermined radius.

9. Method according to claim 7, in which the smoothing step comprises minimizing a cost function so as to minimize the length of the network (1 A) of tubes, prevent overlaps between tubes (10, 20, 30) and components (2, 3, 4, 5, 6, 7, C1, C2, C3, C4, C5) and prevent overlapping between the tubes (10, 20, 30).

10. Method according to any one of claims 7 to 9, in which a step of converting the smoothed broken line (TL) into three-dimensional tubes is provided.

Images