1. Field of the Invention
The field of the invention is that of the flow of aircraft traffic over the airport areas before they takeoff or after they have landed and of the electronic and data processing means allowing the route to be followed over these areas to be indicated to the crews.
2. Description of the Prior Art
Conventionally, during taxiing phases over an airport area, the pilots receive taxiing instructions from the air traffic control or ATC.
Currently, some onboard systems can calculate the route to be followed based on these instructions and display this route on electronic airport maps in order to simplify the navigation task of the pilots. The system must therefore recognize the clearances perfectly in order to be able to process them and display them.
Several solutions are possible for inputting the clearances. Indeed, the clearance can be entered into the system:
In the case of a manual intervention by the pilot, inputting on an alphanumeric keyboard offers the advantage of being able to use editing means such as the MCDU units already present on many aircraft.
In general, the taxiing instructions indicate the destination which, by way of example, might be “holding position”, “stand”, “runway” then the route to be followed composed of names of taxiways. Thus, an instruction generally takes the following form:
TAXI TO [Halt Position] VIA [Specific Route to be Followed]
In order to input an instruction without ambiguities, this instruction must be input by introducing a separator between each airport element so as to allow the system to easily find it and without errors in a database. For example, the instruction ATC: “TAXI TO stand E10 VIA taxiways T40, T41 and M2” corresponds to the pilot inputting the following: “E10-T40-T41-M2”. However, the addition of a separator between each element adds a workload for the pilot who runs the risk of not having the time to input the complete instruction dictated to him by the ATC.
The object of the invention is to provide means and a method allowing the separators in the input carried out by the pilot to be partially or totally eliminated from the ATC instructions. In this case, the system must demonstrate a certain intelligence in order to reconstruct the route starting from indistinctive elements input by the pilot.
More precisely, the first subject of the invention is a method for creation of a taxiing route over an airport area comprising at least the following steps:
Advantageously, the routes established in step 3 of the method are generated by means of a connection graph for the elements of the airport area, each corresponding airport element being described by a polygon, each polygon being defined in an airport database by a name, a type, a set of segments and a set of connection points, each connection point corresponding to a common border with another polygon, all of the segments connecting the connection points of each polygon forming the connection graph.
The invention also relates to a system for creation of a taxiing route over an airport area allowing the preceding method to be implemented, characterized in that the said system comprises:
Advantageously, the alphanumeric input device is an electronic unit “MCDU” or an alphanumeric input device using writing recognition or an alphanumeric input device using voice recognition.
The invention will be better understood and other advantages will become apparent upon reading the description that follows presented by way of non-limiting example and with regard to the appended figures amongst which:
The system for creation of a taxiing route over an airport area according to the invention is shown in
By way of example and for a comprehensive understanding of the method for creation of a taxiing route over an airport area according to the invention implemented by means of the preceding system,
As has been said, the method for creation of a taxiing route according to the invention comprises four main steps.
The first step consists, for the user, in inputting by means of the alphanumeric input device 1 an instruction representative of the succession of passing points representing the taxiing route to be created. Generally speaking, this instruction begins with the goal to be reached, in this case E, then the pilot successively inputs the intermediate clearances which are in the present case A, BC and D. As has been said, if these various elements are separated by a separator, the instruction is interpretable without ambiguities. If the pilot does not input any separators—for example, if the instruction input is EABCD—there exist various possible routes corresponding to this instruction. In this case, the method goes to the second step.
In the second step, the lexical analysis device 3 decomposes the instruction input into several successions of credible names of passing points, a credible name effectively corresponding to a name of an element of the airport area in the lexicon 2. In the case of
In the third step, using the database 4, the route calculation device 5 checks, for each possible succession, that the corresponding route is compatible with the connectivities existing between the various clearances of the succession. In the present case, as can be seen in
In the fourth step, as long as, following the second and the third steps, there exists one and only one credible route, in other words a route both corresponding to credible names of passing points and compatible with the connectivities existing between the various elements of the airport, the system displays the single route found on the display device 6. Of course, if the method does not find any route or, on the contrary, finds several of them, the pilot is warned that there is a problem. He must then verify the instruction input and, where necessary, modify it.
Number | Date | Country | Kind |
---|---|---|---|
11 01785 | Jun 2011 | FR | national |
Number | Name | Date | Kind |
---|---|---|---|
5272638 | Martin et al. | Dec 1993 | A |
5374932 | Wyschogrod et al. | Dec 1994 | A |
6161062 | Sicre et al. | Dec 2000 | A |
6232602 | Kerr | May 2001 | B1 |
6373055 | Kerr | Apr 2002 | B1 |
6405107 | Derman | Jun 2002 | B1 |
6411890 | Zimmerman | Jun 2002 | B1 |
6571166 | Johnson et al. | May 2003 | B1 |
6694249 | Anderson et al. | Feb 2004 | B1 |
6731226 | Walter | May 2004 | B2 |
6806469 | Kerr | Oct 2004 | B2 |
7102130 | Kerr | Sep 2006 | B2 |
7280896 | Morizet et al. | Oct 2007 | B2 |
7308343 | Horvath et al. | Dec 2007 | B1 |
7382284 | Armstrong et al. | Jun 2008 | B1 |
7382288 | Wilson | Jun 2008 | B1 |
7522977 | Foucart et al. | Apr 2009 | B2 |
7567187 | Ramaiah et al. | Jul 2009 | B2 |
7844392 | Dubourg | Nov 2010 | B2 |
8125352 | Dubourg et al. | Feb 2012 | B2 |
20020099528 | Hett | Jul 2002 | A1 |
20020120392 | Stratton et al. | Aug 2002 | A1 |
20040006412 | Doose et al. | Jan 2004 | A1 |
20040056952 | Konya | Mar 2004 | A1 |
20040059497 | Sankrithi | Mar 2004 | A1 |
20040160354 | Coldefy et al. | Aug 2004 | A1 |
20050015202 | Poe et al. | Jan 2005 | A1 |
20050190079 | He | Sep 2005 | A1 |
20070168111 | Dubourg | Jul 2007 | A1 |
20070250224 | Dwyer | Oct 2007 | A1 |
20080162092 | Coulmeau et al. | Jul 2008 | A1 |
20080191903 | Dubourg et al. | Aug 2008 | A1 |
20080270784 | Bonnet et al. | Oct 2008 | A1 |
20080275642 | Clark et al. | Nov 2008 | A1 |
20090001871 | Song | Jan 2009 | A1 |
20090018713 | Coulmeau et al. | Jan 2009 | A1 |
20100003929 | Sohn et al. | Jan 2010 | A1 |
20100039295 | Dubourg et al. | Feb 2010 | A1 |
20100107292 | Chevallier et al. | May 2010 | A1 |
20100114922 | Gayraud | May 2010 | A1 |
20100125403 | Clark et al. | May 2010 | A1 |
20100198489 | Rozovski et al. | Aug 2010 | A1 |
20100324807 | Doose et al. | Dec 2010 | A1 |
20110046868 | Michel et al. | Feb 2011 | A1 |
20110125400 | Michel et al. | May 2011 | A1 |
20110246003 | Lafon et al. | Oct 2011 | A1 |
20110257873 | Lussiez et al. | Oct 2011 | A1 |
20120215385 | He et al. | Aug 2012 | A1 |
Number | Date | Country |
---|---|---|
976 645 | Oct 1975 | CA |
2 613 740 | Jan 2007 | CA |
10 2006 062061 | Jul 2008 | DE |
1 988 365 | Nov 2008 | EP |
2 884 021 | Oct 2006 | FR |
2 888 342 | Jan 2007 | FR |
2 891 644 | Apr 2007 | FR |
2 891 646 | Apr 2007 | FR |
2 919 416 | Jan 2009 | FR |
2 922 072 | Apr 2009 | FR |
WO 9714114 | Apr 1997 | WO |
WO 9904304 | Jan 1999 | WO |
WO 03048888 | Jun 2003 | WO |
WO 2007006762 | Jan 2007 | WO |
WO 2008043763 | Apr 2008 | WO |
WO 2009016135 | Feb 2009 | WO |
Entry |
---|
French Search Report for Counterpart French Application No. 1101785, 7 pgs. (Feb. 28, 2012). |
Jon Koeners, et al.,“Pictorial representation of ATC instructions for airport surface operations: design and evaluation,” Digital Avionics Systems, 2001. DASC. 20th Conference, vol. 1, pp. 2D5/1-2D5/10 (2001). |
RTCA DO272/Eurocae ED99, “Users Requirements for Aerodome Mapping Information,” Paris, France, www.eurocae.org, pp. 1-125 (Oct. 2005). |
Number | Date | Country | |
---|---|---|---|
20120316766 A1 | Dec 2012 | US |