• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    This method of generating an aircraft ground taxiing trajectory in an airport domain comprises acquiring (110) a clearance comprising departure, arrival and intermediate elements of said domain, the acquiring (120) a graph, and determining (130), from said graph, input and / or output nodes for each element. It comprises calculating (142, 144), in the graph, paths external to the elements and an internal path to each intermediate element, each external path connecting an output node of an element to an input node of the element. next element, each internal path connecting input and output nodes of said intermediate element, the first computed paths among the external and internal paths having a minimal cost; computing (150) a global path from the internal (s) and external paths; and generating (160) said trajectory from the global path.
    公开号:FR3030854A1
    申请号:FR1402941
    申请日:2014-12-19
    公开日:2016-06-24
    发明作者:Remy Auletto；Johann Dreo；Pierre Saveant
    申请人:Thales SA；
    IPC主号:
    专利说明:

    [0001] FIELD OF THE INVENTION The present invention relates to a method for generating an aircraft ground taxiing trajectory in an aircraft. airport area. The method is implemented by a computer, and comprises the following steps: the acquisition of a clearance comprising a starting element, an arrival element and at least one intermediate element of the airport domain that the aircraft must borrow between the starting element and the arrival element, - the acquisition of a graph corresponding to an airport navigation network, the navigation network being associated with the airport domain, said graph comprising a plurality of arcs, each arc comprising two end nodes, and - determining, from the acquired graph, at least one input node and at least one output node for each intermediate element of the clearance, of at least one node of departure for the starting element and at least one arrival node for the arrival element. The invention also relates to a computer program product comprising software instructions which, when implemented by a computer, implement such a generation method.
    [0002] The invention also relates to an electronic system for generating the taxiing track of the aircraft in the airport field. The invention relates generally to the field of aiding the taxiing of an aircraft in an airport area, the taxiing assistance being notably in the form of a display, intended for the crew of the aircraft or an operator of a control tower, the trajectory to be followed by the aircraft in the airport field, for example from the starting parking to takeoff or from the landing to the arrival parking. Alternatively or additionally, the taxi aid is performed in the form of a shipment to an onboard avionics system of the generated trajectory.
    [0003] The invention relates to any aircraft capable of taxiing in the airport field, including a plane, civil or military, passenger or goods transport, or a drone, or a helicopter. Rolling on the ground means a movement of the aircraft in the airport field, the aircraft being in contact with the ground in the case of an airplane or a drone or close to the ground in the case of a helicopter.
    [0004] Document FR 2 924 829 A1 discloses a method of the aforementioned type and an associated system for generating an aircraft ground taxiing trajectory. The trajectory generation system is adapted to receive a path comprising a series of elements of the airport domain that the aircraft must successively use, and then to automatically extract from a set of reference points of the airport domain the geographical coordinates of the points of the airport. reference corresponding to the elements of the journey that the aircraft must take. The trajectory generation system is finally configured to calculate the ground taxiing trajectory from the extracted geographic coordinates, while checking on said trajectory that each turn has a maximum curvature that is less than a predetermined threshold curvature. However, the driving trajectory generated by such a system is not optimal, it is often relatively long and / or consuming fuel. The object of the invention is therefore to propose a method and a system for generating a taxiing trajectory on the ground making it possible to improve the generated driving trajectory, which is for example shorter and / or less fuel consuming. . To this end, the object of the invention is a method of the aforementioned type, in which the method further comprises the following steps: calculating, in the acquired graph, a plurality of paths external to the elements of the clearance, and calculating, in the acquired graph, at least one internal path to each intermediate element of the clearance, each external path connecting an output node of an element of the clearance to an input node of the next element of said element in the clearance, each starting node forming an output node and each arrival node forming an input node, each internal path connecting, for a corresponding intermediate element, input and output nodes of said intermediate element, passing through one or more arcs, during the step performed first among the step of calculating the external paths and the step of calculating the internal path or paths, the calculated one or more paths have, according to a function of c a predetermined value, - a computation of an overall path between corresponding start and end nodes, from the calculated internal and external paths, and - the generation of the ground taxi track at from the calculated global path.
    [0005] Beyond other advantageous aspects of the invention, the method of generating the ground taxiing trajectory comprises one or more of the following characteristics, taken separately or in any technically possible combination: the method comprises several iterations between the step determining the input and output nodes and the step of generating the rolling path, each iteration comprising a step of calculating the external paths, a step of calculating the internal path (s) and a step of calculating the global path , during a new iteration, new external and internal paths are searched for among the paths other than those calculated during the preceding iteration (s), and during the step carried out, during the new iteration, first among said steps for calculating the external and internal paths, the calculated new path (s) have, according to the predetermined cost function , a minimum value among the values of said other paths, the step of calculating the global path then being performed again to compute a new global path from further new external and internal paths; the new global path is retained only if, according to the predetermined cost function, it has a value lower than that of the global path calculated during the preceding iteration (s); among the new calculated external and internal paths, only the one or more paths used in the new global path are kept, the other one or more of said new external and internal paths being then ignored; the step of calculating the external paths is, at each iteration, carried out before the step of calculating the internal path (s); the step of calculating the internal path or paths is, at each iteration, performed before the step of calculating the external paths; the cost function associated with a path is chosen from the group consisting of: the curvilinear length of the path, the quantity of fuel consumed on said path, a function representative of congestion on said path, a function representative of a risk accident on said path, a function representative of the travel time of said path and a function combining the aforementioned functions; the step of acquiring the graph comprises the reception of an initial airport navigation graph, said initial graph comprising a plurality of navigation arcs, each navigation arc comprising two end nodes and having at least one authorized sense navigation; the initial airport navigation graph then forms the acquired graph, the steps of determining the input and output nodes, calculating the external and internal paths and calculating the global path then being performed from the initial graph; airport navigation; the step of acquiring the graph further comprises: determining a conjugate node for each navigation arc and for each authorized navigation direction of said arc, each conjugate node corresponding to a single authorized navigation direction and representing said arc of the initial graph associated with said authorized direction of navigation; and + the computation of a conjugate graph comprising conjugate arcs connecting the conjugated nodes as a function of the connections between the arcs of the initial graph and authorized directions of navigation, two interconnected conjugate nodes corresponding to two successive arcs of the initial graph and to the same authorized direction of navigation, and the conjugate graph then forms the acquired graph, the steps of determination of the input and output nodes, calculation of the external and internal paths and computation of the global path then being carried out. from the conjugate graph; the acquisition step of the graph furthermore comprises the classification of the conjugate nodes determined in first and second distinct subsets, the first subset comprising the conjugated node or nodes corresponding to navigable arcs for any clearance and the second subset a subset comprising the conjugate node or nodes corresponding to navigable arcs only for one or more clearances; the conjugate nodes corresponding to one and the same clearance element are furthermore grouped together; the method comprises the acquisition of at least one quantity relating to an aircraft considered among the aircraft's mass and at least one dimension relative to the overall size of the aircraft, and during the determination of the conjugate nodes, a Conjugate knot is determined for a respective arc only if said arc is compatible with the acquired magnitude. The invention also relates to a computer program product comprising software instructions which, when implemented by a computer, implement a generation method as defined above.
    [0006] The invention also relates to an electronic system for generating an aircraft ground taxiing trajectory in an airport domain, the system comprising: a first acquisition device configured to acquire a clearance comprising a starting element , an arrival element and at least one intermediate element of the airport domain that the aircraft must borrow between the starting element and the arrival element, - a second acquisition device configured to acquire a graph corresponding to a an airport navigation network, the navigation network being associated with the airport domain, said graph comprising a plurality of arcs, each arc comprising two end nodes; a device for determining, from the acquired graph, at least one input node and at least one output node for each intermediate element of the clearance, at least one start node for the element d e departure and at least one arrival node for the arrival element, the system further comprising: - a first computing device configured to calculate, in the acquired graph, a plurality of external paths to the elements of the clearance and at least one internal path to each intermediate element of the clearance, each external path connecting an output node of an element of the clearance to an input node of the next element of said element in the clearance passing through one or more arcs, each starting node forming an output node and each arrival node forming an input node, each internal path connecting, for a corresponding intermediate element, input and output nodes of said intermediate element, passing through one or more arcs, the path or paths calculated first among the external paths, on the one hand, and the internal path (s), on the other hand, having a minimum value according to a function of c predetermined amount, - a second computing device configured to calculate a global path between corresponding start and end nodes, from the internal (s) and external paths calculated by the first computing device, and - a generating device the ground taxi track from the overall path calculated by the second computing device. These features and advantages of the invention will appear on reading the description which follows, given solely by way of nonlimiting example, and with reference to the appended drawings, in which: FIG. 1 is a diagrammatic representation of an electronic system, according to the invention, for generating a ground taxiing trajectory of an aircraft in an airport area, - Figure 2 is a partial schematic view of the airport domain and the airport navigation network associated with this area. FIGS. 3 to 7 are schematic views illustrating the generation of the taxiing trajectory on the ground for a clearance comprising a starting element, three intermediate elements and an arrival element, and FIG. 8 is a flowchart of FIG. a method, according to the invention, of generating the taxiing trajectory on the ground of the aircraft. FIG. 1 shows an electronic system 10 for generating a trajectory 11 for taxiing an aircraft, not shown, in an airport area 12A, the airport area 12A being associated with an airport navigation network 12B. The generation system 10 comprises an information processing unit 14, a display screen 15 and input means 16, the information processing unit 14 being formed for example of a memory 17 and a processor 18 associated with the memory 17.
    [0007] The airport domain 12A, an example of which is visible in FIG. 2, comprises various airport elements 19, in particular taxiways 20, car parks 22, one or more tracks 24 and one or more runways 26. The navigation network 12B complies with the EUROCAE standards ED99C and EUROCAE ED119B or later versions of these standards. The navigation network 12B forms a modeling of the entire airport domain 12A. The navigation network 12B comprises navigation arcs, not shown. The memory 17 is able to store the airport navigation network 12B. The memory 17 is also capable of storing a first software 30 for acquiring a clearance 32, the clearance 32 comprising a starting element 34, an arrival element 35 and at least one intermediate element 36 of the airport domain that the aircraft must borrow between the starting element 34 and the arrival element 35, visible in Figures 3 and 7. The memory 17 is also able to store a second software 38 for acquiring an airport navigation graph 39 , 39C corresponding to the airport navigation network 12B, the acquired graph being an initial airport navigation graph 39 received by the generation system 10 or a conjugate graph 39C calculated from the initial airport navigation graph 39 received. The memory 17 is also able to store software 40 for determining, from the acquired graph 39, 39C, at least one input node 42 and at least one output node 43 for each intermediate element 36 of the clearance, at least one start node 44 for the starting element 34 and at least one arrival node 45 for the arrival element 35. The memory 17 is also able to store a first software 46 of calculating, in the acquired graph 39, 39C, a plurality of paths 48 external to the elements 34, 35, 36 of the clearance and at least one path 52 internal to each intermediate element 36 of the clearance, the one or more paths calculated first among the external paths, on the one hand, and the one or more internal paths, on the other hand, having a minimum value according to a predetermined cost function. The cost function associated with the path is, for example, the curvilinear length of the path. Alternatively, the cost function associated with the path is the amount of fuel consumed as the aircraft travels the path. Alternatively, the cost function associated with the path is the travel time of said path by the aircraft, that is to say the time elapsed while the aircraft is traveling the path. In another variant, the cost function associated with the path is a function representative of a congestion of channels associated with said path. In another variant, the cost function associated with the path is a function representative of a risk of accident on said path. The memory 17 is further able to store a second software 54 for calculating a global path 56 between corresponding start 44 and arrival 45 nodes, from the internal (s) 52 and external 48 paths calculated by the first calculation software 46. The memory 17 is also able to store a software 58 for generating the ground taxi track 11, from the global path 56 calculated by the second calculation software 54. The processor 18 is able to execute each acquisition software 30, 38, determination 40, calculation 46, 54 and generation 58. The first acquisition software 30 30, the second acquisition software 38, the determination software 40, the first software 46, the second calculation software 54 and the generation software 58 form, when executed by the processor 18, respectively a first electronic device for acquiring the clearance, a second electronic device the acquisition of the graph, an electronic device for determining the input, output, departure and arrival nodes, a first electronic device for calculating the external paths and the internal path or paths, a second electronic device for determining the calculating the global path and an electronic device for generating the running trajectory. In a variant, the first acquisition device 30, the second acquisition device 38, the determination device 40, the first computing device 46, the second computing device 54 and the generating device 58 are embodied as components programmable logic, or in the form of dedicated integrated circuits. The first acquisition device 30 is configured to acquire the clearance 32, the latter having been previously entered by a member of the crew of the aircraft using the input means 16, or received in the form of a data file from avionics equipment, not shown or received directly from a control tower by radio transmission. The acquired clearance 32 comprises the starting element 34, the arrival element 35 and the intermediate element or elements 36. In other words, the clearance 32 comprises an ordered sequence of elements 19 of the airport domain that the aircraft must borrow. successively. In the example of FIG. 3, the clearance 32 comprises three intermediate elements 36, referenced respectively to the letters A, B and C. The starting node or nodes 44 correspond by default to the points closest to the current position of the 'aircraft. The arrival node or nodes 45 are generally the points of entry into an arrival element 35 which is often a parking lot when the rolling trajectory 11 follows the landing of the aircraft, or a corresponding track 24 when the rolling path 11 precedes the take-off of the aircraft. Each intermediate element 36 is associated with an area of the navigation network 12B. The intermediate element (s) 36 generally correspond to an ordered list of intermediate taxiways of the airport domain 12A. The second acquisition device 38 is configured to acquire the graph 39, 39C from which the input nodes 42, output 43, start 44 and arrival 45 are determined, and then the internal paths (s) 52 and external 48 are calculated, and finally in which the overall path 56 is calculated.
    [0008] The second acquisition device 38 comprises a module 60 for receiving the initial airport navigation graph 39, visible in FIG. 3. The initial graph 39 comprises a plurality of navigation arcs 64, each navigation arc 64 comprising two navigation nodes 64 end 65. Each navigation arc 64 has at least one authorized direction of navigation, and is identified in particular by its two end nodes 65 and its geometric materialization. The initial airport navigation graph 39 is also called airport connectivity graph, or ASRN graph (Aerodrome Surface Routing Network). This initial graph 39 represents in other words the set of channels usable by the aircraft in the airport. The arcs 64 and the end nodes 65 are labeled so as to be attached to the airport elements used in the clearances 32. The initial graph 39 is, for example, in accordance with the standard ED99-C / D0272-C and by extension ARINC Standard 816-2, or later versions of these standards. In optional complement, the second acquisition device 38 comprises a module 66 for acquiring information relating to the aircraft, such as a minimum radius of curvature corresponding to the maximum deflection of the aircraft, the mass of the aircraft and / or at least one dimension relative to the size, such as the size of the aircraft, the height of the aircraft. According to a first exemplary embodiment, the initial graph received 39 then forms the graph acquired by the second acquisition device 38. The determination device 40 is then able to determine the input nodes 42, exit 43, departure 44 and arrival 45 from the initial graph 39, and the first computing device 46 and the second computing device 54 are able to calculate the internal (s) 52 and external 48, and respectively the overall path 56, in said initial graph 39. According to a second exemplary embodiment, the second acquisition device 38 further comprises a module 68 for determining a conjugate node for each navigation arc 64 and for each authorized direction of navigation of said arc. Each conjugate node corresponds to a single authorized navigation direction. Each conjugate node then represents said arc 64 of the initial graph associated with said authorized navigation direction. According to the second exemplary embodiment, the second acquisition device 38 further comprises a module 72 for calculating the conjugate graph 39C, the calculation module 72 being configured to link the conjugate nodes as a function of the links between the arcs 64 of the initial graph 39 and authorized directions of navigation, two interconnected nodes connected to each other corresponding to two successive arcs 64 of the initial graph and to the same authorized direction of navigation. According to the second exemplary embodiment, the conjugate graph 39C then forms the graph acquired by the second acquisition device 38. The determination device 40 is able to determine the input nodes 42, the output 43, the departure nodes 44 and the arrival 45 from the conjugate graph 39C, the first computing device 46 and the second computing device 54 then being able to calculate the internal (s) 52 and external 48 paths, and the overall path 56 respectively in said conjugated graph 39C .
    [0009] The reception module 60, the acquisition module 66, the determination module 68 and the calculation module 72 are each made in the form of a software function included in the second acquisition software 38 and capable of being executed by the user. Processor 18. In a variant, the reception module 60, the acquisition module 66, the determination module 68 and the calculation module 72 are produced in the form of programmable logic components or in the form of dedicated integrated circuits. The determining device 40 is configured to determine, for each intermediate element 36 of the clearance acquired by the acquisition device 30, the input node or nodes 42 and the output node or nodes 43 of said intermediate element 36. The device determination 40 is also configured to determine, on the one hand, the starting node (s) 44 for the starting element 34, and on the other hand, the arrival node (s) 45 for the arrival element. 35. According to the first exemplary embodiment, when the acquired graph is the initial airport navigation graph 39, the determination device 40 is, for example, configured for, when the initial graph 39 conforms to the specification ED 99 C or later or ARINC 816-2 or later derived therefrom, determine the input nodes 42, output 43, start 44 and arrival 45 directly from said initial graph 39, the latter containing for each airport element information relating to the input nodes in said element and output of said element. More precisely, the initial airport navigation graph 39 comprises a transition identifier for each navigation arc 64 corresponding to a transition between two elements of the airport domain 12A that may belong to a clearance. The determining device 40 is then configured to search for the transition identifiers associated with the elements of the clearance 32 acquired, and to deduce therefrom said entry nodes 42, exit 43, departure 44 and arrival 45, visible on the FIG. 3, as a function of the direction of flow from the starting element 34 to the arrival element 35 of the acquired clearance 32. According to the second exemplary embodiment, the determination device 40 is configured to determine the nodes of input 42, output 43, start 44 and arrival 45 from the calculated conjugate graph 39C, each input node 42, output 43, start 44 and arrival 45 corresponding to a conjugate node, and being then also called input conjugate node 42C, output conjugate node 43C, starting conjugate node 44C and respectively arrival conjugate node 45C. Each conjugate node corresponds to a single authorized direction of navigation, the determination device 40 is then configured to determine said input conjugate nodes 42C, 43C output, 44C start and 45C arrival, visible in Figure 4, in function, on the one hand, of the unique authorized direction of navigation associated with each of the conjugate nodes, and on the other hand, of the flow direction from the starting element 34 to the arrival element 35 of the clearance Acquired 32. By convention, in the description, the conjugate nodes computed by the calculation module 72 are designated by the general reference, and among said conjugate nodes, those which correspond in particular to the input in a respective intermediate element 36, to the output from a respective intermediate element 36, to the initial element 34 and respectively to the arrival element 35 are designated by the respective references 420, 43C, 44C and 45C, as r FIG. 4 to 6. In the following description, for all aspects relating to the computation of the external 48 and internal 52 paths and the computation of the global path 56, the expressions "input node%, "Output loop%," start node% and destination node% will designate the input node 42, the output node 43, the start node 44 and the arrival node 45 when the acquired graph is the graph initial airport navigation 39, and respectively the input conjugate node 420, the input conjugate node 430, the starting conjugate node 440 and the arrival conjugate node 45C when the acquired graph is the conjugate graph 390. first computing device 46 is configured to calculate, in the acquired graph 39, 39C, the external paths 48 and the internal path (s) 52. Each calculated external path 48 links an output node 43, 430 associated with an element of the clearance at an input node 42, 42C associated with the the next element of said element in the clearance, passing through one or more arcs, each starting node 44, 440 forming an output node 43, 43C and each arrival node 45, 450 forming an input node 42, 420, as shown in FIG. 5. Each calculated internal path 52 connects, for an intermediate element 36 corresponding, input nodes 42, 420 and output 43, 430 of said intermediate element 36 through one or more arcs. The first computing device 46 is further configured so that the paths calculated first among the external paths 48, on the one hand, and the internal path (s) 52, on the other hand, have, according to the predetermined cost function, a minimum value. In other words, the first computing device 46 is configured to calculate the shortest path (s) for those computed first among the outer paths 48, on the one hand, and the internal path (s) 52, on the other hand go. The first computing device 46 is then configured so that the paths computed second among the external paths 48, on the one hand, and the internal path (s) 52, on the other hand, are compatible with the shortest calculated path (s). First, i.e., connect the input 42, 42C and output 43, 430 nodes belonging to the shortest paths computed first.
    [0010] In the remainder of the description, is called transition any passage going: - i) of the starting node or nodes 44, 44C towards the input node or nodes 42, 42C associated with the first intermediate element 36 of the acquired clearance, - ii ) of the output node or nodes 43, 43C associated with an intermediate element 36 of the clearance to the input node or nodes 42, 42C associated with the next element of said intermediate element 36 in the clearance, - iii) of the output nodes 43, 43C associated with the last intermediate element 36 of the acquired clearance to the arrival node or nodes 45, 45C, or iv) of the input node or nodes 42, 420 associated with a given intermediate element 36 to the output node or nodes 43, 43C associated with this intermediate element 36. One skilled in the art will then understand that the first computing device 46 is configured to calculate the external paths 48 among the type i), ii) and iii), and to calculate the or the internal paths 52 among the type IV transitions or transitions. In addition optional, the first computing device 46 is configured to calculate several external paths 48 and / or respectively internal 52 for at least one transition. In other words, the first computing device 46 is configured to calculate several shorter paths for at least one transition. The plurality of external paths 48 and / or respectively internal paths 52 calculated for the transition concerned is then the set of paths with the minimum values for said transition according to the predetermined cost function. Several paths 48, 52 have, for example, according to the predetermined cost function, the same minimum value for a given transition. The path or paths 48, 52 corresponding to the minimum value of the predetermined cost function for a given transition, or according to the optional complement, the paths corresponding to the minimum values of the said cost function for this transition, are for example calculated at using an algorithm, known per se, to search for a shorter path in a graph, such as the Dijkstra algorithm, the DLU algorithm or the A * algorithm. For the calculation of the external path 48 or internal 52, the Dijkstra algorithm will be used preferably. The second computing device 54 is configured to calculate the overall path 56 between corresponding start and end nodes, from the internal (s) 52 and external 58 paths calculated by the first computing device 46, as shown in FIG. Figure 6 where the global path 56 is the one passing through the hatched nodes. More precisely, the global path 56 is then formed solely of internal (s) 52 and external 58 paths computed beforehand by the first computing device 46. The global path 56 is, analogously to the internal (s) 52 and external 58 paths. , calculated using an algorithm, known per se, to search for a shorter path, such as the Dijkstra algorithm, the DLU algorithm or the A * algorithm. For the computation of the global path 56, the algorithm A * will be used preferably. The generation device 58 is then configured to generate the ground taxi track 11, also called taxi-route, visible in FIG. 7, from the global path 56 calculated by the second computing device 54. In other words, the device generation device 58 is configured to reconstruct the trajectory in the airport domain 12A passing through the corresponding navigation arcs 64, in the initial graph 39 according to the first exemplary embodiment, or in the conjugate graph 39C according to the second exemplary embodiment, to the path calculated total 56.
    [0011] The generation device 58 is furthermore capable of transmitting the ground taxiing trajectory 11 generated on the display screen 15 for displaying it to the crew of the aircraft or of an operator a control tower. As a variant or in addition, generation device 58 is able to transmit the ground taxi trajectory 11 generated to an onboard avionics system.
    [0012] According to the second exemplary embodiment, the determination module 68 is configured to determine, for each navigation arc 64 and for each authorized direction of navigation of said arc, the corresponding conjugated node. According to the second exemplary embodiment, in optional addition, the determination module 68 is configured to classify the conjugate nodes into first and second distinct subsets, not shown in FIG. 5. The first subset comprises the node or nodes conjugates corresponding to navigable arcs for any clearance. In other words, the first subset comprises the conjugate node or nodes corresponding to navigable arcs regardless of the clearance acquired by the acquisition device 30. The second subset comprises the conjugated node or nodes corresponding to navigable arcs only. for one or more clearances. In other words, the second subset comprises the conjugated node or nodes corresponding to arcs whose use is conditioned by the clearance, that is to say the use of which depends on the clearance. The first subset comprises, for example, conjugate nodes corresponding to arcs associated with taxiways. The second subassembly comprises, for example, conjugate nodes corresponding to arcs associated with runway crossings of the airport domain and / or conjugate nodes corresponding to arcs associated with car parks of the airport domain. According to the second exemplary embodiment, in optional complement, the determination module 68 is configured to determine a conjugate node in relation to a respective arc 64 of the initial graph 39 only if said arc is compatible with each dimension of the aircraft acquired by the acquisition module 66, such as the wingspan and / or the height of the aircraft. According to the second embodiment, in addition optional, the determination module 68 is configured to determine a conjugate node in relation to a respective arc 64 of the initial graph 39 only if said arc is compatible with the mass of the aircraft acquired by the acquisition module 66. According to the second embodiment, in addition optional, the determination module 68 is configured to associate each conjugate node a value of the corresponding arc 64 according to the predetermined cost function.
    [0013] According to the second exemplary embodiment, the calculation module 72 is configured to calculate the conjugate graph by linking the conjugate nodes as a function of the links between the arcs of the initial graph 39 and the authorized directions of navigation, two interconnected connected nodes corresponding to each other. two successive arcs 64 of the initial graph and to the same authorized direction of navigation. Each conjugate node corresponds to a single airport element and to a single authorized navigation direction. According to the second exemplary embodiment, as an optional supplement, the calculation module 72 is configured to connect two conjugated nodes to each other only when the two successive arcs 64 of the initial graph, represented by said conjugate nodes, form between them a higher radius of curvature. to the minimum radius of curvature of the aircraft acquired by the acquisition module 66. According to the second embodiment, in addition optional, the calculation module 72 is configured to delete a conjugate node having a single previous conjugated node and a single next conjugate node, the preceding conjugate node and the next conjugate node then being directly connected to each other. The suppressed conjugate node provides no additional functional information with respect to information already carried by said preceding and following conjugate nodes. According to the second exemplary embodiment, as a further optional supplement, the calculation module 72 is configured to suppress a conjugate node corresponding to a dead-end arc if said dead-end arc does not correspond to an element of the clearance, and in particular not to point of departure or at the point of arrival of the clearance. A conjugate node corresponding to a dead-end arc is a conjugate node having only one or more preceding conjugate nodes or having only one or more subsequent conjugate nodes, according to the authorized navigation sense associated with said conjugate node. In other words, according to this optional complement, the calculation module 72 is configured to delete a conjugate node having no previous conjugated node or having no next conjugated node, according to the authorized navigation direction associated with said conjugated node, and if said conjugate node does not correspond to an element of the clearance. The operation of the system for generating the ground trajectory 10 according to the invention will now be explained with the aid of FIG. 8 representing a flowchart of the method, according to the invention, for generating the ground taxi track 11 of the aircraft. During an optional initial step 100, the acquisition module 66 acquires information relating to the aircraft. In the case of acquisition of information relating to the aircraft, these include, for example, the minimum radius of curvature corresponding to the maximum deflection of the aircraft, also called the minimum turning radius of the aircraft, at least a dimension relative to the size of the aircraft, such as its size and / or height, and / or the mass of the aircraft. The first acquisition device 30 acquires, during the step 110, the clearance 32, the latter comprising an ordered sequence of airport elements 19 that the aircraft must take successively, in particular the starting element 34, the arrival element 35 and generally one or more intermediate elements 36 of the airport field 12A between the starting element 34 and the arrival element 35. The second acquisition device 38 acquires, during the step 120 , acquires the graph 39, 39C which will be used later for the calculation of internal (s) 52 and external 58 and global path 56. Acquisition step 120 includes the reception 122 of the initial airport navigation graph 39 by the receiving module 60, said initial graph 39 from, for example, an airport database. The initial graph 39 received comprises all the navigation arcs 64 associated with the airport navigation network 12B, each navigation arc 64 being for example in the form of a sequence of points, namely the end nodes 65 and Intermediate points between these end nodes 65. Each navigation arc 64 has one or two allowed navigation senses depending on whether the arc 64 is monodirectional or bidirectional, and is identified by its two end nodes 65. end node pair 65 representing each arc 64 is further preferably associated with a value of said arc 64 according to the predetermined cost function. According to the first exemplary embodiment, at the conclusion of the reception 122 of the initial graph 39, the method proceeds directly to a step 130 (as represented by the dotted line path in FIG. 8), during which the nodes input 42, output 43, start 44 and arrival 45 are determined from the acquired graph, that is to say from the initial graph received 39 in this case. In other words, the acquisition step 120 comprises, according to the first exemplary embodiment, only the reception 122 of the initial graph 39. According to the second exemplary embodiment, the acquisition step 120 further comprises the determination 124 of the conjugate node for each navigation arc 64 and for each authorized direction 44 associated with said arc. Each conjugated node then corresponds to a single authorized navigation sense 44, and represents said arc 64 of the initial graph associated with said authorized direction 44. In optional complement of the second embodiment, during said determination 124, the determined conjugate nodes are classified into the first and second distinct subsets. The first subset, also called permanent subgraph, comprises the conjugate nodes corresponding to navigable arcs 64 for any clearance. It mainly comprises all the taxiways 20 of the airport. The second subset, also called optional subgraph, forms the complement of the permanent subgraph, and comprises the conjugate nodes corresponding to arcs 64 whose use depends on the clearance. In other words, this optional supplement consists of a pretreatment of particular areas of the airport, including runway crossings and car parks. A track is traversable only if it is explicitly requested in the acquired clearance. To facilitate the management of this constraint, the portions of the initial graph 38 corresponding to a track crossing are, in the conjugate graph 39C, isolated and identified with the name of the track traversed. The taxi in the airport is via the taxiways 20, the car parks being usable only for the beginning and / or the end of the paths. In other words it is forbidden to "cut" through the car parks. To facilitate the management of this constraint, the portions of the initial graph 39 corresponding to the parking areas are, in the conjugate graph 39C, isolated from the rest of the conjugate graph 39C. This structuring in two subassemblies makes it possible, on receipt of the clearance, and before the calculation of the taxiing trajectory on the ground, to filter within the optional sub-graph the elements that are not authorized according to the clearance acquired. The structuring thus makes it possible to prohibit runway crossings and car parks not authorized by the clearance, and to limit the size of the conjugate graph 39C to be explored for the generation of the taxiing trajectory on the ground, which reduces the time accordingly. overall processing and the amount of memory used. In optional complement of the second exemplary embodiment, during said determination 124, the conjugate nodes are determined for the only arcs 64 of the initial graph 39 which are compatible with the dimension (span, height) of the aircraft and / or with the mass of the acquired aircraft. The arcs 64 compatible with the size of the aircraft are arcs 64 which have no size limit or arcs whose dimension limit is greater than the size of the aircraft. Similarly, the arcs 64 compatible with the mass of the aircraft are the arcs 64 which have no mass limit or the arcs whose mass limit is greater than the mass of the aircraft. This restriction of the nodes conjugated to the only arcs 64 compatible with the dimension (span, height) of the aircraft and / or with the mass of the aircraft is carried out by prior filtering, and the incompatible conjugate nodes are not determined. As a variant, all the conjugate nodes are determined at first; then the conjugate nodes incompatible with the size of the aircraft and / or with the mass of the aircraft are, in a second time, removed. According to the second exemplary embodiment, the acquisition step 120 then comprises the calculation 126 of the conjugate graph 39C by the calculation module 72, by connecting the conjugate nodes as a function of the links between the arcs 64 of the initial graph 39 and in function authorized directions of navigation, two interconnected conjugate nodes corresponding to two successive arcs 64 of the initial graph 39 and to the same authorized direction. Those skilled in the art will then understand that in any path of the conjugate graph 39C is associated a single path of the initial graph 39. In other words, there is injection of all the paths defined by the conjugate graph 39C in the set of initial paths of the initial graph 39. As an optional supplement to the second exemplary embodiment, during said calculation 126, two conjugate nodes are connected to each other only when the two successive arcs 64 of the initial graph 39, identified by said conjugate nodes, form between them a radius curvature greater than the minimum radius of curvature. This then eliminates the sequences of navigation arcs that are incompatible with the minimum turning radius of the aircraft. In an alternative embodiment, all the conjugate nodes are connected to each other as a function only of the direction allowed in a first step; then the transitions between conjugate nodes that are incompatible with the minimum turning radius of the aircraft are, in a second time, removed.
    [0014] In further optional addition of the second exemplary embodiment, during said calculation 126, the calculation module 72 removes each conjugated node with a single preceding conjugated node and a single following conjugated node, the preceding conjugated node and the next conjugated node of said conjugated node deleted. being then directly connected to each other. This makes it possible to simplify the conjugate graph 39C, such a node conjugated with a single preceding conjugated node and a single following conjugate node being useless for generating the ground taxiing trajectory.
    [0015] Thus, the transformation of the initial graph 39 into the conjugate graph 39C facilitates the integration of constraints related to the clearance and / or the aircraft. To further facilitate the treatment of traffic constraints, the conjugate graph 39C is further structured between the permanent subgraph having no conjugate node associated with a runway crossing or a parking crossing, and the optional subgraph including, on the one hand, the conjugate nodes associated with runway crossings 26, and on the other hand, the conjugate nodes associated with the car park crossings. The constraints that may be taken into account in the conjugate graph 39C and that are not already present in the initial graph 39C are in particular: the dimension (span, height) of the aircraft considered, the weight (or mass) of the aircraft considered, the minimum turning radius of the aircraft considered, taxiways under construction, doors reserved for certain types of aircraft. The conjugated graph 390 then makes it possible, by taking these constraints into account, to avoid that a taxiing trajectory that does not respect one of these constraints is then generated and used by the pilot, while the pilot it would be wrong. Those skilled in the art will also note that the steps 122 to 126 forming the acquisition of the conjugate graph 39C are, with the exception of the adaptation to the clearance, feasible in pretreatment, in particular prior to step 110 of FIG. acquisition of clearance. This makes it possible to advance the calculation time associated with less critical moments, or even to perform these calculations on the ground before the engines of the aircraft are started. Those skilled in the art will also understand that the calculation of the conjugate graph 39C is implemented at each change in the airport navigation network 12B. As a further variant, the computation of the conjugate graph 39C is carried out on the ground and the conjugate graph is stored directly in a database and is then embedded in the memory 17 of the electronic taxiway generation system 10. simplifying and lightening the processing carried out in the generation electronic system 10. According to the second exemplary embodiment, at the end of calculation 126 of the conjugate graph 39C, the method proceeds to step 130, during which the nodes input conjugates 42C, output 43C, start 44C and arrival 45C are determined from the acquired graph, that is to say the conjugate graph 39C calculated in this case. During the determination step 130, the determining device 40 determines, according to the first reception example, when the initial graph 39 complies with the ARINC 816-2 standard, the input nodes 42, output 43, of the departure 44 and arrival 45 directly from said initial graph 39 received, the latter containing for each airport element information relating to the input nodes in said element and output of said element. According to the second exemplary embodiment, during the determination step 130, the determining device 40 determines the input conjugate nodes 42C, output 43C, start 44C and arrival 45C from the calculated conjugate graph 39C. Each conjugate node corresponds to a single authorized direction of navigation, the determining device 40 determines said conjugate nodes 42C, 43C, 44C arrival and 45C arrival depending on, on the one hand, the unique authorized navigation direction associated with each of the conjugate nodes, and secondly, the direction of flow from the starting element 34 to the arrival element 35 of the acquired clearance 32. Optional complement of the second embodiment , the conjugate nodes 42C, 43C, 44C, 45C corresponding to the same element 34, 35, 36 of clearance are further grouped together. At the end of the determination step 130, the first computing device 46 calculates, during the step 140, the external paths 48 and the internal path (s) 52. The calculation step 140 then comprises a step 142 for computing the external paths 48 and having the step 144 for calculating the internal path or paths 52. During the calculation step 142, the first computing device 46 then calculates, in the acquired graph 39, 39C, each external path 48 connecting an output node 43, 43C associated with an element of the clearance to an input node 42, 42C associated with the next element of said element in the clearance, through one or more arcs, each starting node 44 , 44C forming an output node 43, 43C and each arrival node 45, 45C forming an input node 42, 42C, as shown in FIG. 5. In the calculation step 144, the first computing device 46 calculates, in the acquired graph 39, 39C, each internal path 52 connecting, for a lement intermediate 36 corresponding one of the input nodes 42, 42C and outlet 43, 43C of said intermediate member 36 through one or more arches. The step of calculating the external paths 142 is, for example, performed before the step of calculating the internal path (s) 144. As a variant, the step of calculating the internal path (s) 144 is performed before the calculation step. External routes 142. As a further variant, the step of calculating the external paths 142 and / or the step of calculating the internal path (s) 144 are performed in a preliminary manner, before the step 110 of acquisition of the clearance. and these steps are then performed for all the clearance elements associated with the airport domain 12A, and not only for the elements of the acquired clearance 32. The calculated external 48 and / or internal paths 52 are then stored in the memory 17. This then makes it possible to reduce the time required for calculating the global path 56 from the moment when the clearance 32 is acquired, and thus to generate the ground taxiing trajectory more rapidly 11. The fact that the calculation time requires in calculation steps 142, 144 is longer according to this variant, since the path calculations are performed on all the clearance elements, and not only on the elements of the acquired clearance 32, is not penalizing. since these calculation steps 142, 144 are then performed initially, and for example by an information processing unit external to the aircraft. During the step performed first among the step of calculating the external paths 142 and the step of calculating the internal path (s) 144, the calculated paths 48, 52 have, according to the predetermined cost function, a minimum value. In other words, the first computing device 46 calculates, during said step performed first among the steps 142 and 144, the corresponding shortest path or paths. During the step carried out second among the step of calculating the external paths 142 and the step of calculating the internal path (s) 144, the paths 48, 52 are computed to be compatible with the shortest path (s) calculated in first, that is to say connect the input nodes 42, 42C and output 43, 43C belonging to the shortest paths computed first. In optional addition, the first computing device 46 calculates, during the steps 142 and / or 144, several external paths 48 and / or respectively internal 52 for at least one transition. In other words, the first computing device 46 calculates several shorter paths for at least one transition during these steps 142 and / or 144. The plurality of external paths 48 and / or respectively internal paths 52 calculated for the transition in question then corresponds to the values obtained for said transition according to the predetermined cost function.
    [0016] During the steps 142 and 144, the paths 48, 52 are for example calculated using a corresponding algorithm for searching for a shorter path in a graph, such as the Dijkstra algorithm, the DLU algorithm or else the algorithm A *. The Dijkstra algorithm is preferably used during the calculation steps 142 and 144. At the end of the step 140 for calculating the external and internal paths, the second computing device 54 calculates, during the step 150, the global path 56 between corresponding start nodes 44, 44C and arrival 45, 45C, from the internal (s) 52 and external 58 paths computed previously during the calculation steps 142 and 144. The calculated global path 56 is then consisting of internal (s) 52 and external 58 paths computed beforehand during computing steps 142 and 144. The global path 56 is also calculated using a corresponding algorithm for finding a shorter path, such as the algorithm Dijkstra, the DLU algorithm or the algorithm A *. The algorithm A * is preferentially used during the calculation step 150. In addition, the generation method according to the invention comprises several iterations of the steps for calculating the external paths 142, for calculating the internal path (s) 144, and computation of the global path 150, and the method then comprises at the end of step 150, a step 160 during which the generation system 10 determines whether a new iteration is necessary or not. During this determination step 160, the generation system 10 determines whether a reiteration is necessary according to whether or not a predefined criterion is reached, and if there is still at least one transition for which a shorter path n has not been searched yet. The predefined criterion is, for example, a maximum value according to the predetermined cost function of the calculated global path 56. In other words, according to this criterion, a new iteration is necessary as long as the value according to the cost function of the last calculated global path 56 is greater than said maximum value, and if there still remains at least one transition for which a shorter path has not been searched yet. As a variant, the predefined criterion is to continue as long as a global path is not determined, optionally with a maximum number of iteration loops. When a new iteration is necessary, the generation system 10 then returns to step 140 in order to calculate new external 46 and / or internal paths 52.
    [0017] During a new iteration, new external 46 and internal 52 paths are searched among the paths other than those calculated during the previous iteration (s). During the step performed, during the new iteration, first among the step of calculating external paths 142 and the step of calculating internal path (s) 144, the new calculated path (s) 48, 52 have, according to the predetermined cost function, a minimum value among the values of said other paths, the step of calculating the global path 150 then being performed again to calculate a new global path 56 from further new external paths 48 and internal 52 The new global path is then retained only if it has, according to the predetermined cost function, a value lower than that of the global path calculated during the previous iteration (s). In addition, among the new computed external and internal paths, only the one or more paths used in the new global path 56 are kept, the other one or more of said new external and internal paths being then ignored.
    [0018] A new calculated external or internal path is likely to improve the overall path 56 so far only if the sum of the costs, according to the predetermined cost function, of this new calculated path and the best paths for the transitions other than those corresponding the new calculated path is less than the cost, according to said cost function, of the global path 56 computed so far, that is to say the global path 56 calculated during the previous iteration.
    [0019] Those skilled in the art will also observe the shortest overall path 56 in the sense of the predetermined cost function does not necessarily pass through the paths that are for each shortest transition in the sense of said cost function. For example, at each iteration, calculation of the external paths 142 is carried out before the step of calculating the internal path (s) 144. In a variant, the step of calculating the internal path (s) 144 is, at each iteration, carried out before the step of calculating the external paths 142. When the generation system 10 determines, during the step 160, that a new iteration is not necessary, the generation system 10 then proceeds to the next step 170, to the wherein the generating device 58 generates the ground taxi path 11 from the best overall path 56 calculated in step 150. The generating device 58 then reconstructs the flight path in the airfield. 12A oportuary passing through the corresponding navigation arcs 64, in the initial graph 39 according to the first embodiment, or in the conjugate graph 39C according to the second embodiment, the best calculated overall path 56.
    [0020] In addition, the generating device 58 transmits, in step 170, the ground taxiing trajectory 11 to the display screen 15 for displaying it to the flight crew. the aircraft or an operator of a control tower. Alternatively or additionally, generating device 58 transmits the ground taxi trajectory 11 generated to a corresponding onboard avionics system.
    [0021] In addition, the generation of the ground taxiing trajectory from the acquired clearance makes it possible to extend to the ground zones the management of the aircraft by the avionics, in order to improve the fluidity of the traffic in the airport domain 12A. In addition, the generation of the taxiing track from the acquired clearance allows the establishment of warning systems to reduce the risk of ground accident (runway incursion, hooking, etc.). In addition, the generation of the taxiing trajectory from the acquired clearance allows the determination of the taxiing time and therefore the management of the aircraft throughout its mission from a boarding gate to departure. at a landing gate on arrival.
    [0022] The system for generating the trajectory 10 then makes it possible to calculate the shortest path, according to the predetermined cost function, in the graph 39, 39C with constraints of obligatory passage by certain elements of the airport domain 12A, corresponding to the elements of the clearance. The trajectory generation system 10 then makes it possible to break down this shortest path search problem into an ordered series of subproblems, by first searching for either the shortest external paths 48 or the shortest internal paths. 52. This decomposition into sub-problems, that is to say the calculation of the external paths 48, on the one hand, and the internal path (s) 52, on the other hand, then makes it possible to reduce the necessary processing time. to the information processing unit 14, as well as the amount of memory 17 used, to calculate the best overall path 56, then generate the running trajectory 11. The man of the The profession will understand that the generation method according to the invention then implements, for example, the heuristic according to which the shortest global path passes through the shortest transitions between each element of the clearance, that is to say the heuristic of favoring the shortest paths for each transition. This is optional. The generation method is further optimized by calculating the external 48, internal 52 and global 56 incrementally paths as a plurality of iterations, each iteration including a step of calculating the external paths 142, a calculation step of the internal paths 144 and a calculation step of the global path 150. This incremental calculation then makes it possible to further reduce the overall processing time, as well as the amount of memory used. It is thus conceivable that the method and the generation system 10 according to the invention makes it possible to improve the generated rolling trajectory 11, this being for example shorter and / or less fuel consuming.
    权利要求:
    Claims (15)
    [0001]
    CLAIMS1.- A method for generating a ground taxiing trajectory (11) of an aircraft in an airport domain (12A), the method being implemented by a computer and comprising the following steps: - the acquisition (110 ) a clearance (32) with a starting element (34), an arrival element (35) and at least one intermediate element (36) from the airport domain (12A) that the aircraft must borrow between the element and the arrival element, - the acquisition (120) of a graph (39, 39C) corresponding to an airport navigation network (12B), the navigation network (12B) being associated with the airport domain (12A), said graph (39, 39C) having a plurality of arcs (64), each arc (64) having two end nodes (65), - the determination (130), from the acquired graph ( 39, 39C), at least one input node (42, 42C) and at least one output node (43, 43C) for each intermediate element (36) of the clearance, at least one start node (44, 44C) for the starting element (34) and at least one arrival node (45, 45C) for the element of arrival (35), characterized in that it further comprises the following steps: - the calculation (142), in the acquired graph (39, 39C), of a plurality of paths (48) external to the elements (34); , 35, 36) of the clearance, and the calculation (144), in the acquired graph (39, 39C), of at least one path (52) internal to each intermediate element (36) of the clearance, each external path (48) connecting an output node (43, 43C) of an element of clearance to an input node (42, 420) of the next element of said element in the clearance, each start node (44, 440) forming an output node (43, 430) and each arrival node (45, 45C) forming an input node (42, 42C), each internal path connecting, for a corresponding intermediate element, nodes of input (42, 42C) and output (43, 43C) dudi t intermediate element, passing through one or more arcs, during the step performed first among the step of calculating external paths (142) and the step of calculating the internal path (s) (144), the or the calculated paths have, according to a predetermined cost function, a minimum value, - the calculation (150) of a global path (56) between starting nodes (44, 440) and arrival nodes (45, 45C) corresponding, from the internal (s) (52) and external (48) calculated paths, and- generating (160) the ground taxi path (11) from the calculated global path (56).
    [0002]
    2. A method according to any one of the preceding claims, wherein the method comprises several iterations between the step of determining the input and output nodes (130) and the step of generating the running trajectory (170). ), each iteration comprising a step of calculating the external paths (142), a step of calculating the internal path (s) (144) and a step of calculating the global path (150), during a new iteration, of the new paths. external and internal are searched among the paths other than those calculated during the previous iteration or iterations, and during the step performed, during the new iteration, first among said steps (142, 144) for calculating the external paths and internal (s), the one or more calculated paths have, according to the predetermined cost function, a minimum value among the values of said other paths, the step of calculating the overall path (150) being then performed again to calculate a new global path (56) from further new external and internal paths.
    [0003]
    3. The method of claim 2, wherein the new global path is retained only if it has, according to the predetermined cost function, a value less than that of the global path calculated during the previous iteration or iterations.
    [0004]
    The method of claim 3, wherein out of the newly computed external and internal paths, only the one or more paths used in the new global path are retained, the other one or more of said new external and internal paths then being ignored.
    [0005]
    5. A method according to any one of claims 2 to 4, wherein the step of calculating the external paths (142) is, at each iteration, performed before the step of calculating the internal path (s) (144).
    [0006]
    6. A method according to any one of claims 2 to 4, wherein the step of calculating the internal path (s) (144) is, at each iteration, performed before the step of calculating the external paths (142). 35
    [0007]
    7. A method according to any one of the preceding claims, wherein the cost function associated with a path is selected from the group consisting of: the curvilinear length of the path, the amount of fuel consumed on said path, a representative function of congestion on said path, a function representative of a risk of accident on said path, a function representative of the travel time of said path and a function combining the aforementioned functions.
    [0008]
    8. A method according to any one of the preceding claims, wherein the step of acquiring the graph (120) comprises the reception (122) of an initial graph of airport navigation (39), said initial graph (39). ) having a plurality of navigation arcs (64), each navigation arc (64) having two end nodes (65) and having at least one authorized navigation direction.
    [0009]
    9. A method according to claim 8, wherein the initial airport navigation graph (39) then forms the acquired graph, the steps of determining the input and output nodes (130), calculating the external and internal paths. (s) (142, 144) and calculation of the overall path (150) are then performed from the initial graph of airport navigation (39). 20
    [0010]
    The method of claim 8, wherein the step of acquiring the graph (120) further comprises: determining (124) a conjugate node for each navigation arc (64) and for each allowed sense navigating said arc (64), each conjugate node corresponding to a single authorized direction of navigation and representing said arc (64) of the initial graph (39) associated with said authorized navigation direction; and calculating (126) a conjugate graph (39C) comprising conjugated arcs connecting the conjugate nodes as a function of the links between the arcs of the initial graph and authorized directions of navigation, two interconnected conjugate nodes corresponding to two arcs (64) successive of the initial graph (39) and to the same authorized direction of navigation, and wherein the conjugate graph (39C) then forms the acquired graph, the steps of determining the input and output nodes (130) , calculating the external and internal paths (142, 144) and calculating the overall path (150) are then performed from the conjugate graph (390). 35
    [0011]
    11. The method of claim 10, wherein the step of acquiring the graph (120) further comprises the classification of the conjugate nodes determined in first and second distinct subsets, the first subset comprising the one or more conjugate nodes corresponding to navigable arcs for any clearance and the second subset comprising the conjugate node or nodes corresponding to navigable arcs only for one or more clearances.
    [0012]
    12. The method of claim 11, wherein the conjugate nodes (42C, 43C, 44C, 45C) corresponding to the same element (34, 35, 36) of clearance are further grouped together.
    [0013]
    13.- Method according to any one of claims 10 to 12, wherein the method comprises the acquisition (100) of at least one quantity relative to an aircraft considered among the mass of the aircraft and at least one relative dimension to the congestion of the aircraft, and in determining the conjugate nodes (124), a conjugate node is determined for a respective arc (64) only if said arc is compatible with the acquired magnitude.
    [0014]
    14. A computer program product comprising software instructions which, when implemented by a computer, implement a method according to any one of the preceding claims.
    [0015]
    15.- electronic system (10) for generating a taxiing trajectory (11) of an aircraft in an airport domain (12A), the system (10) comprising: a first acquisition device (30) configured to acquire a clearance (32) comprising a starting element (34), an arrival element (35) and at least one intermediate element (36) of the airport domain (12A) that the aircraft must borrow between the element (34) and the arrival element (35), - a second acquisition device (38) configured to acquire a graph (39, 39C) corresponding to an airport navigation network (12B); navigation (12B) being associated with the airport domain (12A), said graph (39, 39C) comprising a plurality of arcs (64), each arc (64) having two end nodes (65), - a determining device (40), from the acquired graph (39, 39C), at least one input node (42, 42C) and at least one node of output (43, 43C) for each intermediate element (36) of the clearance, at least one start node (44, 44C) for the starting element (34) and at least one arrival node (45). , 45C) for the arrival element (35), the system (10) being characterized in that it further comprises: - a first computing device (46) configured to calculate, in the acquired graph (39, 39C), a plurality of paths (48) external to the clearance elements (34, 35, 36) and at least one path (52) internal to each intermediate element (36) of the clearance, each external path (48) connecting an output node (43, 43C) of an element of the clearance to an input node (42, 42C) of the next element of said element in the clearance through one or more arcs, each start node (44, 44C) forming an output node (43, 43C) and each arrival node (45, 45C) forming an input node (42, 420), each internal path (52) connecting, for an element corresponding intermediary, input (42, 42C) and output (43, 430) nodes of said intermediate element, through one or more arcs, the first calculated one or more of the external paths (48), on the one hand, and the internal path (s) (52), on the other hand, having a minimum value according to a predetermined cost function, - a second computing device (54) configured to calculate a global path (56) between nodes corresponding start (44, 44C) and arrival (45, 450), from the internal (s) (52) and external (48) paths calculated by the first computing device (46), and - a device ( 58) for generating the ground taxi path (11) from the overall path (56) calculated by the second computing device (54).
    类似技术:
    公开号 | 公开日 | 专利标题
    FR3030854A1|2016-06-24|METHOD AND SYSTEM FOR GENERATING A GROUND RUNWAY TRACK FROM AN AIRCRAFT IN A AIRPORT DOMAIN, COMPUTER PROGRAM PRODUCT
    EP2448802B1|2014-05-07|Method for determining driving conditions of a vehicle in advance
    EP3003815B1|2017-08-09|Device for estimating the operating time of a motor vehicle in autonomous mode and associated method
    EP2463844B1|2013-06-26|Method and device for creating an optimum flight path to be followed by an aircraft
    EP2047345B1|2010-01-06|Method for determining the driving limits of a vehicle
    EP1071986B1|2004-04-14|Method for generating a horizontal path avoiding dangerous zones for an aircraft
    FR3012630A1|2015-05-01|METHOD FOR AIDING NAVIGATION FOR AN AIRCRAFT IN DESCENT AND APPROACH WITH REDUCED PUSH
    FR2912242A1|2008-08-08|Engine failure management assisting method for multi-engine cargo aircraft, involves displaying airports that do not satisfy preset conditions, and associated predictions on visual display unit of aircraft
    FR2898672A1|2007-09-21|METHOD FOR AIDING NAVIGATION OF AN AIRCRAFT WITH FLIGHT PLAN UPDATE
    FR3002657A1|2014-08-29|METHOD FOR THE PREPARATION OF A VERTICAL TRACK PROFILE COMPRISING MULTIPLE LEVELS OF ALTITUDE
    FR2967253A1|2012-05-11|METHOD AND DEVICE FOR DETERMINING A GUIDANCE PATH TO A DESTINATION
    FR2912243A1|2008-08-08|Engine failure management assisting method for multi-engine cargo aircraft, involves determining aircraft guiding setpoints e.g. speed and altitude setpoints, to rejoin airport and transmitting setpoints to system, during failure detection
    FR3030853A1|2016-06-24|METHOD AND APPARATUS FOR CALCULATING A COMBINED AIR NAVIGATION GRAPH, METHOD AND SYSTEM FOR GENERATING AN AIRCRAFT GROUND TRAILER, COMPUTER PROGRAM PRODUCT
    CA3048689A1|2020-01-11|Aircraft mission calculation system through combination of algorithms and associated process
    EP1835370A2|2007-09-19|Automatic trajectory planner
    FR2994010A1|2014-01-31|DEVICE AND METHOD FOR MANAGING NAVIGATION POINT JOINT STRATEGY
    FR3049740A1|2017-10-06|METHOD FOR OPTIMIZED MANAGEMENT OF AIRCRAFT TRAFFIC IN AN AIRPORT
    FR2915824A1|2008-11-07|Aircraft exit optimizing method, involves adjusting distance of inbound and outbound legs of race-track pattern during identical final laps such that aircraft is at proximity of exit point when duration is completed
    WO2020187880A1|2020-09-24|Determination of a shortened trajectory of a moving object travelling in a corridor
    EP3599445A1|2020-01-29|Method for determining an itinerary minimising the energy expenditure of a hybrid vehicle by means of an extended added graph
    EP3543654A2|2019-09-25|Method and system for assisting an operator with creating a flight plan of an aircraft passing through a set of mission areas to be covered
    FR3044086A1|2017-05-26|METHOD AND DEVICE FOR CALCULATING A SECURE TRACK FROM THE CURRENT POSITION OF AN AIRCRAFT UP TO A POINT OF ATTACHMENT
    FR3084506A1|2020-01-31|METHOD FOR ORDERING A MOTOR VEHICLE FOR THE FORMATION OF PLATFORMS
    EP3489930A1|2019-05-29|Mission computing system for an aircraft, comprising a computation engine for the aircraft path during the mission and associated method
    FR3109126A1|2021-10-15|Method and device for automatically determining the trajectory of an autonomous vehicle
    同族专利:
    公开号 | 公开日
    FR3030854B1|2017-01-27|
    US20160343262A1|2016-11-24|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    FR2924829A1|2007-12-11|2009-06-12|Airbus France Sas|METHOD AND DEVICE FOR GENERATING A TRACK FOR AN AIRCRAFT GROUNDING|
    EP2235477A1|2008-01-24|2010-10-06|Mediamobile|Estimation of the shortest route on a time basis in a road network|
    FR3004250A1|2013-04-03|2014-10-10|Thales Sa|METHOD FOR DETERMINING A TRACKING PATH OF AN AIRCRAFT ON AN AIRPORT ZONE.|
    US8731811B2|2011-10-20|2014-05-20|Honeywell International Inc.|Methods and systems for displaying a taxi clearance|
    US9666085B2|2014-11-14|2017-05-30|Honeywell International Inc.|Methods and systems for displaying a taxi clearance|
    FR3030853B1|2014-12-19|2017-01-27|Thales Sa|METHOD AND APPARATUS FOR CALCULATING A COMBINED AIR NAVIGATION GRAPH, METHOD AND SYSTEM FOR GENERATING AN AIRCRAFT GROUND TRAILER, COMPUTER PROGRAM PRODUCT|US20170167882A1|2014-08-04|2017-06-15|Xerox Corporation|System and method for generating available ride-share paths in a transportation network|
    US9495879B2|2014-12-10|2016-11-15|Airbus Operations Sas|Systems and methods for providing optimized taxiing path operation for an aircraft|
    FR3030853B1|2014-12-19|2017-01-27|Thales Sa|METHOD AND APPARATUS FOR CALCULATING A COMBINED AIR NAVIGATION GRAPH, METHOD AND SYSTEM FOR GENERATING AN AIRCRAFT GROUND TRAILER, COMPUTER PROGRAM PRODUCT|
    NL2017238B1|2016-07-25|2018-01-31|Xinaps B V|A method and an apparatus for calculating a distance in an area|
    US20190096268A1|2017-09-26|2019-03-28|Honeywell International Inc.|System and method for airport terminal area trajectory data clustering for selecting efficient terminal area procedures|
    US10789854B1|2019-11-05|2020-09-29|Rockwell Collins, Inc.|Graphical depiction of an exclusion zone on an airport movement surface|
    法律状态:
    2015-12-31| PLFP| Fee payment|Year of fee payment: 2 |
    2016-06-24| PLSC| Search report ready|Effective date: 20160624 |
    2016-12-29| PLFP| Fee payment|Year of fee payment: 3 |
    2018-01-02| PLFP| Fee payment|Year of fee payment: 4 |
    2019-12-30| PLFP| Fee payment|Year of fee payment: 6 |
    2020-12-28| PLFP| Fee payment|Year of fee payment: 7 |
    优先权:
    申请号 | 申请日 | 专利标题
    FR1402941A|FR3030854B1|2014-12-19|2014-12-19|METHOD AND SYSTEM FOR GENERATING A GROUND RUNWAY TRACK FROM AN AIRCRAFT IN A AIRPORT DOMAIN, COMPUTER PROGRAM PRODUCT|FR1402941A| FR3030854B1|2014-12-19|2014-12-19|METHOD AND SYSTEM FOR GENERATING A GROUND RUNWAY TRACK FROM AN AIRCRAFT IN A AIRPORT DOMAIN, COMPUTER PROGRAM PRODUCT|
    US14/977,284| US20160343262A1|2014-12-19|2015-12-21|Method and System for Generating a taxi routing of an aircraft in an airport area, related computer program product|
    [返回顶部]