公开(公告)号：US20160343262A1

公开(公告)日：2016-11-24

申请号：US14977284

申请日：2015-12-21

Applicant: Thales

Inventor： Rémy Auletto ,  Johann Dreo ,  Pierre Saveant

IPC: G08G5/06 ,  G08G5/00 ,  G01C21/34

CPC classification number: G08G5/065 ,  G01C21/3438 ,  G01C21/3469 ,  G01C21/3492 ,  G08G5/0043

Abstract: A method for generating a taxi trajectory of an aircraft in an airport area includes the acquisition of a clearance including departure, arrival and intermediate elements of said area, the acquisition of a graph, and the determination, based on said graph, of entry and/or exit nodes for each element. It also includes the calculation, in the graph, of paths that are external to the elements and a path that is internal to each intermediate element, each external path connecting an exit node of one element to an entry node of the following element, each internal path connecting the entry node and exit node of said intermediate element, the paths calculated at first among the external and internal paths having a minimal cost; the calculation of a global path based on the internal path(s) and external paths and the generation of said taxi trajectory based on the global path.

Abstract translation: 一种用于在机场区域产生飞行器的出租车轨迹的方法包括获取包括所述区域的出发，到达和中间元素，图形的获取以及基于所述图形的确定的入场和/ 或每个元素的退出节点。 它还包括在图中计算元素外部的路径和每个中间元素内部的路径，每个外部路径将一个元素的退出节点连接到以下元素的入口节点，每个内部 连接所述中间元件的入口节点和出口节点的路径，首先在具有最小成本的外部和内部路径中计算的路径; 基于内部路径和外部路径计算全局路径，并基于全局路径生成所述出租车轨迹。

公开(公告)号：US09715832B2

公开(公告)日：2017-07-25

申请号：US14992929

申请日：2016-01-11

Applicant: THALES

Inventor： Christophe Pierre ,  Rémy Auletto ,  Benoit Dacre-Wright

IPC: G06F19/00 ,  G08G5/00 ,  G01C21/20 ,  G01W1/02 ,  G06F7/72

CPC classification number: G08G5/0039 ,  G01C21/20 ,  G01W1/02 ,  G06F7/724 ,  G08G5/0034 ,  G08G5/0052 ,  G08G5/0091

Abstract: A navigation aid method for an aircraft flying a reference trajectory between a point of departure and a point of arrival subject to a field of wind vectors comprises: decomposing the reference trajectory into a plurality of discrete waypoints Pi, loading meteorological data comprising the field of wind vectors, iterating the following steps N times, to generate an improved trajectory: for each waypoint Pi named current point, determining a reference plane, determining an orthonormal reference frame, determining a wind curl ((∇W)Pi), determining a sign of the projection of the wind curl on axis zi ((∇W)zi Pi), determining a direction of displacement from the current point Pi to a new current waypoint Pi′, determining a line of displacement, determining a displacement distance, determining the new current waypoint, determining a new trajectory, assigning the new waypoints Pi′ determined in the preceding iteration to the waypoints Pi for the next iteration.

公开(公告)号：US10424208B2

公开(公告)日：2019-09-24

申请号：US14991704

申请日：2016-01-08

Applicant: THALES

Inventor： Christophe Pierre ,  Rémy Auletto ,  Benoît Dacre-Wright

IPC: G08G5/00 ,  G01C21/00 ,  G01C21/20 ,  G01C23/00 ,  G01W1/00

Abstract: A navigational aid method of an aircraft, carried out by a flight management system, for comparing a reference trajectory of the aircraft subjected to a wind vector field with a new trajectory between the same starting and end points, respectively, the method comprises: determining the reference trajectory, determining the new trajectory, loading meteorological data, determining a directional surface, delimited by a directional closed curve, consisting of the new trajectory, from the starting point to the end point, closed by the opposite of the reference trajectory from the end point to the starting point, determining a wind curl on the basis of the wind vector field, determining a flow of the wind curl through the surface, a positive value of flow indicating that the new trajectory makes better use of the wind load, a negative value of flow indicating that the new trajectory makes less effective use of the wind load.

公开(公告)号：US10126756B2

公开(公告)日：2018-11-13

申请号：US14861610

申请日：2015-09-22

Applicant: THALES

Inventor： Johan Boyer ,  Rémy Auletto ,  Norbert Baloche

IPC: G05D1/04 ,  G01C21/00 ,  G05D1/06 ,  G01C23/00 ,  G08G5/02 ,  G08G5/00

Abstract: A method for adapting an aircraft constant-gradient descent segment comprises: an acquisition step in which state variables characterizing the aircraft, environment variables characterizing the environment thereof and path variables characterizing the predicted path thereof at one of the initial and final points of the segment are acquired; a calculation step whereby a limit ground gradient for at least one performance criterion is calculated from the state variables, environment variables and path variables; a validity verification step checking the validity of the path initially predicted against the most restrictive limit ground gradient; and when the path initially predicted is not valid: a feasibility verification step checking the feasibility of a command to modify at least one state variable; if feasibility is verified, a prediction of executing the command; otherwise, a prediction of modifying one of the initial and final points of the segment with respect to constraints of the flight plan.

公开(公告)号：US09779630B2

公开(公告)日：2017-10-03

申请号：US14977172

申请日：2015-12-21

Applicant: Thales

Inventor： Rémy Auletto ,  Johann Dreo

IPC: G08G5/06 ,  G01C23/00 ,  G01C21/34 ,  G01C21/20

CPC classification number: G08G5/065 ,  G01C23/00

Abstract: This method for computing a conjugated airport navigation graph, from an initial airport navigation graph, is implemented by a computer.This method involves acquiring the initial graph including a plurality of navigation arcs, each including two end nodes, having at least one authorized navigation direction and being identified by its two end nodes.This method further involves determining a conjugated node for each navigation arc and for each authorized navigation direction of the arc, each conjugated node corresponding to a single authorized direction and representing the arc of the initial graph associated with the authorized direction. The conjugated graph is computed by connecting the conjugated nodes as a function of the connections between the arcs of the initial graph and the authorized directions. Two conjugated nodes connect to one another corresponding to two successive arcs of the initial graph and to a same authorized direction.

公开(公告)号：US20160180720A1

公开(公告)日：2016-06-23

申请号：US14977172

申请日：2015-12-21

Applicant: Thales

Inventor： Rémy Auletto ,  Johann Dreo

IPC: G08G5/06

CPC classification number: G08G5/065 ,  G01C23/00

Abstract: This method for computing a conjugated airport navigation graph, from an initial airport navigation graph, is implemented by a computer.This method comprises acquiring the initial graph including a plurality of navigation arcs, each including two end nodes, having at least one authorized navigation direction and being identified by its two end nodes.This method further comprises determining a conjugated node for each navigation arc and for each authorized navigation direction of said arc, each conjugated node corresponding to a single authorized direction and representing said arc of the initial graph associated with said authorized direction; and computing the conjugated graph by connecting the conjugated nodes as a function of the connections between the arcs of the initial graph and the authorized directions, two conjugated nodes connected to one another corresponding to two successive arcs of the initial graph and to a same authorized direction.

Abstract translation: 这种从初始机场导航图计算共轭机场导航图的方法由计算机实现。 该方法包括获取包括多个导航弧的初始图，每个导航弧包括两个终端节点，具有至少一个授权的导航方向并由其两个端节点识别。 该方法还包括确定每个导航弧的共轭节点和对于所述弧的每个授权导航方向，每个共轭节点对应于单个授权方向并且表示与所述授权方向相关联的初始图形的所述弧; 并且通过将共轭节点作为初始图形的弧线与授权方向之间的连接的函数来连接共轭节点来计算共轭图，两个共轭节点彼此相对应地对应于初始图形的两个连续的弧并且具有相同的授权方向 。