[0001] The present invention relates to a system and a method for alerting of potentially
hazardous situations in air traffic on the basis of surveillance data wherein predicted
conflicts are identified based on the prediction of future air traffic situations.
[0002] The ever growing air traffic increases the complexity of the air traffic picture
and the pressure under which radar controllers work. Under such circumstances, it
is desired to provide additional automated tools to assist the controller in his work,
by helping him better analyse complex traffic situations and take correct decisions
in time.
[0003] Safety net are automated tools intended to alert controllers of potentially hazardous
situations predicted in the near future. They are based on trajectories predicted
from surveillance data.
[0004] For example, the following main safety nets can be identified, as it is known from
"Operational Requirements Document for EATCHIP Phase III; ATM Added Functions"; Vol.
2: Safety Nets; Edition 2.0; EUROCONTROL, 25/01/1999; Document Number: OPR.ET1.ST04.DEL01.2.
The Short Term Conflict Alert (STCA) function, which predicts violations of defined separation criteria between
two aircraft;
The Minimum Safe Altitude Warning (MSAW) function, which predicts minimum safe altitude violations of an aircraft;
and
The Area Proximity Warning (APW) function, which predicts penetrations of protected airspaces by an aircraft.
[0005] "Conflict Alert for the Support of Radar Control in MADAP"; EUROCONTROL Maastricht
UAC, October 1990; Document Number: GD-0047-03 discusses the idea of discretizing
prediction time frames into a number of time points, called probes. For each probe,
the probing process generates a static traffic picture ("a snapshot") represented
by a set of predicted tracks;
[0006] "Operational Requirements for ETACHIP Phase III; ATM added Functions"; Vol. 2: Safety
Nets; Edition 2.0; EUROCONTROL, 25/01/1999; Document Number: OPR.ET1.ST04.DEL01.2
discusses the expression of the nature of a conflict in terms of properties of the
conflict as well as the definition of air space regions belonging to different region
types;
[0007] In "Conflict Probability Estimation for Free Flight"; Journal of Guidance, Control
and Dynamics; Vol. 20; no. 3; May-June 1997; pp. 588-596, R.A. Paielli and H. Erzberger
discuss a method to estimate the conflict probability for a pair of aircraft in free
flight wherein the trajectory prediction errors are based on the assumption of constant
airspeed (in both magnitude and direction) and on unpredictable variations in wind
speed;
[0008] Under normal circumstances a safety net is transparent to the controller. Whenever
the system detects a potential danger in the near future, it displays an alert message.
The controller can then identify an appropriate avoiding manoeuvre and communicate
the instructions to the pilot(s) concerned. This means that the radar controller should
not adopt a passive attitude by blindly relying on the safety net function and waiting
until an alert is indicated to him;
[0009] Air collisions and almost air collisions in the past and recent past confirm that,
firstly, safety nets play a fundamental role to assist the controller's work in the
ever growing air traffic and, secondly, there is considerable room for improvement
in the design and implementation of safety nets. Quoting Jane's Airport issue of September
2002 "Safety Revamp Triggered"; Jane's Airport; Vol. 14; issue 7; September 2002,
"The safety management culture of European ATM agencies will need an immediate overhaul".
[0010] It is an object of the present invention to provide a method and a system for reliably
alerting of potentially hazardous situations in air traffic which overcome the deficiencies
and drawbacks of the methods and systems known in the state of the art. It is an additional
or further object to provide a system and a method that allow to reliably detect potential
dangers in the near future, to reliably communicate an alert message in time and/or
which assist the controller's work. Furthermore or additionally, it is a preferred
object to provide a system and method that allow that a minimum distance be held,
a long-term surveillance, foresightedly behaviour and/or an adaptation of the method/system
to the actual circumstances.
[0011] These objects are solved by the features of the independent claims. The dependent
claims relate to preferred embodiments and further aspects of the present invention.
[0012] Before describing the present invention in detail, some general terms and features
will be defined.
[0013] In the following, a
conflict is a violation of defined safety criteria involving one or more aircraft. A
real conflict is a conflict that actually occurs. Such a conflict is a critical situation which
may have dramatic consequences and should always be avoided. A
predicted conflict is a conflict that is likely to occur in the near future. Such a conflict is based
on a prediction of air traffic situation in the near future. Safety net functions
and safety net systems according to the present invention identify both real and predicted
conflicts, whereas the latter may be seen as a generalization of the former.
[0014] Whereas the identification of a real conflict is a deterministic process, i.e., the
decision of whether or not one or more aircraft are in real conflict is simply determined
by the actual track data of the aircraft, the identification of a predicted conflict
is not a deterministic process. The reason for this lies in the non-deterministic
nature of future air traffic situation prediction in which errors are unavoidable.
This is because aircraft may perform unexpected manoeuvres or change the speed in
the prediction time frame etc. The farther in the future a prediction is made, the
greater the prediction error.
[0015] Since a safety net has to identify both real and predicted conflicts, as discussed
above, it is a fundamentally non-deterministic process. According to the present invention
a stochastic approach has been adopted in the design of a safety net algorithm, as
will be described later in detail.
[0016] Since the identification of predicted conflicts is based on the prediction of future
air traffic situations a well-designed trajectory prediction scheme is a key to achieve
an effective and efficient safety net algorithm.
[0017] For the present invention the
warning time of a conflict alert is defined as the time interval between the first communication
of an alert and the start of the predicted violation of the safety criteria. Ideally,
the warning time should be sufficiently large to cover the time needed by the radar
controller to formulate an appropriate avoiding manoeuvre and communicate it to the
pilot(s), plus the time need by the latter to perform a manoeuvre and eliminate the
potential danger. However, unpredictable late manoeuvres might severely restrict the
warning time by generating a predicted conflict in very short term.
[0018] A basic idea of the present invention consists of defining a stochastic model for
trajectory prediction in which the uncertainty of the prediction is represented as
a function of the prediction time. The stochastic model(s) for predicting trajectories
is preferably used to construct a stochastic model for conflict prediction. In the
latter stochastic model, probabilities of conflict are compared to minimum confidence
levels and allow to decide whether a given predicted situation is a predicted conflict
or not.
[0019] The minimum confidence level required to predict a conflict is defined as a function
of the urgency of the conflict, expressed by its prediction time. This function is
independent of the uncertainty of trajectory prediction.
[0020] The ability to specify, for each prediction time, the minimum confidence level required
to predict a conflict enables an optimal trade-off between in-time conflict prediction
and nuisance alert rate. In contrast, this optimal trade-off is more difficult to
achieve in a deterministic model which does not use any uncertainty information for
trajectory prediction.
[0021] In particular, the present invention provides a safety net method or method for alerting
of potentially hazardous situations in air traffic on the basis of surveillance data
wherein predicted conflicts are identified based on the prediction of future air traffic
situations by definition of a stochastic model for trajectory prediction in which
the uncertainty of the prediction is preferably based on a variable aircraft 3D speed
vector and is represented as a function of the prediction time. Further, preferably
at least one stochastic model of predicted trajectories is used for constructing a
stochastic model for conflict prediction in this method.
[0022] Preferably, the probabilities of conflict are compared to minimum confidence levels,
wherein a decision is made whether a predicted situation is a predicted conflict or
not based upon this comparison to minimum confidence levels.
[0023] The method preferably defines a minimum confidence level for predicting a conflict
as a function of the urgency of the conflict, expressed by its prediction time. Further,
a time interval between a first communication, e.g. by displaying etc., of an alert
and the start of the predicted violation of the safety criteria is preferably sufficiently
large to cover the time needed by a radar controller to formulate an appropriate avoiding
manoeuvre and communicate it to the pilot(s) plus the time needed by the latter to
perform the manoeuvre and eliminate the potential danger.
[0024] According to a preferred or further feature of the present invention different air
space regions are considered in order to cope with different flight activities and
conflict thresholds. Accordingly, each air space region is classified to belong to
a region type. Preferably, each region type has a different set of trajectory prediction
and conflict prediction parameters and hence different stochastic models for trajectory
and conflict prediction.
[0025] According to a further feature of the invention a new class of region types, called
manoeuvre region types, has been introduced in addition to the standard region types. Regions of these
types are centred at points in the vicinity of which aircraft are expected to perform
a manoeuvre. These points preferably correspond to VORDME (Very High Frequency Omnidirectional
Radio Range Distance Measuring Equipment) and NDB (Non Directional Beacon) way points.
Such manoeuvre regions are aimed at predicting aircraft manoeuvres.
[0026] When an aircraft enters a manoeuvre region, it is expected to perform a manoeuvre
in the near future, and the uncertainty of the trajectory prediction is automatically
increased.
[0027] Preferably, a different set of trajectory parameters is used and the uncertainty
of the trajectory prediction is adapted according to the respective region types and
the properties (e.g. position) of the respective aircraft(s).
[0028] Preferably, the method steps are repeated in cycles wherein a confirmation window
records the conflicts of the last cycles and wherein, at the end of one cycle, the
confirmation windows are updated with the conflicts predicted during this cycle. Further,
a conflict is confirmed and communicated if the conflict was predicted at least c
times in the last cycles and wherein the parameter c depends on the prediction time
frame and the region type of the aircraft involved in the conflict.
[0029] The method is suitable for all main safety nets such as, i.a., Short Term Conflict
Alert (STCA), Minimum Safe Altitude Warning (MSAW) and/or Area Proximity Warning (APW)
wherein the method may be adapted in order to fulfil special requirements of one or
more safety nets.
[0030] Accordingly, the method is preferably suitable for predicting violations of defined
separation criteria between at least two aircraft, for predicting minimum safe altitude
violations of at least one aircraft, and/or for predicting penetrations of protected
airspaces by at least one aircraft as well as for predicting other violations of safety
criteria in air traffic.
[0031] Further, the present invention provides a safety net system or system for alerting
of potentially hazardous situations in air traffic comprising a surveillance data
detection and processing means wherein predicted conflicts are identified based on
the prediction of future air traffic situations by a stochastic control means which
defines a stochastic model for trajectory prediction in which the uncertainty of the
prediction is represented as a function of the prediction time. Further, preferably
at least one stochastic processing and control means for predicted trajectories constructs
a stochastic model for conflict prediction. The conflict is further preferably communicated
by a conflict communication means.
[0032] Further additional and preferred features of the system correspond to the features
and preferred features of the method, as discussed above and below.
[0033] The system according to the present invention for alerting of potentially hazardous
situations in air traffic preferably comprises: structures or data structures, such
as an
input track, which contains all input track information relevant to the safety net; a
trajectory, i.e., a 3D trajectory for one aircraft; a
predicted track, which is an extrapolation of an input track; and/or a
conflict, which is the safety net output containing all relevant conflict information as well
as statistical data which are all data useful for a statistical analysis of the system.
Preferably the system further comprises the data structure
region type, which is a set of safety net parameters that depend on the region type.
[0034] The system further preferably comprises the following main modules:
input track filtering, which eliminates input tracks which do not satisfy certain selection criteria;
trajectory prediction, which generates predicted trajectories from input tracks;
trajectory probing, which discretizes the prediction time frame into a finite number of time points and
generates a predicted track on a given trajectory for each such time point; a
conflict prediction, which performs conflict prediction on predicted tracks and which is specific to each
individual safety net; a
conflict confirmation which confirms conflicts over several input track updates and/or
online statistical data collection, which collects online statistics and analyses the performance of the safety net systems.
Preferably, the system further comprises the main module
region type identification, which identifies the region type of an input track by determining the air space region
containing the track.
[0035] Preferably, the input of a safety net function is essentially based on radar data
and does not require continuous inputs from the radar controller for its proper functioning.
However, in order to reduce the number of nuisance alerts and avoid warning the radar
controller of a situation he already resolved, the system preferably also makes use
of aircraft intention information, e.g. cleared flight levels, provided by a flight
plan or controller input etc.
[0036] In the following the present invention will be described in further detail with reference
to the drawings, in which:
Fig. 1 shows a safety net interface;
Fig. 2 shows a generic safety net data flow diagram;
Fig. 3 shows a generic safety net state diagram;
Fig. 4 shows mean lateral trajectory and error variance;
Fig. 5 shows mean vertical trajectory, assigned level and error variance;
Fig. 6 shows lateral position, speed and error variance of predicted tracks;
Fig. 7 shows vertical position, speed and error variance of predicted tracks;
Fig. 8 shows a minimum probability as a function of the conflict urgency;
Fig. 9 shows a piecewise constant function for minimum probability;
Fig. 10 shows a data flow diagram of the conflict prediction module of STCA;
Fig. 11 shows grid and neighbours of STCA;
Fig. 12 shows lateral predicted tracks with error vectors and variances of STCA;
Fig. 13 shows combined positional error and separation infringement of STCA;
Fig. 14 shows the probability of separation infringement of STCA;
Fig. 15 shows vertical predicted tracks with error vectors and variances of STCA;
Fig. 16 shows optimal coarse proximity filter parameters for each probe of an example
of STCA;
Fig. 17 shows a minimum safe altitude specification of MSAW;
Fig. 18 shows region and minimum bounding box of MSAW;
Fig. 19 shows lateral predicted track and region of MSAW;
Fig. 20 shows probability of region penetration of MSAW;
Fig. 21 shows vertical predicted track and region of MSAW;
Fig. 22 shows vertical predicted track and protection region of APW.
[0037] In order to cope with different flight activities and conflict thresholds the safety
net, i.e. the method and system according to the present invention, preferably consider
different air space regions, representing volumes of air space. Each air space region
has a region type. Each region type is defined by or is represented by a different
set of trajectory prediction and conflict prediction/confirmation parameters.
[0038] In addition to the standard region types a new class of region types, called
manoeuvre region types is preferably introduced. As already discussed above, regions of these types are
centered at points in the vicinity of which aircraft are expected to perform a manoeuvre.
These points preferably correspond to VORDME (Very High Frequency Omnidirectional
Radio Range Distance Measuring Equipment) and NDB (Non Directional Beacon) way points.
Such manoeuvre regions are aimed at predicting aircraft manoeuvres. When an aircraft
enters a manoeuvre region, it is expected to perform a manoeuvre in the near future.
Therefore, a different set of trajectory prediction parameters is used and the uncertainty
of the trajectory prediction is automatically increased.
[0039] According to the above, region types preferably are divided into the two classes,
standard region types and
manoeuvre region types. Examples of standard region types are "Upper En-Route Control Areas" (upper CTA),
"Lower En-Route Control Areas" (lower CTA) or "Outer Terminal Air Spaces", "Terminal
Manoeuvre Areas" (TMA), "Control Zones" (CTA) and/or "Stacks" (holding areas).
[0040] Standard region types are preferably defined by a unique region type identifier,
a set of trajectory prediction parameters and/or a set of conflict prediction/confirmation
parameters.
[0041] Manoeuvre region types are preferably defined by a unique region type identifier,
a set of trajectory prediction parameters and/or a reference to a standard region
type, called base type. The manoeuvre region type inherits the conflict prediction/confirmation
parameters from its base type.
[0042] Each air space region is preferably defined by the
attributes: "unique region identifier", "unique region type identifier", "lateral geometry of
the region", "height band of the region", "region priority", "activity flag" and/or
"exclusion flag".
[0043] A region has preferably one of the following
lateral geometries. A region can have the lateral geometry of a simple closed polygon, defined as a list
of vertices. It is noted that standard geometrical algorithms are preferably used
to determine whether a point lies in a simple closed polygon. A region may further
have a lateral geometry of a distance radius circle, defined by a centre and a distance
radius. Further, a region can have the geometry of a time radius circle, defined by
a centre and a time radius. An aircraft is considered to belong to a time radius circle
if the condition

is fulfilled.
[0044] An aircraft is preferably considered to belong to a manoeuvre region whenever it
is expected to perform a manoeuvre in the vicinity of the centre of this region in
the maximum prediction time. Therefore, manoeuvre regions are preferably represented
by time radius circles and the time radius of the circle is preferably close or proportional
to the maximum prediction time.
[0045] The lower or upper heights of a region are preferably specified as altitudes and/or
as flight levels.
[0046] It is to be noted that regions can be included in or overlap other regions. Hence,
an aircraft can fall within more than one defined region. In this case, the region
with the highest priority is selected.
[0047] The activity flag of a region determines whether the region is active, i.e., if it
has to be considered by the safety net. The exclusion flag specifies whether the safety
net function is inhibited in the region. The activity and exclusion flags may preferably
be changed dynamically. Finally, regions may preferably be defined dynamically.
[0048] For receiving input, as discussed above, the safety net comprises a
safety net interface. Such interface of any safety net function preferably comprises the following data
structures, as is shown in Fig. 1. The input track data structure comprises all input
track information relevant to the safety net. A conflict data structure is a safety
net output containing all relevant conflict information and the parameters are configuration
parameters of the safety net system.
[0049] In more detail, the input track comprises data such as: track identification; mode
3/A code; call sign, if available from flight plan data; lateral position; mode C;
sea level mode C or aircraft altitude; lateral speed vector; lateral manoeuvre indication,
with direction and rate of turn; vertical manoeuvre indication, with direction and
rate of climb/decent; current time; cleared (assigned) flight level, if available;
and/or Reduced Vertical Separation Minimum (RVSM) compliance flag, if available from
flight plan data.
[0050] It should be noted that the sea level mode C or aircraft altitude are preferably
suitable for air space regions whose lower or upper height bands are defined as an
altitude. As a preferred embodiment the following relation between aircraft altitude,
aircraft mode C and sea level mode C is used:

[0051] The sea level mode C can be obtained from a QNH pressure value, assumed to be available
from elsewhere in the system.
[0052] In the following, the
data structures, modules, parameters and
main algorithm of the safety net, i.e. the method and system according to the present invention
is discussed in more detail. Further, data flow and state diagrams of the method and
the system are discussed.
[0053] The method and system, e.g. suitable for the STCA, MSAW, APW etc. preferably comprises
the following
data structures: an input track, which contains all input track information relevant to the safety
net; a trajectory, i.e., a 3D trajectory for one aircraft; a predicted track which
is preferably the extrapolation of an input track; a conflict, which is the safety
net output containing all relevant conflict information; the region type, which is
a set of safety net parameters that depend on the region type; and/or statistical
data, which are all data useful for statistical analysis of the system.
[0054] Further, a safety net function is preferably composed of one or more of the following
main modules: a region type identification, which identifies the region type of an input track
by determining the air space region containing the track; an input track filtering,
which eliminates input tracks which do not satisfy certain selection criteria; a trajectory
prediction, which generates predicted trajectories from input tracks; a trajectory
probing, which discretizes a prediction time frame into a finite number of time points
and generates a predict track on a given trajectory for each such time point; a conflict
prediction, which performs conflict prediction on predicted tracks and which is preferably
specific to each individual safety net; a conflict confirmation, which confirms conflicts
over several input track up dates; and/or an on-line statistical data collection which
collects online statistics and analyses the performance of the safety net system.
[0055] The configuration
parameters of the safety net according to the present invention preferably comprise: general
safety net parameters; communication parameters; input track filtering parameters;
trajectory probing parameters; conflict prediction parameters; region definition parameters;
and/or region type parameters.
[0056] The region type parameters preferably comprise all safety net parameters whose values
depend on the region type. These parameters comprise: trajectory prediction parameters;
conflict prediction parameters; and/or conflict confirmation parameters.
[0057] It is to be noted that one or more of the input track filtering and/or conflict prediction
parameters depend on the safety net concerned. The remaining parameters are common
to all safety nets and are specified later in the description.
[0058] Fig. 2 shows the generic data flow diagram representing the main modules of preferred
safety net functions and the corresponding data links as well as the configuration
parameters of the safety net.
[0059] As can be seen from Fig. 2 the input track filtering module receives input track
data containing all input track information relevant to the safety net and eliminates
input tracks which do not satisfy certain selection criteria based on input track
filtering parameters, then passing all relevant track information to the trajectory
prediction module. The region type identification module identifies the region type
of an input track by determining the air space region containing the track based on
the input track data and thus, identifies the region type data, i.e. the set of safety
net parameters that depend on the region type. The region type identification module
and identification process is further based on region definition parameters and region
type parameters, wherein the region type parameters contain all safety net parameters
whose values depend on the region type, as discussed above.
[0060] The trajectory prediction module generates predicted trajectories from input tracks
such as the output of the input track filtering module and the region type identification
module, i.e. input track data and region type data. The predicted trajectories of
the trajectory prediction module, i.e. the trajectory data, which is the 3D trajectory
for one aircraft, is communicated to the trajectory probing module which discretizes
the prediction time frame into a finite number of time points and generates a predicted
track on a given trajectory for each such time point, i.a. based on trajectory probing
parameters. The predicted track generated by the trajectory probing module is received
by the conflict prediction module which further receives region type data and conflict
prediction parameters and then performs conflict prediction on the predicted tracks.
The conflict prediction module and the conflict prediction are specific to each individual
safety net. The output of the conflict prediction module, i.e. the conflict data are
confirmed by the conflict confirmation module over several input track updates and
preferably the region type data. The output of the conflict confirmation module is
the conflict data as the safety net output containing all relevant conflict information.
[0061] During the above process the on-line statistical data collection module collects
on-line statistics and analyses the performance of the safety net system. Further
parameters received by the safety net are, e.g. general safety net parameters and/or
communication parameters.
[0062] The generic safety net
algorithm will now be described in more detail.
[0063] Preferably, the safety net function reads a preferably continuous stream of input
tracks, received from e.g. the radar tracking system, for example by means of a UDP
(User Datagram Protocol) communication medium. The safety net may be considered as
a cyclic algorithm that performs conflict prediction on a set of input tracks whose
time stamps differ by less then TAU, where TAU denotes the cycle time of the safety
net. Preferably, TAU is approximately 4 to 6 seconds. Whenever a new track T is received,
the algorithm starts by checking if the system is still in the current cycle, i.e.
it tests for the condition

where t denotes the time track of T and t
0 the time of the current cycle.
[0064] If a new cycle has been entered, the internal data structures of the safety net are
cleaned up. The set of conflicts SC is then confirmed with conflicts of the previous
cycles. Finally, t
0 is updated to t and SC is set to the empty set.
[0065] Then, in both cases, i.e. the case of current and new cycle, the type of air space
region containing T is identified. The input track filter checks whether T is a valid
track. If not, the algorithm drops T and waits for the next track. Otherwise, the
trajectory predictor generates a trajectory TR from T. The trajectory probing module
then produces a set of predicted tracks ST on the predicted trajectory TR. The conflict
prediction module subsequently generates conflicts involving the predicted tracks
in ST and inserts these conflicts in the set SC of conflicts of the current cycle.
It also stores the set ST in its internal data structures. Finally, statistical data
is collected.
[0066] In the initialisation phase of the algorithm, SC is set to the empty set and t can
be set to any valid time value.
[0067] The cycle time TAU is preferably determined by minimizing the time before confirming
and hence communicating a conflict, under the constraint that all pairs of tracks
are considered within one cycle. Therefore, TAU is equal to the time between two successive
updates of a given track.
[0068] Fig. 3 represents the generic safety net state diagram of safety net functions as
discussed above.
[0069] Regarding the input track filtering module, the input track filter eliminates all
input tracks which do not satisfy certain selection criteria, as already indicated
above. Preferably, an input track is eliminated if any of the conditions "it is in
no defined region" and/or "it is in an exclusion region" apply.
[0070] For an aircraft with temporary loss of mode C, height information is preferably obtained
by extrapolation of the last mode C readout. The extrapolated height is considered
invalid and the input track is eliminated if its last mode C readout was more than
a certain time MAX_T_LAST_ MODEC ago.
[0071] In the following, the
trajectory prediction will be discussed in more detail. By definition, trajectory prediction is an approximation
process which inevitably leads to positional errors. In order to account for these
errors, a stochastic model for trajectory prediction has been defined, in which the
uncertainty of the prediction is represented as a function of the prediction time.
Trajectory prediction comprises or can be decomposed into prediction in the lateral
plane and prediction on the vertical axis. Preferably, these two predictions are performed
separately.
[0072] For manoeuvring aircraft, the mean trajectory in the lateral plane is preferably
determined by means of a standard turn angle which preferably depends on the region
type. For non-manoeuvring aircraft, the mean trajectory is preferably obtained by
linear extrapolation of the current lateral speed vector.
[0073] The mean trajectory on the vertical axis is preferably determined by linear extrapolation
of the current vertical speed. When an intended or assigned flight level is available,
e.g. from controller input, flight plan data or some other source, and the aircraft
is climbing or descending, the stochastic model is modified to take into account the
clipping of the aircraft at the assigned flight level.
[0074] Preferably, the uncertainty of the prediction is modelled as a function of the prediction
time and the aircraft speed, and preferably further depends on the region type concerned
as well as on the aircraft attitude, i.e. whether the aircraft is manoeuvring or not.
[0075] In the rest of the document, it will be assumed for simplicity that the time of the
current cycle t
0 is equal to 0, so that the relative prediction time t-t
0 is the same as the absolute prediction time t. As already indicated above, a
trajectory is preferably composed of (1) a
lateral trajectory in the space (t, x, y) and (2) a
vertical trajectory in the space (t, z). Further, lateral and vertical trajectories are stochastic
functions defined by (1) a mean, i.e. most likely, trajectory and (2) an error variance.
[0076] The
error variance models the uncertainty of the prediction. A preferred error variance will be described
in detail below. Preferably e = e (v, t) denotes the lateral (resp. vertical) positional
error vector at prediction time t for a lateral (resp. vertical) speed v. The error
variance σ
2 is defined as the mean or expectation of the square Euclidian norm of e(v, t):

[0077] The square root σ of the error variance is called the
standard error.
[0078] In this model, it is assumed that ∥e(v, t)∥
2 can be written as :

where α is a constant and r is a normal random variable of mean 0, i.e., Er = 0.
The error variance can then be written as:

where a = α
2 and b = Er
2. The parameters a and b, respectively, are called the
slope and the
intercept of the error variance model. They are determined by minimizing the variance

where x = v
2 and y = ∥e∥
22 /dt
2 . It can be shown that a and b are given by:


where


[0079] The parameters a and b depend on the region type and/or the aircraft attitude, i.e.,
whether the aircraft is manoeuvring or not. Further below, a method for estimating
these parameters from the analysis of the real track data will be discussed.
[0080] In the following a preferred method for
prediction in the lateral plane will be discussed. In the lateral plane, at least two cases have to be taken into
consideration when determining the trajectory model. In the first case (1), the aircraft
is following a straight line whereas in the second case (2), the aircraft is manoeuvring.
[0081] When the aircraft follows a straight line, the mean lateral trajectory is preferably
obtained by linear extrapolation of the current lateral speed vector.
[0082] When the aircraft is manoeuvring, the mean lateral trajectory is preferably obtained
by generating a circular trajectory with a current lateral speed and turn rate of
the aircraft until the predicted end of the manoeuvre, followed by a tangent straight
line. For this prediction a crucial or difficult task is the estimation of how long
the aircraft will perform its manoeuvre. As a preferred solution, a standard angle
of turn, TURNANGLE, given as a region type parameter, is introduced. Further, preferably
the angle of turn already achieved by the aircraft is kept track. The remaining angle
of turn is thus determined as:

[0083] A preferred method for determining an optimal value of TURNANGLE for each region
type will be discussed later in the description.
[0084] In the stochastic model for trajectory prediction it is preferably assumed that the
distribution function of the lateral positional error vector e = (e
x, e
y) is a normal distribution with mean 0 which is independent of the direction of the
vector e. Such assumption has the advantage of providing a stochastic model for the
distance between the lateral positions of two aircraft which does not depend on the
direction of the relative lateral position of the aircraft. This assumption also justifies
the definition of the error variance σ
2, as given above. In the first case (1), i.e. the aircraft is following a straight
line, the parameters a and b of the error variance σ
2 are denoted as follows:


whereas in the second case (2), i.e. the aircraft is manoeuvring, these parameters
are denoted as follows:


[0085] Fig. 4 shows a mean lateral trajectory generated for a manoeuvring aircraft in the
(x, y) plane. It is composed of a circular arc followed by a tangent straight line.
The figure also represents the error variance σ
2 as a function of the prediction time t.
[0086] Now a preferred
prediction on the vertical axis will be described. On the vertical axis, at least three cases have to be taken into
consideration when determining the trajectory model, i.e., (3) the aircraft is levelled;
(4) the aircraft is climbing or descending and an assigned, i.e. intended, flight
level is available; and (5) the aircraft is climbing or descending and no assigned
flight level is available.
[0087] If the aircraft is levelled or no intended flight level is available, the mean vertical
trajectory is preferably determined by linear extrapolation of the current vertical
speed.
[0088] When a valid assigned flight level is available, e.g. from controller input, flight
plan data or some other source, and the aircraft is climbing or descending, the mean
vertical trajectory and the error variance σ
2, as defined above, need to be modified to take into account the clipping of the aircraft
at the assigned flight level.
[0089] It is assumed that the target will occupy the assigned level z
a within some tolerance interval [z
a - FL_TOL, z
a + FL_TOL]. The uncertainty interval [z
min, z
max] is preferably defined by


where z
0 is the current height, v
z0 is the current vertical speed, t is the prediction time and σ is the standard error,
as defined above. The uncertainty interval is thus "clipped" at the assigned level.
It is noted that the 3σ value corresponds to a 99.74 % probability that the real position
of the aircraft lies inside the interval [z
min, Z
max].
[0090] A new standard error σ* is preferably used to take into account the assigned level:

[0091] The predicted mean vertical position is given by

[0092] In the stochastic model for trajectory prediction it is assumed that the distribution
function of the vertical positional error is a normal distribution with mean 0 and
variance σ*
2.
[0093] In case of a temporary loss of mode C information, the prediction must preferably
be started at the time of the last mode C readout instead of the current time.
[0094] In case (3), i.e., the aircraft is levelled, the parameters a and b of the error
variance σ
2 are denoted as follows:


whereas in cases (4) and (5), i.e., if the aircraft is climbing or descending and
an assigned flight level is available or not, the parameters a and b of the error
variance σ
2 are denoted as follows:


[0095] Fig. 5 shows the mean vertical trajectory generated for a climbing aircraft with
an assigned flight level in the (t, z) plane, which comprises three line segments.
The newly introduced standard error σ* is considered as well as the tolerance interval
[z
a - FL_TOL, z
a + FL_TOL].
[0096] In the following, preferred
trajectory probing will be discussed in more detail. The basic idea of trajectory probing consists of
discretizing the prediction time frame into a finite number of equally spaced time
points, called probes. For each probe, the probing process generates a static traffic
picture ("a snapshot") represented by a set of predicted tracks.
[0097] This probing approach has, i.a., the important advantages that it provides a clear
separation between movement and conflict prediction, that it substantially reduces
the complexity of the conflict prediction module which can work with static traffic
pictures and does not have to deal with time-dependent 4D-trajectories, thus avoiding
complex equations of movement, that it provides a simple stochastic model at each
probing point and that it is very simple conceptually.
[0098] Preferably, a
predicted track is defined by: a track identification; a probe; a position vector; and/or a speed
vector (v
x, v
y, v
z). The position vector is a stochastic variable, preferably defined by: a mean position
vector (x, y, z) and/or an error variance vector (σ
xy2, σ
z2).
[0099] In order to characterize the proximity of a probe, at least three prediction time
frames will be defined. According to preferred prediction time frames a probe p is
in a
short term prediction time frame if

a
medium term prediction time frame if

and a
long term prediction time frame if

[0100] Preferred approximated values for these parameters are : SHORT_TERM = 30 seconds,
MEDIUM_TERM = 60 seconds, and/or LONG_TERM = 120 seconds.
[0101] The probing process generates a number, NBPROBES, of preferably equally spaced probes
in the interval [0, LONG_TERM]. For a given trajectory, the probing process determines,
for each probe p, the following predicted track:
mean position vector (x, y, z);
speed vector (vx, vy, vz); and/or
error variance vector (σxy2, σz2).
[0102] For the mean position vector (x, y, z) the vector (x, y) is the position on the mean
lateral trajectory at p and the height z is the position on the mean vertical trajectory
at p. Regarding the speed vector (v
x, v
y, v
z), the norm of the vector (v
x, v
y) is equal to the norm of the current lateral speed vector and its direction is parallel
to the mean lateral trajectory at p. Further, the rate vz is equal to the slope of
the mean vertical trajectory at p. For the error variance vector (σ
xy2, σ
z2), σ
xy2 is the error variance of the lateral trajectory at ((v
x2 + v
y2)
1/2, p) and σ
z2 is the error variance of the vertical trajectory at (v
z, p).
[0103] Figs. 6 and 7 exemplary show graphically the predicted tracks generated for NBPROPES
= 8 probes. In particular, Fig. 6 shows the lateral position in the (x, y) plane as
well as speed (v
x, v
y) and error variance (σ
xy2) of predicted tracks for probes 0 to 7. Fig. 7 shows the vertical position (z, t),
speed (v
z) and error variance (σ
z2) of predicted tracks for probes 0 to 7.
[0104] Preferably, a number of probes NB_PROBES should be large enough to neglect the discretization
error. On the other hand, making the number of probes too small deteriorates the system
performance. Therefore, a good trade-off has to be found between discretization error
and system performance.
[0105] Conflict prediction will now be discussed in detail. The at least one stochastic model of predicted track
or stochastic models of predicted tracks are used to construct a stochastic model
for conflict prediction. In the latter model, a probability of conflict is compared
to a minimum confidence level and allows to decide whether a given predicted situation
is a predicted conflict or not.
[0106] Preferably, p
confl is the probability of a conflict and p
min is a threshold probability value representing the minimum confidence level required
to predict a conflict. Preferably a conflict is predicted if and only if the relation

holds.
[0107] The trade-off between in-time conflict prediction and nuisance alert rate is a fundamental
property of a preferred safety net and safety net system.
[0108] In order to optimize this trade-off, a way of evaluating to what extent a predicted
conflict may be trusted is needed. Furthermore, for large prediction times, preferably
a high degree of certainty for predicting a conflict is required because there is
still enough time for avoiding manoeuvres and the number of nuisance alerts shall
be minimized. In contrast, when the prediction time is small, even if a conflict has
little chance to occur, it is desirable to predict it because there is not much time
left for an avoiding manoeuvre.
[0109] To summarize, an optimal trade-off between in-time conflict prediction and nuisance
alert rate can be achieved only if both of the following conditions are satisfied
by the safety net system:
The system is based on some form of conflict confidence estimation; and
The minimum confidence level required to predict a conflict depends on the prediction
time of the conflict.
[0110] In the preferred stochastic model, the minimum probability p
min is defined as a function of the urgency of the conflict, expressed by its prediction
time t. The function p
min(t) is independent of the uncertainty of trajectory prediction. Following the discussion
above, the function p
min(t) should be increasing with the prediction time t, as can be seen in Fig. 8.
[0111] The ability to specify, for each prediction time, the minimum confidence level required
to predict a conflict enables an optimal trade-off between in-time conflict prediction
and nuisance alert rate.
[0112] Preferably, lower and upper bounds of the minimum confidence level function p
min(t) are considered, defined respectively as follows:


where ε is a small positive number. The lower bound p
minL(t) achieves the highest warning times but features also the highest nuisance alert
rate. In contrast, the upper bound p
minU(t) achieves the lowest warning times but attains the lowest nuisance alert rate.
[0113] The choice of the function p
min(t) is preferably assisted by estimating both its warning time loss with respect to
the function p
minL(t) and its nuisance alert rate increase with respect to the function p
minU(t). Further in the specification, a statistical method will be presented which determines
these properties for each function p
min(t) and enables a convenient optimization of this function.
[0114] It is to be noted that, for ε = 0, p
minL(t) predicts a conflict for all pairs of aircraft with a warning time equal to the
maximum prediction time, while p
minU(t) predicts no conflict at all. Therefore, these lower and upper bounds are preferably
not used in the present analysis and may even be considered useless. Possible lower
and upper bounds are preferably defined by ε = 0.1.
[0115] In practice, p
min(t) is preferably defined as a piecewise constant function with three distinct values
for short, medium and long term prediction time frames, as can be seen in Fig. 9:

[0116] Preferred approximate values of the parameters defining p
min (t) are P_MIN_SHORT = 0.2, P_MIN_MEDIUM = 0.5 and/or P_MIN_LONG = 0.8. It should
be noted that these values depend on e.g. the region type.
[0117] In the following paragraphs, the stochastic model is compared with a deterministic
model, which does not use any uncertainty information for trajectory prediction. Such
a model can be obtained by setting the error variance of trajectory prediction to
zero in the stochastic model as discussed above.
[0118] As already mentioned, in the stochastic model, the trade-off between in-time conflict
prediction and nuisance alert rate can be conveniently optimized by adjusting the
minimum confidence level function p
min(t).
[0119] In contrast, the deterministic model is unable to estimate to what extent a predicted
conflict may be trusted, because it does not use any uncertainty information for trajectory
prediction. In particular, the deterministic model does not take into account the
predicted penetration depth of the safety cylinder centered at each aircraft. Therefore,
contrary to the stochastic model, it does not distinguish between marginal and clear
predicted conflicts, depending on the uncertainty of the predicted position of an
aircraft inside another aircraft's safety cylinder. Note that systems based on such
a deterministic model typically address this problem by introducing complex heuristics,
which consider the region type, trajectory type, aircraft speed, penetration depth
of the safety cylinder, etc. However, the validation and optimization of these heuristics
are difficult tasks in general. As a consequence, an optimal trade-off between in-time
conflict prediction and nuisance alert rate is not as easy to achieve as in the stochastic
model.
[0120] Studying the link between the minimum confidence level p
min and the relative number of predicted conflicts in the stochastic and deterministic
models it can be shown that if a conflict is predicted by the deterministic model,
then it is also predicted by the stochastic model with p
min ≤ 0.25, provided that the error variance of trajectory prediction (as discussed above)
is not too large. In other words, the deterministic model predicts less conflicts
than the stochastic model; further, if a conflict is predicted by the stochastic model
with p
min ≥ 0.5, then it is also predicted by the deterministic model. In other words, the
deterministic model predicts more conflicts than the stochastic model.
[0121] For
conflict confirmation a conflict confirmation mechanism is introduced in order to take into account erroneous
track data or transient track values. Preferably a confirmation window records the
conflicts of the last WINSIZE cycles. At the end of one safety net cycle, the confirmation
windows are updated with the conflicts predicted during this cycle. If a conflict
was predicted at least c times in the last WINSIZE cycles, the conflict is confirmed
and communicated, preferably displayed, to the user/controller. The parameter c depends
on at least the prediction time frame, as described above, and/or the region type
of the aircraft involved in the conflict. For the short term prediction time frame,
the parameter c is denoted as c = MIN_NBCONFL_SHORT, for the medium term prediction
time frame it is denoted as c = MIN_NBCONFL_MEDIUM and for the long term prediction
time frame it is denoted as c = MIN_NBCONFL_LONG. Preferred approximate values of
these parameters are WINSIZE = 5, MIN_NBCONFL_SHORT = 1, MIN_NBCONFL_MEDIUM = 2 and/or
MIN_NBCONFL_LONG = 3.
[0122] As argued above, a higher number of conflict predictions is required for confirming
a conflict for large prediction times, since there is still enough time for avoiding
manoeuvres and it is intended to minimize the number of nuisance alerts. In contrast,
it is desirable to confirm a conflict rapidly when the prediction time is small since
there is not much time left for an avoiding manoeuvre.
[0123] Now a preferred method for determining
optimal turn angles is given. As discussed above, a standard angle of turn TURNANGLE is used to predict
lateral manoeuvre trajectories. Now, a preferred method for determining an optimal
standard turn angle for each region type is presented. The preferred method is based
on the minimization of an objective error function and on observed manoeuvres from
real track data.
[0124] For the prediction error minimization the following random variables will be introduced:
the total angle of turn α of the manoeuvre; the lateral speed v of the aircraft (preferably
assumed to be constant during the manoeuvre); the rate of turn ω of the aircraft (preferably
assumed to be constant during the manoeuvre); and/or the radial acceleration a
r = vω of the aircraft.
[0125] Preferably, two manoeuvre trajectories, respectively, generated with angles α and
α*, where α* is a constant, are considered for an aircraft with radial acceleration
a
r. The mean distance between these trajectories is proportional to the prediction error
e, defined as

[0126] For each region type, a standard angle of turn α* which minimizes the mean square
of the prediction error e is determined, i.e., the function

[0127] The function f(α*) is preferably minimized for

[0128] In practice, the optimal angle of turn α* is preferably approximated for each region
type from real track data. In the formula defining α*, the expectations are preferably
approximated by the following formulae:


where α
i and a
r,i, respectively, are the total turn angle and radial acceleration for manoeuvre i (0
≤ i ≤ n) observed from real track data.
[0129] In the above description a preferred model for the error variance σ
2 of trajectory prediction has been discussed. Now, the preferred method is presented
that approximates the parameters a and b from the analysis of real track data. The
basic idea of the preferred method consists of comparing, for each track update, the
predicted trajectory of the track, as discussed above, with its real trajectory, and
inserting the resulting mean value of y in a linear regression with respect to x.
[0130] Distinct values of the parameters a and b are preferably calculated in the lateral
plane and on the vertical axis for each defined region type and aircraft attitude,
i.e., whether the aircraft is manoeuvring or not.
[0131] Considering a track update i and assuming that a set of real track updates for a
given aircraft is given, the
calculation of error variance parameters is as follows. For each track update in the time frame [0, LONG_TERM] starting at
update i, the positional error ∥e∥
2 is computed by comparison with the predicted trajectory generated for update i. y;
is now defined as the corresponding mean value of ∥e∥
22/dt
2 and x
i is defined as the square speed v
2 of track update i.
[0132] In the lateral plane and on the vertical axis, a linear regression between x and
y with the set S of pairs (x
i,y
i) generated for track updates of aircraft within a given region type and within a
given attitude is constructed for each region type and aircraft attitude (manoeuvring
or not). A linear regression between x and y is defined by the affine function

where m denotes the slope and p the intercept of the linear regression. n is defined
as the number of elements in S. The parameters m and p are defined as follows:


where




[0133] It should be observed that the parameters m and p, respectively, are approximations
of the parameters a and b:


[0134] The following Tables 1 to 9 present preferred specification of the safety net parameters
as well as approximate preferred values of the parameters which are preferably common
to all safety nets. Table 1 shows general safety net parameters; Table 2 shows the
specification of communication parameters; Table 3 shows the specification of input
track filtering parameters; Table 4 shows the specification of trajectory probing
parameters; Table 5 shows the specification of region definition parameters; and Table
6-9 show region type parameters wherein Table 6 shows the specification of general
region type parameters; Table 7 shows the specification of trajectory prediction parameters;
Table 8 shows the specification of conflict prediction parameters; and Table 9 shows
the specification of conflict confirmation parameters.
Table 1:
Specification of General Safety Net Parameters |
Parameter |
Description |
Example |
TAU |
Safety net cycle time |
4 sec |
REFLAT |
Latitude of system reference point |
46:00:00 N |
REFLON |
Longitude of system reference point |
14:30:00 N |
REFALT |
Altitude of system reference point |
360 m |
Table 2:
Specification of Communication Parameters |
Parameter |
Description |
Example |
INPORT |
UDP port number for input tracks |
1050 |
OUTPORT |
UDP port number for conflicts |
1060 |
Table 3:
Specification of Input Track Filtering Parameters |
Parameter |
Description |
Example |
MAX_T_LAST_MODEC |
Maximum elapsed time since last modeC readout before discarding the track |
60 sec |
Table 4:
Specification of Trajectory Probing Parameters |
Parameter |
Description |
Example |
NBPROBES |
Number of probes |
13 |
SHORT_TERM |
Short term prediction time frame |
30 sec |
MEDIUM_TERM |
Medium term prediction time frame |
60 sec |
LONG_TERM |
Long term prediction time frame |
120 sec |
Table 5:
Specification of Region Definition Parameters |
Parameter |
Description |
Example |
REGIONID |
Region identification |
0 |
TYPEID |
Region type identification |
0 |
GEOMID |
Region geometry identification (polygon, circle) |
Polygon |
VERTEX_LAT |
Latitude of polygon vertex |
46:00:00 N |
VERTEX_LON |
Longitude of polygon vertex |
15:00:00 E |
CIRCLE_LAT |
Latitude of circle centre |
46:00:00 N |
CIRCLE_LON |
Longitude of circle centre |
15:00:00 E |
RADIUS |
Circle Radius |
10 NM or 120 sec |
RADIUS_TYPE |
Type of circle radius (distance radius, time radius) |
Distance radius |
ZMIN |
Lower bound of region height band |
25 Fl |
ZMIN_TYPE |
Type of ZMIN (altitude or flight level) |
Altitude |
ZMAX |
Upper bound of region height band |
175 Fl |
ZMAX_TYPE |
Type of ZMAX (altitude or flight level) |
Flight level |
PRIORITY |
Region Priority |
50 |
ACTIVE |
Activity flag |
TRUE |
Table 6:
Specification of General Region Type Parameters |
Parameter |
Description. |
Example |
TYPEID |
Region Type Identification |
0 |
CLASS |
Class of Region Type (standard, manoeuvre) |
Standard |
BASE_TYPEID |
Base type identification for manoeuvre region type |
0 |
Table 7:
Specification of Trajectory Prediction Parameters Depending on Region Type |
Parameter |
Description |
Example |
TURNANGLE |
Standard turn angle of the region type |
1.32 rad |
FL_TOL |
Tolerance on cleared flight levels |
1 Fl |
LS_SLOPE |
Slope of error variance model for straight line lateral trajectory |
0.023 |
LS_INTERCEPT |
Intercept of error variance model for straight line lateral trajectory |
0.00020 |
LM_SLOPE |
Slope of error variance model for manoeuvre lateral trajectory |
0.86 |
LM_INTERCEPT |
Intercept of error variance model for manoeuvre lateral trajectory |
-0.000041 |
VL_SLOPE |
Slope of error variance model for levelled vertical trajectory |
0.033 |
VL_INTERCEPT |
Intercept of error variance model for levelled vertical trajectory |
0.012 |
VM_SLOPE |
Slope of error variance model for manoeuvre vertical trajectory |
0.28 |
VM_INTERCEPT |
Intercept of error variance model for manoeuvre vertical trajectory |
-0.015 |
Table 8:
Specification of Conflict Prediction Parameters Depending on Region Type |
Parameter |
Description |
Example |
P_MIN_SHORT |
Threshold probability value for short term prediction time frame |
0.2 |
P_MIN_MEDIUM |
Threshold probability value for medium term prediction time frame |
0.5 |
P_MIN_LONG |
Threshold probability value for long term prediction time frame |
0.8 |
Table 9:
Specification of Conflict Confirmation Parameters Depending on Region Type |
Parameter |
Description |
Example |
WINSIZE |
Size of conflict confirmation window |
5 |
MIN_NBCONFL_SHORT |
Minimum number of conflict predictions in the last WINSIZE cycles for confirming short
term conflict |
1 |
MIN NBCONFL_MEDIUM |
Minimum number of conflict predictions in the last WINSIZE cycles for confirming medium
term conflict |
2 |
MIN_NBCONFL_LONG |
Minimum number of conflict predictions in the last WINSIZE cycles for confirming long
term conflict |
3 |
[0135] Below, warning time and nuisance alert rate will be analysed. In particular, a preferred
method for analyzing the warning time and nuisance alert rate of the stochastic model
according to the present invention is discussed. As described above, the stochastic
model preferably is parameterized by the minimum confidence level function p
min(t). This function defines a certain trade-off between in-time conflict prediction
and nuisance alert rate. The proposed method preferably serves as an assisting tool
for the optimization of the function p
min(t) and hence of the latter trade-off.
[0136] First, a nuisance alert is formalized by the notion of alert desirability. Then,
the warning time and desirability losses of the function p
min(t), respectively, are estimated with regard to lower and upper bounds of p
min(t). Finally, a numerical example based on the STCA safety net are presented.
[0137] Regarding alert desirability, a straightforward formalization of nuisance alerts
would be a binary definition in which an alert is considered as a nuisance if and
only if the corresponding predicted conflict does not turn into a real conflict. However,
such a definition suffers from a major drawback, i.e., it does not account for highly
wanted alerts in which late manoeuvres prevent a predicted conflict to turn into a
real conflict.
[0138] Therefore, instead of classifying alerts into wanted and nuisance alerts, the idea
is to introduce the notion of desirability of an alert, which is defined as

[0139] In this model, there are no wanted or nuisance alerts but more or less desirable
alerts, depending on their minimum prediction time. The smaller the minimum prediction
time, the higher the desirability. In preferred embodiments, more sophisticated models
are defined by taking also into account the properties of the conflict (e.g. geometry,
severity of safety criteria violation, etc.) in the estimation of the alert desirability.
[0140] Preferably, lower and upper bounds of the minimum confidence level function p
min(t) are considered, defined respectively as follows:


where ε is a small positive number. The lower bound p
minL(t) achieves the highest warning times but features also the lowest desirability
values. In contrast, the upper bound p
minU(t) achieves the lowest warning times but attains the highest desirability values.
[0141] It is to be noted that, for ε = 0, p
minL(t) predicts a conflict for all pairs of aircraft with a warning time equal to the
maximum prediction time, while p
minU(t) predicts no conflict at all. Therefore, these lower and upper bounds are preferably
not used in the present analysis and may even be considered useless. Possible lower
and upper bounds are preferably defined by ε = 0.1.
[0142] The choice of the function p
min(t) is preferably assisted by estimating both its warning time loss with respect to
the function p
minL(t) and its desirability loss with respect to the function p
minU(t). Now the warning time and desirability losses will be formally defined.
[0143] Regarding the warning time loss, preferably a set S of n conflicts is considered
which have been generated both by the function p
min(t) and a lower bound p
minL(t). Let w
i and w
iL be respectively the warning times of conflict i in S generated by p
min(t) and p
minL(t), where it is assumed that w
iL > 0. It is to be noted that w
i ≤ w
iL always holds. The relative warning time difference for conflict i is defined as:

[0144] The warning time loss of p
min(t) with respect to p
minL(t) in set S is preferably defined as the square root of the mean square of the relative
warning time differences:

[0145] It is to be noted that an important advantage of this definition over a simple mean
of the r
i's is that it accounts for the distribution of the r
i's. Let r
tol be a tolerance imposed on the relative warning time difference. If the relation

holds, the distribution of the relative warning time difference is more likely to
be closer to 0 than the constant distribution with value r
tol. Therefore, this relation can be used as an acceptance test of the function p
min(t).
[0146] Regarding the desirability loss, preferably a set S of n conflicts is considered
which have been generated by the function p
min(t) but not by an upper bound p
minU(t). Let d
i be the alert desirability of conflict i in S.
[0147] The desirability loss of p
min(t) with respect to p
minU(t) in set S is preferably defined as the square root of the mean square of the desirability
values:

[0148] As for the warning time loss, a tolerance d
tol on the desirability may be imposed and the relation

may be used as an acceptance test of the function p
min (t).
[0149] The following example is taken from the STCA safety net and considers two region
types : a Terminal Manoeuvre Area (TMA) and an Upper Airspace (UA). Table 10 shows
the warning time and desirability losses for both region types and for 6 different
functions p
min(t). In the table, examples 1 and 6 correspond respectively to p
minL(t) and p
minU(t) (i.e., ε = 0.1).
Table 10:
Warning Time and Desirability Losses for Different Functions pmin(t) |
|
pmin(t) |
Warning Time Loss ew in % |
Desirability Loss ed in sec |
No |
P_MIN_SHORT, P_MIN_MEDIUM, P_MIN_LONG |
TMA |
UA |
TMA |
UA |
1 |
0.1,0.1,0.1 |
0 |
0 |
64 |
76 |
2 |
0.9,0.5,0.1 |
31 |
20 |
80 |
86 |
3 |
0.1,0.2,0.3 |
35 |
21 |
35 |
70 |
4 |
0.1,0.5,0.5 |
48 |
35 |
23 |
54 |
5 |
0.1,0.5,0.9 |
49 |
45 |
23 |
25 |
6 |
0.9, 0.9, 0.9 |
89 |
65 |
0 |
0 |
[0150] As can be observed from table 10, higher values of p
min(t) correspond to a higher warning time loss but to a smaller desirability loss. Example
2 shows a decreasing function p
min(t). It features a higher warning time loss and slightly higher desirability loss
than example 1. Furthermore, example 2 has nearly the same warning time loss but a
much higher desirability loss (especially for TMA) than example 3. Therefore, examples
1 and 3 are preferred to example 2. In general, decreasing functions p
min(t) are preferably avoided, as already argued above. It can also be observed that
the warning time and desirability losses are similar for TMA and UA in example 5,
while they differ significantly in example 3. This can be explained by a higher uncertainty
of trajectory prediction in TMA than in UA. Finally, it can be observed that examples
4 and 5 yield similar warning time and desirability losses for TMA but quite different
losses for UA. Again, this is due to a higher uncertainty of trajectory prediction
in TMA than in UA.
[0151] The above description is given with regard to a common frame work for safety nets
and is basically applicable to all safety nets, i.e., for Short Term Conflict Alert
(STCA), Minimum Safe Altitude Warning (MSAW); and Area Proximity Warning (APW). In
the following, preferred examples of the present invention will be given with regard
to specific features of certain safety nets such as the Short Term Conflict Alert,
the Minimum Safe Altitude Warning and the Area Proximity Warning function.
[0152] In the following, as a preferred example, solely the aspects which are specific to
the
Short Term Conflict Alert (STCA) safety net system and method will be described wherein further features which are
not discussed in detail correspond to those as discussed in the above description
with regard to general or generic properties.
[0153] A Short Term Conflict Alert (STCA) system is a safety net aimed at detecting traffic
situations that might lead to a violation of defined separation criteria between at
least two aircraft in a near future and warning the radar controller of this potential
danger.
[0154] In the context of the STCA safety net, the notion of a conflict as defined above
will preferably correspond to a simultaneous infringement of defined lateral and vertical
separation minima between two aircraft. Preferably a conflict is further characterized
by (1) its nature, (2) its severity and/or (3) its uncertainty.
[0155] The nature of a conflict is expressed in terms of properties of the conflict. The
latter include different types of separation infringements and geometrical properties
such as the so called
crossing and
divergence properties of a pair of aircraft.
[0156] The severity of a conflict depends on its nature and is preferably determined by
combining the various properties of the conflict. In order to express the severity
of a conflict, distinct conflict categories will be defined.
[0157] The uncertainty of a conflict is based on the uncertainty of trajectory prediction,
in which errors are unavoidable, as already discussed above. This uncertainty is represented
by a stochastic model for minimum separation infringement.
[0158] The conflict characterisation provides the radar controller with detailed information
about a conflict situation, which enables him to analyse the situation more precisely
and rapidly, before making a decision and possibly formulating an avoiding manoeuvre
in order to eliminate the conflict.
[0159] The conflict characterisation further helps making more precise and detailed off-line
analysis of conflict situations. The latter analysis may in turn be used, e.g., for
tuning the STCA system.
[0160] In the context of STCA, the generic conflict prediction module, as defined above,
comprises two main modules, i.e., a
conflict category prediction module and a
coarse pair filtering module. The conflict category prediction module predicts the conflict category of
predicted pairs, i.e., pairs of predicted tracks, and generates conflicts. The coarse
pair filtering module generates predicted pairs by restricting the set of predicted
tracks that need to be compared to a given predicted track in the conflict category
prediction algorithm.
[0161] Regarding
conflict nature, this is represented by a set of properties of the conflict. The latter preferably
include properties of the geometrical situation of the conflict, such as the crossing
and divergence properties of a pair of aircraft and/or different types of separation
infringements, expressing the severity of separation loss.
[0162] It has to be noted that the nature of a conflict may be generalized by the introduction
of additional properties of the conflict.
[0163] The crossing and divergence tests are applied to a pair of aircraft. Roughly speaking,
the crossing and divergence properties represent some safety conditions about the
local geometry of a conflict situation. These properties are based on current or predicted
track positions and speed vectors and/or on the assumption that the speed vectors
remain constant. The divergence property is considered to represent the evolution
of the lateral and vertical separations of the aircraft in the near future whereas
the crossing property is considered to describe the geometry of both linearly extrapolated
lateral trajectories, and allows us to distinguish between nearly parallel, converging
or diverging trajectories. In this context it should be noted that a diverging pair
is not the same as a diverging trajectory.
[0164] In a preferred formal definition of these concepts, the cross-over point is defined
as the point in the (x, y) plane that both aircraft will pass through, usually at
different times, assuming their current or predicted track headings are continued.
The cross-over point will already have been reached for aircraft on diverging headings
and does not exist for aircraft on parallel headings. The cross-over time is defined
as the time at which the first aircraft in the pair is predicted to reach the cross-over
point. The cross-over time is set to have occurred and the pair is considered as crossed
if any of the following conditions are satisfied:
The cross-over point has already been reached or does not exist;
The cross-over time is more than MIN_CROSS_TIME ahead; and/or
The difference in times for the two aircraft to reach the cross-over point is more
than MIN_DIV_CROSS_TIME.
[0165] The pair of aircraft is considered to be diverging if any of the following conditions
are satisfied:
Their lateral closing speed is smaller than MAX_LAT_VCLOS;
Their predicted minimum lateral distance assuming constant lateral speed vectors is
greater than MIN_LAT_DIST; and/or
Their vertical closing speed is smaller than MAX_VERT_VCLOS.
[0166] It is to be noted that the second of the above divergence conditions is introduced
in order to account for the rapidly changing lateral closing speed in the vicinity
of the time of minimum lateral distance.
[0167] It is also to be noted that the parameters involved in the latter definitions preferably
depend on the region type concerned.
[0168] Due to the limitations of the radar equipment being used, which include a number
of time delays and other technical limitations, the traffic picture as understood
by the controller can differ considerably from reality at any given time. Separation
standards are designed to take account of these limitations and ensure that a collision
between aircraft is almost inconceivable when the separation minima are not infringed.
See also "Radar Control - Collision Avoidance Concepts"; 1st Edition; Civil Aviation
Authority (CAA); 18 January 2002; Document Number: CAP717.
[0169] Obviously, the risk of collision when separation minima are infringed depends on
the geometry of the conflict, expressed e.g. by the crossing and divergence properties
defined above. For example, in the case of a pair of non crossed and non diverging
aircraft, the safety margins can be eroded significantly in a very short time. Therefore,
the risk of collision in this case is much higher than e.g. for a pair of crossed
and diverging aircraft.
[0170] In order to account for the geometry of the conflict, two types of separation infringements
for a pair of aircraft are defined, representing two different severity levels of
separation loss.
[0171] A major separation infringement that occurs when

[0172] A minor separation infringement occurs when

[0173] It has to be noted that the relation

is always valid. Preferably, the separation thresholds depend on the region type
concerned. Preferred approximate values are DL_MAJOR = 3 NM, DL_MINOR = 5 NM and/or
DV_MIN = 800 feet.
[0174] Regarding
conflict severity, the severity of a conflict preferably depends on its nature and is determined by
combining the various properties of the conflict. In order to express the severity
of a conflict, at least four distinct conflict categories will be defined by combining
the two types of separation infringements with the crossing and divergence properties.
[0175] The conflict categories are defined in Table 11 below:
Table 11:
Conflict Categories of STCA |
Category |
Condition |
1 |
major separation infringement and not (crossed and diverging) |
2 |
(major separation infringement and (crossed and diverging)) or (minor separation infringement and not (crossed and diverging)) |
3 |
Minor separation infringement and (crossed and diverging) |
4 |
not (major or minor separation infringement) |
[0176] In this categorisation, conflicts of category 1 and 2 correspond to wanted alerts,
while conflicts of category 3 and 4 correspond to nuisance alerts.
[0177] In this context it should be noted that the number of conflict categories may be
extended by identifying and combining additional properties of a conflict.
[0178] Regarding
conflict uncertainty, the uncertainty of a conflict is based on the uncertainty of trajectory prediction
and is preferably represented by a stochastic model for minimum separation infringement.
In the latter model, probabilities of major and minor separation infringements are
estimated.
[0179] In case aircraft in a pair belong to different region types, a combined region type
needs to be determined. This is preferably achieved, e.g., by means of a decision
matrix. Some region types are preferably defined as combined. Such region types contain
only pairs, not single aircraft.
[0180] Regarding STCA regions, a Reduced Vertical Separation Minimum (RVSM) region is an
upper airspace region in which the minimum vertical separation has been reduced from
2000 ft to 1000 ft, provided that both aircraft in the pair are RVSM-compliant. Preferably,
furthermore, depending on weather conditions, the 1000 ft minimum is raised to 2000
ft, e.g. for safety reasons. Preferably, in addition to the general region attributes
defined above, each STCA region is defined by a flag identifying it as RVSM or not.
Preferably, for each RVSM region R
1 with region type RT
1, an associated non-RVSM region R
2 with region type RT
2 is defined. Regions R
1 and R
2 have the same geometry and R
1 has higher priority than R
2. If an aircraft is RVSM-compliant and R
1 is active, it will fall in R
1, otherwise in R
2. Region types RT
1 and RT
2 differ only by the value of the minimum separation DV_MIN and their combined region
type is RT
2.
[0181] As a consequence, if a pair has at least one non RVSM-compliant aircraft or if the
region R
1 is deactivated due to bad weather conditions, the more severe DV_MIN of RT
2 is used. Otherwise, the less severe DV_MIN of RT
1 is used.
[0182] The
mode 3/
A code selection specifies which codes have to be protected by the STCA function. At least
three modes of operation, identified by the parameter MODE, are preferred:
No selected codes are required in the pair of aircraft;
at least one of the aircraft in the pair must have a selected code; and/or
both aircraft in the pair must have a selected code.
[0183] With regard to the STCA interface (Fig. 1), the information preferably required in
an input track has already been specified above. A conflict preferably contains at
least one or all of the following information, restricted to the prediction time frame:
unique conflict identification (contiguous conflicts for a given pair of aircraft
have the same conflict identification); duration of conflict identification; STCA
system identification (sic, sac); current time; time to conflict; lateral and vertical
starting positions of a conflict; current lateral and vertical separations; predicted
minimum lateral and vertical separations; a conflict nature; predicted conflict category;
probabilities of major and minor separation infringements; and/or information of both
aircraft involved in the conflict.
[0184] The nature of the conflict preferably comprises predicted crossing and divergence
flags at starting time of conflict and/or predicted major and minor separation infringement
flags.
[0185] The information about each aircraft preferably comprises: track identification; mode
3/A code; call sign, if available from input track; and/or track server identification
(sic, sac).
[0186] The configuration parameters of the STCA system which are common to all safety nets
have already been specified above. Preferred parameters specific to STCA are specified
later in the description.
[0187] In the context of STCA, the generic conflict prediction module as defined above is
instantiated as follows.
[0188] The STCA conflict prediction module preferably comprises the data structures: predicted
track, i.e., extrapolation of an input track; predicted pair, i.e., a pair of predicted
tracks; conflict, i.e., output of STCA containing all relevant conflict information;
and/or region type including the set of conflict prediction parameters that depend
on the region type.
[0189] The STCA conflict prediction module preferably comprises the
conflict category prediction module that predicts the conflict category of predicted pairs and generates conflicts
and/or a
coarse pair filtering module that generates predicted pairs by restricting the set of predicted tracks
that need to be compared to a given predicted track in the conflict category prediction
algorithm. Preferably, the conflict prediction module comprises two main modules.
[0190] In addition to the conflict prediction parameters depending on the region type, the
conflict prediction module preferably includes coarse pair filtering in conflict category
prediction parameters. All preferred approximate parameters specific to STCA are specified
below.
[0191] Fig. 10 shows the data flow diagram of the conflict prediction module and the corresponding
data links of STCA, as discussed above.
[0192] In the following passages the
coarse pair filtering will be described in more detail. The coarse pair filter generates predicted pairs
by restricting the set of predicted tracks that need to be compared to a given predicted
track in the conflict category prediction algorithm. The coarse pair filter preferably
comprises the following sub-filters: the coarse proximity filter; the mode 3/A code
selection filter; and/or the split tracks filter. Preferably, the coarse pair filter
comprises three sub-filters. The coarse proximity filter generates a set of predicted
pairs from predicted tracks. The mode 3/A code selection and split tracks filters
then eliminate pairs in this set which do not satisfy certain criteria. A predicted
pair is considered to be a pair of predicted tracks generated for the same probe.
[0193] The coarse proximity filter identifies the set of predicted tracks that are in a
neighbourhood of a given predicted track. The basic idea underlying the coarse proximity
filter comprises partitioning the (x, y) plane into square cells. Preferably, for
each probe, a separate grid of cells is defined. The predicted tracks generated during
one STCA cycle are inserted into their corresponding grid. Preferably, two predicted
tracks generated for probe p are called neighbours if both following conditions are
satisfied: the tracks are in the same or an adjacent cell of grid p and their vertical
separation is less than DZ_MAX.
[0194] The coarse proximity filter preferably generates predicted pairs of neighbours. At
the end of a cycle, the grids are emptied. This ensures that only pairs of predicted
tracks of the same cycle are generated.
[0195] Fig. 11 exemplarily shows a grid for a given probe, as well as two neighbours in
adjacent cells in the (x, y) plane.
[0196] Whenever a new predicted track for probe p is received, the filter generates predicted
pairs involving the track and its neighbours. The track is subsequently inserted in
the corresponding cell of grid p. This sequential insertion mechanism of tracks into
cells ensures that each predicted pair is generated only once (sequential filtering).
[0197] Preferably the size EDGE of the cells and the maximum vertical distance DZ_MAX are
chosen large enough to include all predicted pairs of potential concern. However,
choosing these parameters too large implies that an excessive number of pairs are
processed by the conflict category prediction algorithm and the system performance
is degraded. It has to be noted that the optimal values of EDGE and DZ_MAX may vary
with the probe. Later in the description a preferred method for determining optimal
values of these parameters for each probe will be presented.
[0198] The mode 3/A code selection filter eliminates all pairs in which one or both tracks
do not have a selected code, depending on the mode of operation MODE.
[0199] Regarding
split tracks filter, multi-radar tracking can produce duplicate system tracks for the same airframe, known
as split tracks. Such split tracks arise from the garbling effect in the detected
mode 3/A codes. Different radars may detect mode 3/A codes that differ by a few bits
although they actually correspond to the same aircraft. Thus, it is an important feature
to detect split tracks and eliminate pairs of such tracks in order to avoid the declaration
of nuisance alerts.
[0201] Preferably, a confirmation mechanism is added to the split conditions in order to
take into account spurious track effects. A confirmation window records the result
of the split conditions test of the last WINSIZE cycles. Two input tracks are considered
as split and all corresponding predicted pairs are eliminated by the filter if and
only if the pair of input tracks met the split conditions at least once in the last
WINSIZE cycles.
[0202] During one STCA cycle, the pairs of input tracks meeting the split conditions are
collected in a split pairs set. At the end of the cycle, the confirmation windows
are updated with the split pairs set and the latter is emptied.
[0203] At the end of each STCA cycle, the grids of the coarse proximity filter are emptied,
and/or the confirmation windows of the split filter are updated with the split pairs
set and the latter is emptied (coarse filter clean up).
[0204] In the following, the
conflict category prediction will be described in more detail. The basic idea of the conflict category prediction
algorithm consists of predicting the conflict category of a predicted pair. All pairs
whose predicted category is larger than a specified minimum category are eliminated.
Finally, conflicts are built from the remaining pairs.
[0205] With regard to Table 11, the conflict category of a pair is predicted by predicting
a major or minor separation infringement for the pair and/or applying the crossing
and divergence tests to the mean positions and speed vectors of the predicted tracks
in the pair (as has been discussed in detail above).
[0206] A stochastic model for minimum separation infringement has been developed from the
mean positions and error variance vectors of the predicted tracks in a pair in order
to predict separation infringements. In this model, probabilities of major and minor
separation infringements are compared to a given threshold. Preferably, the stochastic
model is decomposed to lateral and vertical models.
[0207] Regarding a preferred lateral stochastic model, a pair of predicted tracks T
1 and T
2 is considered to be generated for probe p. It is now an object to estimate the probability
of a lateral separation infringement between T
1 and T
2. The first task consists of determining the two-dimensional stochastic model of the
combined lateral positional error of the pair (T
1, T
2). The probability of lateral separation infringement is then approximated by a one-dimensional
stochastic model.
[0208] For determining the combined lateral error variance, e
1= (e
1x, e
1y) and e
2 = (e
2x, e
2y), respectively, are the lateral positional error vectors of T
1 and T
2. Further, σ
12 = E∥e
1∥
22 and σ
22 = E∥e
2∥
22 denote their respective lateral error variances. Fig. 12 shows lateral predicted
tracks with error vectors and variances in the (x, y) plane.
[0209] The combined error vector is preferably given by

[0210] By the assumptions made for the distribution functions of e
1 and e
2, the distribution function of e is a normal distribution with mean 0 which is independent
of the direction of the vector e. The combined lateral error variance σ
2 = E∥e∥
22 is given by

[0211] From the assumption that the error vectors e
1 and e
2 are independent, the following relations hold


[0212] The combined lateral error variance thus becomes

[0213] Regarding the probability of lateral separation infringement, d denotes the distance
between the mean lateral positions of T
1 and T
2, e the combined positional error vector, σ
2 the combined lateral error variance and d
min the minimum distance below which a lateral separation infringement occurs. Such combined
positional error and separation infringement is shown in Fig. 13.
[0214] The probability of lateral separation infringement is the probability that the vector
d + e lies inside the circle centred at 0 and of radius d
min. The exact determination of this probability is a complex-dimensional problem. Therefore,
it is approximated by the probability that the normal random variable u of mean d
and variance σ
2 lies in the interval [-d
min, d
min], as is shown in Fig. 14. It is given by

where u* is the standard normal random variable of mean 0 and variance 1. This probability
is preferably obtained by a standard normal distribution table look-up.
[0215] Regarding the vertical stochastic model, a pair of predicted tracks T
1, T
2 generated for probe p is considered. It is the object to estimate the probability
of a vertical separation infringement between T
1 and T
2. Preferably, the first task consists of determining the stochastic model of the combined
vertical positional error of the pair (T
1, T
2). The probability of vertical separation and infringement is then calculated.
[0216] As shown in Fig. 15 e
1 and e
2, respectively, are the vertical positional errors of T
1 and T
2. σ
12 = E∥e
1∥
22 and σ
22 = E∥e
2∥
22 denote their respective vertical error variances. The combined error vector is given
by

[0217] By the assumptions made for the distribution functions of e
1 and e
2, the distribution function of e is a normal distribution with mean 0. Preferably,
the error vectors e
1 and e
2 are assumed to be independent and thus the combined vertical error variance σ
2 = E∥e∥
22 is given by

[0218] Regarding the
probability of vertical separation infringement, d denotes the distance between the mean vertical positions of T
1 and T
2, σ
2 the combined vertical error variance and d
min the minimum distance below which a vertical separation infringement occurs. The probability
of vertical separation infringement is the probability that the normal random variable
u of mean d and variance σ
2 lies in the interval [-d
min, d
min] as illustrated in Fig. 14.
[0219] Regarding
predicted separation infringement, d
1 and d
v, respectively, are considered to be the distances between the lateral and the vertical
positions of the predicted tracks in the pair. p(a, b) is the probability that d
1 < a and d
v < b. Preferably, d
1 and d
v are assumed to be independent random variables so that

[0220] The probabilities P(d
1 < a) and P(d
v < b) are estimated as described above.
[0221] Preferably, p
min is a threshold probability value. A separation infringement is preferably predicted
as follows:


[0222] Otherwise, no infringement is predicted.
[0223] Preferably, the threshold p
min depends on the prediction time frame as well as the combined region type of the predicted
pair, as discussed above. Further in the specification, a method will be presented
which restricts the interval of possible values of p
min. This method is based on the concept of so-called conflict patterns.
[0224] A
conflict is preferably computed from the set S of predicted pairs of two given aircraft whose
predicted conflict category is less than or equal to a region type parameter CAT_MAX.
The preferred conflict attributes are determined as follows:
Time to conflict: minimum probe in S;
Lateral and vertical starting positions of conflict: mean position vector of the pair
with minimum probe in S;
Predicted minimum lateral (resp. vertical) separation: minimum lateral (resp. vertical)
separation of the pairs in S;
Predicted conflict category: minimum predicted conflict category in S;
Probability of major (resp. minor) separation infringement: maximum probability of
major (resp. minor) separation infringement in S;
Predicted crossing (resp. divergence) flag at starting time of conflict: crossing
(resp. divergence) flag of pair with minimum probe in S; and/or
Predicted major (resp. minor) separation infringement flag: TRUE if a major (resp.
minor) separation infringement is predicted for at least one pair in S, FALSE otherwise.
[0225] In the following preferred optimal
coarse proximity filter parameters will be described. In the coarse proximity filter, as described above, the size EDGE
of the cells and the maximum vertical distance DZ_MAX are preferably chosen large
enough to include all predicted pairs of potential concern. However, choosing these
parameters too large implies that an excessive number of pairs are processed by the
conflict category prediction algorithm and degrades system performance. Furthermore,
the optimal values of EDGE and DZ_MAX may vary with the probe.
[0226] Now, a preferred method which determines optimal values of these parameters for each
probe is presented. This method is based on the separation infringement prediction
of the conflict category prediction module as discussed above. Preferably, the values
of EDGE and DZ_MAX must satisfy the following criterion for each probe:
Separation infringement predicted for pair ⇒ pair is generated by coarse proximity
filter.
[0227] Optimal values meeting this condition are based on some worst case values of: the
minimum distance d
min, above which there is no separation infringement, the threshold probability p
min for separation infringement prediction; and/or the maximum combined error variance
σ
max2 of the trajectory prediction.
[0228] First, the optimal separation is derived as a function of the parameters d
min, p
min and σ
max· Then, for the lateral and vertical cases, the worst case values of these parameters
are calculated. Finally, an example is presented showing the evolution of the parameters
EDGE and DZ_MAX with the probe.
[0229] For
optimal separation u is considered to be a normal random variable of mean d ≥ 0 and variance σ
2. u* denotes the standard normal random variable of mean 0 and variance 1. Thus,

[0230] The function p
σ(d) is defined as the probability of separation infringement, i.e., the probability
that u lies in the interval [-d
min, d
min]:

[0231] The probability of separation infringement is represented in Fig. 14.
[0232] The standard error σ is preferably assumed to satisfy the relation

[0233] The function p
max(d) is defined as the maximum of p
σ(d) for all σ in [0, σ
max]:

[0234] It has to be observed that p
max(d) = 1 for d ≤ d
min and/or p
max(d) decreases monotonically with d > d
min.
[0235] The optimal distance d
opt is defined as the distance d for which p
max(d) is equal to the threshold probability p
min:

[0236] It has to be noted that, by definition of the function p
max(d), the following relation holds:

[0237] Now the
worst case parameters will be discussed. The parameters d
min, p
min and σ
max preferably depend on the region type. Since the coarse proximity filter parameters
EDGE and DZ_MAX are independent of the region type, worst case values for d
min, p
min and σ
max in the set SR of all region types have to be found.
[0238] It is observed that d
opt increases with d
min, that d
opt decreases with p
min and that d
opt increases with σ
max. Therefore, the maximum d
min in SR, the minimum p
min in SR and the maximum σ
max in SR have to be chosen.
[0239] The worst case value of parameter p
min is determined as follows. If the probe is in the SHORT_TERM prediction time frame,

[0240] If the probe is the MEDIUM_TERM prediction time frame,

[0241] If the probe is in the LONG_TERM prediction time frame,

[0242] In the lateral case, the worst case values of parameters d
min and σ
max are preferably determined as follows for each probe. The parameter d
min is given by

[0244] The parameter σ
max is given by

[0245] In the vertical case, the worst case values of parameters d
min and σ
max are preferably determined as follows for each probe. The parameter d
min is given by

[0247] The parameter σ
max is given by

[0248] Fig. 16 shows an example of preferred optimal values of the parameters EDGE and DZ_MAX
calculated for NBPROBES = 13 probes. As can be observed from the figure, EDGE and
DZ_MAX start with a preferred value d
min for probe 0, grow until probe 30 seconds, decrease and stabilize at d
min for probe 70 seconds.
[0249] Further to the configuration parameters which are common to all safety nets and which
have already been discussed above e.g. with regard to tables 1 to 9, the following
tables 12 to 17 present preferred specification as well as preferred values of preferred
parameters specific to STCA. Table 12 shows the specification of coarse proximity
filter parameters, table 13 shows the specification of mode 3/A code selection filter
parameters, table 14 shows the specification of split tracks filter parameters, table
15 shows the specification of combined region type parameters, tables 16 and 17 show
region type parameters wherein table 16 shows the specification of region definition
parameters and table 17 shows the specification of conflict prediction parameters
depending on region type of STCA.
Table 12:
Specification of Coarse Proximity Filter Parameters of STCA |
Parameter |
Description |
Example |
MINLAT |
Minimum latitude of grids |
45:00:00 N |
MINLON |
Minimum longitude of grids |
13:00:00 E |
MAXLAT |
Maximum latitude of grids |
47:00:00 N |
MAXLON |
Maximum longitude of grids |
16:30:00 E |
EDGE |
Size of square cells. If no value is specified, EDGE is determined automatically |
12 NM |
DZ_MAX |
Maximum vertical separation. If no value is specified, DZ_MAX is determined automatically |
50 Fl |
MAX_SPEEDLAT |
Maximum lateral speed (for automatic determination of EDGE) |
0.18 NM/sec |
MAX_SPEEDVERT |
Maximum vertical speed (for automatic determination of DZ_MAX) |
1 Fl/sec |
Table 13:
Specification of Mode 3/A Code Selection Filter Parameters of STCA |
Parameter |
Description |
Example |
MODE |
Mode of operation |
At least one track in pair has selected code |
CODE |
Mode 3/A code |
4324 |
SELECT |
CODE selected ? |
TRUE |
Table 14:
Specification of Split Tracks Filter Parameters of STCA |
Parameter |
Description |
Example |
LSD |
Lateral split distance |
1 NM |
VSD |
Vertical split distance |
2 Fl |
SCD |
Maximum mode 3/A code bit differences |
5 |
WINSIZE |
Size of confirmation window for split detection |
5 |
Table 15:
Specification of Combined Region Types Parameters of STCA |
Parameter |
Description |
Example |
COMBINED(i, j) |
Combined region type of region types i and j |
0 |
Table 16:
Specification of Region Definition Parameters of STCA |
Parameter |
Description |
Example |
RVSM |
RVSM region ? |
TRUE |
Table 17:
Specification of Conflict Prediction Parameters Depending on Region Type of STCA |
Parameter |
Description |
Example |
CAT_MAX |
Maximum category of conflicting predicted pair |
2 |
DL_MAJOR |
Lateral major separation infringement threshold' |
3 NM |
DL_MINOR |
Lateral minor separation infringement threshold |
5 NM |
DV_MIN |
Vertical separation infringement threshold |
8 Fl |
MIN_CROSS_TIME |
Minimum cross-over time in crossing test |
180 sec |
MIN_DIFF_CROSS_TIME |
Minimum difference in times to reach cross-over point in crossing test |
120 sec |
MAX_LAT_VCLOS |
Maximum lateral closing speed in divergence test |
0 NM/sec |
MIN_LAT_DIST |
Minimum lateral distance in divergence test |
4 NM |
MAX_VERT_VCLOS |
Maximum vertical closing speed in divergence test |
0 Fl/sec |
[0250] A preferred idea of conflict patterns consists of imposing the behaviour of the STCA
system in defined situations. A
conflict pattern defines a set of scenarios for which the output of STCA is specified. Two classes
of conflict patterns can be identified, depending on whether or not a conflict alert
is desired for the pattern. A conflict pattern for which an alert is desired will
be called positive conflict pattern, whereas a conflict pattern for which an alert
is not desired will be called negative conflict pattern.
[0251] For example, in a scenario where two levelled aircraft have parallel lateral trajectories
and are always separated laterally by more than 4 NM, we may desire that the STCA
system produces no conflict alert. The same may hold for a scenario in which two levelled
aircraft are separated vertically by more than 1200 ft. In contrast, in a scenario
where two converging and levelled aircraft flying at the same level are predicted
to be separated laterally by less than 1 NM in less than 40 sec in TMA or by less
than 3 NM in less than 80 sec in upper airspace, assuming constant speed vectors,
we may desire that STCA produces a conflict alert.
In order to insure the adequacy between a given set of conflict patterns and the output
of STCA, a preferred idea is to impose restrictions on the interval of possible values
of the minimum confidence level function p
min(t). Positive conflict patterns will impose restrictions on the upper bound of p
min, whereas negative conflict patterns will restrict the lower bound of p
min. Note that it will not always be possible to find a function p
min(t) which is adequate for all conflict patterns in a given set. Indeed, the upper
bound of p
min imposed by a positive conflict pattern may be smaller than the lower bound imposed
by a negative conflict pattern, resulting in a contradiction.
[0252] In the following, the notion of conflict pattern will first be defined formally.
Then, the adequacy conditions for p
min(t) with regard to both positive and negative conflict patterns will be derived. Finally,
the section with some examples of conflict patterns and the corresponding conditions
imposed on the function p
min(t) will be concluded.
[0253] As regards
conflict pattern, if the behaviour of the STCA system in given scenarios shall be imposed, then the
latter must be predictable by STCA. For example, a scenario containing a late manoeuvre
is not predictable by STCA. In this case, the predicted aircraft separation will not
correspond to the actual minimum aircraft separation of the scenario. However, imposing
conditions based on aircraft separations requires that the latter be predictable.
Therefore, conflict patterns will exclusively define sets of scenarios for which the
aircraft 3-D speed vectors remain constant.
[0254] A conflict pattern is preferably defined by the following information:
Conflict pattern identification;
Positive/negative conflict pattern flag;
Region type identification;
tmax: maximum prediction time;
Flag indicating whether the first aircraft in the pair is levelled or not;
Flag indicating whether the second aircraft in the pair is levelled or not;
dl: lateral distance between aircraft;
dv: vertical distance between aircraft;
vl,min: minimum lateral aircraft speed;
vl,max: maximum lateral aircraft speed;
vv,level, max: maximum vertical speed for levelled aircraft;
vv, manvr, max: maximum vertical speed for climbing/descending aircraft; and/or
CD: flag indicating whether the pair of aircraft is crossed and diverging or not.
[0255] The maximum prediction time is only relevant for positive conflict patterns. It specifies
the prediction time above which STCA is not required to yield a conflict alert.
[0256] The information of whether an aircraft is levelled or climbing/descending determines
which error variance model is used in the vertical trajectory prediction of STCA.
[0257] The attributes d
l and d
v correspond to the lateral and vertical aircraft separations at any time in the prediction
time frame.
[0258] The minimum lateral aircraft speed v
l, min is used only for negative conflict patterns. The minimum vertical speed for a climbing/descending
aircraft is implicitly defined as the maximum vertical speed for a levelled aircraft
v
v, level, max.
[0259] The CD flag is used to determine the minimum lateral separation above which there
is no lateral separation infringement. If the flag is set to TRUE, this minimum is
given by the parameter DL_MAJOR. Otherwise, it is given by the parameter DL_MINOR.
[0260] Note that a consequence of the constant speed vector restriction discussed above
is that a conflict pattern is positive if and only if both of the following conditions
are met:
dl is smaller than the minimum lateral separation DL_MAJOR or DL_MINOR above which there
is no lateral separation infringement;
dv is smaller than the minimum vertical separation DV_MIN above which there is no vertical
separation infringement.
[0261] Now,
conflict pattern adequacy conditions will be discussed in more detail. Let p
l(t, vl) denote the probability of lateral separation infringement for a prediction
time t and a lateral aircraft speed v
l. Let p
v(t, vv, level, vv, manvr) denote the probability of vertical separation infringement
for a prediction time t, a vertical speed v
v, level for levelled aircraft and a vertical speed v
v, manvr for climbing/descending aircraft. These probabilities are given by the following
formulae :


where






and where u* denote the standard normal random variable of mean 0 and variance 1.
[0262] As discussed above, a
positive conflict pattern will restrict the upper bound p
minU(t) of p
min(t). This upper bound is given by the formula

[0263] As discussed above, a
negative conflict pattern will restrict the lower bound p
minL(t) of p
min(t). This lower bound is given by the formula

where


[0264] As regards piecewise minimum confidence level function, let p
min(t) be defined as a piecewise constant function with three distinct values for short,
medium and long term prediction time frames, i.e.,

[0265] Let p
minU(t) be the upper bound of p
min(t) restricted by a positive conflict pattern. The following restrictions are imposed
on the values of p
min(t) :



[0266] Let p
min L(t) be the lower bound of p
min(t) restricted by a negative conflict pattern. The following restrictions are imposed
on the values of p
min(t):



[0267] Now present a few
examples of positive and negative conflict patterns in upper airspace and in TMA regions will
be presented. The following parameter values are assumed:
SHORT_TERM = 30 sec;
MEDIUM_TERM = 60 sec;
LONG_TERM = 120 sec.
[0268] Table 18 shows the restricted intervals for the function p
min(t) imposed by a set of positive and negative conflict patterns in
upper airspace. The following values for the parameters defining the safety cylinder centered at
each aircraft are assumed:
DL_MAJOR = 3 NM;
DL_MINOR = 5 NM;
DV_MIN = 800 ft.
Table 18:
Examples of Conflict Patterns in Upper Airspace |
Conflict Pattern |
1 |
2 |
3 |
4 |
5 |
Global |
Positive/negative |
Negative |
Negative |
Negative |
Positive |
Positive |
- |
tmax [sec] |
- |
- |
- |
80 |
30 |
- |
Aircraft 1 levelled |
TRUE |
FALSE |
TRUE |
TRUE |
FALSE |
- |
Aircraft 2 levelled |
TRUE |
FALSE |
TRUE |
TRUE |
FALSE |
- |
dl [NM] |
4 |
4 |
0 |
3 |
0 |
- |
dv [Fl] |
0 |
0 |
12 |
0 |
0 |
- |
vl, min [NM/sec] |
0.09 |
0.09 |
0.09 |
- |
- |
- |
vl, max [NM/sec] |
0.18 |
0.18 |
0.18 |
0.18 |
0.18 |
- |
vv, level, max [Fl/sec] |
0.1 |
0.1 |
0.1 |
0.1 |
0.1 |
- |
vv, manvr, max [Fl/sec] |
0.5 |
0.5 |
0.5 |
0.5 |
0.5 |
- |
CD |
TRUE |
TRUE |
FALSE |
FALSE |
TRUE |
- |
P_MIN_SHORT |
[0.03, 1] |
[0.03, 1] |
[0, 1] |
[0, 1] |
[0, 0.31] |
[0.03,0.31] |
P_MIN_MEDIUM |
[0.18, 1] |
[0.18, 1] |
[0.14, 1] |
[0,0.96] |
[0, 1] |
[0.18,0.96] |
P_MIN_LONG |
[0.27, 1] |
[0.34,1] |
[0.31, 1] |
[0,0.84] |
[0, 1] |
[0.34, 0.84] |
[0269] Table 19 shows the restricted intervals for the function p
min(t) imposed by a set of positive and negative conflict patterns in TMA. The following
values for the parameters defining the safety cylinder centered at each aircraft are
assumed:
DL_MAJOR = 2.5 NM;
DL_MINOR = 3 NM;
DV_MIN = 800 ft.
Table 19:
Examples of Conflict Patterns in TMA |
Conflict Pattern |
1 |
2 |
3 |
4 |
5 |
Global |
Positive/negative |
Negative |
Negative |
Negative |
Positive |
Positive |
- |
tmax [sec] |
- |
- |
- |
40 |
30 |
- |
Aircraft 1 levelled |
TRUE |
FALSE |
TRUE |
TRUE |
FALSE |
- |
Aircraft 2 levelled |
TRUE |
FALSE |
TRUE |
TRUE |
FALSE |
- |
dl [NM] |
4 |
4 |
0 |
1 |
0 |
- |
dv [Fl] |
0 |
0 |
12 |
0 |
0 |
- |
vl,min [NM/sec] |
0.04 |
0.04 |
0.04 |
- |
- |
- |
vl,max [NM/sec] |
0.12 |
0.12 |
0.12 |
0.12 |
0.12 |
- |
vv, level, max [Fl/sec] |
0.1 |
0.1 |
0.1 |
0.1 |
0.1 |
- |
vv, manvr, max [Fl/sec] |
0.5 |
0.5 |
0.5 |
0.5 |
0.5 |
- |
CD |
TRUE |
TRUE |
FALSE |
FALSE |
TRUE |
- |
P_MIN_SHORT |
[0.06, 1] |
[0.07, 1] |
[0.21, 1] |
[0,0.89] |
[0, 0.58] |
[0.21,0.58] |
P_MIN_MEDIUM |
[0.14, 1] |
[0.24, 1] |
[0.34, 1] |
[0,0.72] |
[0, 1] |
[0.34, 0.72] |
P_MIN_LONG |
[0.14, 1] |
[0.34,1] |
[0.35, 1] |
[0, 1] |
[0, 1] |
[0.35,1] |
[0270] As a further preferred example the
minimum safe altitude warning (MSAW) function will be discussed. A minimum safe altitude warning (MSAW) system
is a safety net aimed at predicting minimum safe altitude violations in a near future
and warning the radar controller of this potential danger. This example is based on
the generic specification, design and algorithms which are applicable to all safety
nets and are discussed above in detail and thus describes solely the aspects which
are specific to the MSAW safety net.
[0271] In the context of the MSAW safety net, the notion of conflict as defined above corresponds
to a minimum safe altitude violation. The uncertainty of a conflict is based on the
uncertainty of trajectory prediction, in which errors are unavoidable, as discussed
above. This uncertainty will be represented by a stochastic model for minimum safe
altitude violation. In the context of MSAW, the generic conflict prediction module
as defined above predicts a minimum safe altitude violation of a predicted track and
generates conflicts. In the latter preferred model, a probability of minimum safe
altitude violation is estimated.
[0272] In addition to the general region attributes defined above, MSAW regions are defined
by a minimum safe altitude and/or a maximum altitude of potential concern, above which
aircraft are considered to be in no danger of coming into close proximity with the
minimum safe altitude within the prediction time frame.
[0273] The maximum altitude of potential concern is preferably specified by a single maximum
altitude MAPC, which is preferably valid for the whole region. The minimum safe altitude
is preferably specified in any of the following ways (see Fig. 17):
As a single minimum altitude MSA, preferably valid for the whole region;
As an offset OFFSET to a terrain elevation data base. Such data base may be available
from a satellite survey or the national official cartographer. The minimum safe altitude
is given by

By identifying the region as an obstacle. In this case, the minimum safe altitude
corresponds implicitly to the upper height (specified as an altitude) of the region;
When MSAW is used at airports, as a sloping path associated with an ILS glide path,
a missed approach procedure or a SID. A sloping path is defined by a runaway threshold
and a vertical angle ALPHA. If an aircraft is at a lateral distance d from the runway
threshold, the minimum safe altitude for that aircraft is preferably given by

where ALPHA_TOL denotes a tolerance on the angle ALPHA.
[0274] It is to be noted that manoeuvre regions do not contain the additional attributes
defined here above.
[0275] Preferably, the mode 3/A code selection specifies which codes have to be protected
by the MSAW function. The information preferably required in an input track is specified
above. In the MSAW function, a conflict preferably comprises the following information,
restricted to the prediction time frame: unique conflict identification, wherein contiguous
conflicts for a given aircraft have the same conflict identification; duration of
conflict identification; MSAW system identification (sic, sac); current time; time
to conflict; lateral and vertical starting positions of conflict; current lateral
and vertical distances to starting positions of conflict; predicted minimum altitude;
probability of minimum safe altitude violation; and/or information about the aircraft
involved in the conflict. The information about the aircraft preferably comprises:
track identificaton; mode 3/A code; call sign, if available from input track; and/or
track server identificaton (sic, sac).
[0276] The preferred configuration parameters of the MSAW system which are common to all
safety nets are specified above in tables 1 to 9. Additional parameters or parameters
specific to MSAW are specified in tables 20 and 21 below.
[0277] In the MSAW, additional sufficient conditions for input track elimination in the
generic input track filter, as defined above, are introduced in order to quickly eliminate
input tracks that can not possibly come into close proximity with the minimum safe
altitude within the prediction time frame. These conditions are defined as follows.
[0278] An input track T is eliminated if it does not have a selected mode 3/A code or, if,
for each non-manoeuvre region, any of the following relations hold:


and/or

where MAPC denotes the maximum altitude of potential concern of the region. Regarding
the distance to region it is noted that the distance of a point x to a set S is defined
as the minimum distance of x to each point of S. m denotes the lateral position of
T. The lateral distance d of T to a region R is preferably calculated as follows:
When the lateral geometry of R is a circle of centre c and radius r,
d = max (0, (distance of m to c) - r);
When the lateral geometry of R is a polygon with n edges,

[0279] It should be noted that standard geometrical algorithms can be used to determine
whether a point lies in a simple closed polygon. It should further be noted that,
when the lateral geometry of R is a polygon with a large number of edges, the computation
of d may be costly. In this case d may be substituted for the lateral distance of
T to the minimum bounding box of R, as it is shown in Fig. 18. A bounding box of a
set S in R
n is the cross product of n intervals which encloses the set S.
[0280] Regarding
conflict prediction, the basic idea of the conflict prediction algorithm consists of predicting a minimum
safe altitude violation of a predicted track. All predicted tracks that are not predicted
to violate the minimum safe altitude are eliminated. Finally, conflicts are built
from the remaining predicted tracks.
[0281] Preferably, in order to predict a minimum safe altitude violation of a predicted
track, the highest priority, non-manoeuvre region containing the mean position vector
of the predicted track is determined; a stochastic model for minimum safe altitude
violation for this region is developed from the mean position and error variance vectors
of the predicted track. In this model, a probability of minimum safe altitude violation
is compared to a minimum confidence level. The stochastic model is preferably decomposed
into lateral and vertical models.
[0282] It should be noted that the restriction to the highest priority region containing
the mean position vector of the predicted track is justified since the probability
that the predicted track lies in other regions is normally small and can thus be neglected
and since predicting minimum safe altitude violations for other regions is a complex
task in general because regions may overlap with defined priorities.
[0283] Considering a predicted track T generated for probe p and a region R it is the object
to estimate the probability of a lateral penetration of T into R. m denotes the mean
lateral position of T, d
f the distance of m to the lateral frontier of R, e the lateral positional error vector
of T and σ
2 its lateral error variance, as can be seen in Fig. 19.
[0284] The probability of lateral penetration of T into R is the probability that the vector
m + e lies inside the lateral part of R. Since the exact determination of this probability
is a complex two-dimensional problem, it is preferably approximated by the probability
that the normal random variable u of mean -d
f and variance σ
2 is smaller than 0, as it is shown in Fig. 20. It is given by

[0285] Where u* is the standard normal random variable of mean 0 and variance 1. This probability
is preferably obtained by standard normal distribution table look-up.
[0286] Considering a predicted track T generated for probe p and a region R it is the object
to estimate the probability that the altitude of T is less than the minimum safe altitude
z
min of R at the mean lateral position of T. m denotes the mean vertical position of T,
e the vertical positional error of T and σ
2 its vertical error variance, as is shown in Fig. 21. The probability that the altitude
of T is less than z
min is given by

where u* is the standard normal random variable of mean 0 and variance 1. This probability
is preferably obtained by standard normal distribution table look-up.
[0287] Considering a predicted track T and a region R, p
1 being the probability of lateral region penetration of T into R and p
v being the probability that the altitude of T is less than the minimum safe altitude
of R at the mean lateral position of T, these probabilities are preferably estimated
as described above. Assuming the independence of the lateral and vertical positional
errors of T, the probability p
tot of minimum safe altitude violation of T is given by

p
min is considered to be a threshold probability value. Preferably, a minimum safe altitude
violation is predicted if and only if the relation

holds. Preferably, the threshold p
min depends on the prediction time frame as well as the region type of T as already discussed
in detail above.
[0288] When the lateral geometry of a region is a polygon with a large number of edges,
it may be useful to predict a minimum safe altitude violation for the minimum bounding
box of the region. If no minimum safe altitude violation is predicted for this bounding
box, there is no need to predict a minimum safe altitude violation for the region
itself.
[0289] A
conflict is computed from the set S of predicted tracks of given aircraft for which a minimum
safe altitude violation was predicted. The conflict attributes are preferably determined
as follows:
Time to conflict: minimum probe in S;
Lateral and vertical starting positions of conflict: position vector of predicted
track with minimum probe in S;
Predicted minimum altitude: minimum altitude in S; and/or
Probability of minimum safe altitude violation: maximum probability of minimum safe
altitude violation in S.
[0290] The preferred approximate configuration parameters of the MSAW system which are common
to all safety nets have been specified above, e.g. in Tables 1 to 9. In Tables 20
and 21 below, the specification as well as preferred approximate values of the parameters
which are specific to the MSAW are presented, wherein Table 20 shows the specification
of input track filtering parameters and Table 21 shows the specification of region
definition parameters.
Table 20:
Specification of Input Track Filtering Parameters of MSAW |
Parameter |
Description |
Example |
MAX_DIST_LAT |
Maximum lateral distance of input track to region in order to keep track for further
processing |
20 NM |
MAX_DIST_VERT |
Maximum vertical distance of input track to region in order to keep track for further
processing |
120 Fl |
MAPC |
Maximum altitude of potential concern |
100 Fl |
CODE |
Mode 3/A code |
4324 |
SELECT |
CODE selected ? |
TRUE |
Table 21:
Specification of Region Definition Parameters of MSAW |
Parameter |
Description |
Example |
MSA_TYPE |
Type of minimum safe altitude (single minimum altitude, offset to terrain, obstacle
region, sloping path) |
Single minimum altitude |
MSA |
Single minimum altitude |
10 Fl |
OFFSET |
Offset to terrain |
3 Fl |
ALPHA |
Vertical angle of sloping path |
3 deg |
ALPHA_TOL |
Tolerance on angle ALPHA |
1.4 deg |
RWY_LAT |
Latitude of runway threshold (for sloping path) |
46:00:00 N |
RWY_LON |
Longitude of runway threshold (for sloping path) |
15:00:00 E |
RWY_ALT |
Altitude of runway threshold (for sloping path) |
300 meters |
[0291] Another preferred example of the present invention is the
area proximity warning (APW) function and system. The APW function/system is a safety net aimed at predicting
penetrations of protected air space regions in a near future and warning the radar
controller of this potential danger.
[0292] This example is based on the common framework for all safety nets presenting the
generic specification, design and algorithms which are applicable to all safety nets
as has been described in detail above. Therefore, in the following solely the aspects
which are specific to the APW safety net will be described. In the context of the
APW safety net, the notion of a conflict as defined above will correspond to a penetration
of a protected air space region. In the context of the APW, the generic conflict prediction
module as defined above predicts the penetration of a protected region by a predicted
track and generates conflicts.
[0293] The uncertainty of a conflict is based on the uncertainty of trajectory prediction
and will be represented by a stochastic model for penetration depth of a protected
region. In the latter model, a probability of protected region penetration is estimated.
[0294] APW regions define aircraft access restrictions. For example,
In a military exercise region, only aircraft identified as military are allowed to
fly;
In a Reduced Vertical Separation Minimum (RVSM) region, only RVSM-compliant aircraft
as well as a number of defined non RVSM-compliant aircraft are allowed to fly.
[0295] In addition to the general region attributes defined above, each APW region is defined
by
A flag identifying it as protected or not. If the region is protected, it is associated
with a list of aircraft permitted to fly within the region. The list of aircraft allowed
to fly within a protected region can be specified e.g. by mode 3/A code or call sign;
A flag identifying it as RVSM or not. For each RVSM region R1, there is defined an associated non-RVSM region R2 with the same geometry and lower priority than R1. If an aircraft is RVSM-compliant and R1 is active, it will fall in R1, otherwise in R2.
[0296] It has to be noted that manoeuvre regions do not contain the additional attributes
defined here above and are considered as non-protected regions.
[0297] The information required in an input track is specified above. A conflict preferably
comprises the following information, restricted to the prediction time frame: unique
conflict identification, wherein contiguous conflicts for a given aircraft have the
same conflict identification; duration of conflict identification; APW system identification
(sic, sac); current time; time to conflict; lateral and vertical starting positions
of conflict; current lateral and vertical distances to protected region; predicted
minimum lateral and vertical distances to protected region; probability of protected
region penetration; information about the aircraft involved in the conflict; and/or
protected region identification. The information about the aircraft preferably comprises:
track identification; mode 3/A code; call sign, if available from input track; and/or
track server identification (sic, sac).
[0298] The configuration parameters of the APW system which are common to all safety nets
are specified above, e.g. in Tables 1 to 9. Preferred further or specific parameters
to APW are specified below in Tables 20 and 21.
[0299] Regarding the input track filtering, an additional sufficient condition for input
track elimination in the generic input track filter as defined above has been introduced
in order to quickly eliminate input tracks that cannot possibly penetrate a protected
region within the prediction time frame. It is defined as follows.
[0300] An input track T is eliminated if, for each protected region within which T is not
allowed to fly, any of the following relations hold:


m denotes the lateral position of T. Please note that the distance of a point x to
a set S is preferably defined as the minimum distance of x to each point of S. The
lateral distance d of T to a region R can be calculated as follows:
When the lateral geometry of R is a circle of centre c and radius r,

When the lateral geometry of R is a polygon with n edges,

[0301] It should be noted that standard geometrical algorithms can be used to determine
whether a point lies in a simple closed polygon. It should further be noted that,
when the lateral geometry of R is a polygon with a large number of edges, the computation
of d may be costly. In this case, d is preferably substituted for the lateral distance
of T to the minimum bounding box of R, as shown in Figure 18. A bounding box of a
set S in R
n is the cross product of n intervals which encloses the set S.
[0302] Regarding
conflict prediction, the basic idea of the conflict prediction algorithm consists of predicting the penetration
of a protected region by a predicted track. All predicted tracks that are not predicted
to penetrate any protected region within which the aircraft is not allowed to fly
are eliminated. Finally, conflicts are built from the remaining predicted tracks.
[0303] In order to predict the penetration of a protected region by a predicted track, the
highest priority, non-manoeuvre region containing the mean position vector of the
predicted track is preferably determined. If the latter region is a protected region
within which the aircraft is not allowed to fly, a stochastic model for penetration
of this region is developed from the mean position and error variance vectors of the
predicted track. In this model, a probability of region penetration is compared to
a minimum confidence level. The stochastic model is preferably decomposed in lateral
and vertical models. Otherwise, the predicted track is eliminated.
[0304] It should be noted that the restriction to the highest priority region containing
the mean position vector of the predicted track is justified since the probability
of penetration for other regions is normally small and can thus be neglected and since
predicting the penetration of other regions is a complex task in general because regions
may overlap with defined priorities.
[0305] With regard to the lateral stochastic model, in the APW reference can be made to
the lateral stochastic model as discussed above with respect to e.g. the MSAW.
[0306] For the vertical stochastic model considering a predicted track T generated for probe
p and a protected region R, it is the object to estimate the probability of a vertical
penetration of T into R. m denotes the mean vertical position of T, [z
min, z
max] the height band of R, e the vertical positional error of T and σ
2 its vertical error variance, as can be seen in Fig. 22.
[0307] The probability of a vertical penetration of T into R is given by

where u* is the standard normal random variable of mean 0 and variance 1. This probability
is preferably obtained by a standard normal distribution table look-up.
[0308] With regard to
predicted region penetration p
l and p
v, respectively, are the probabilities of lateral and vertical region penetrations
of a predicted track T. These probabilities are estimated as described above. Assuming
the independence of the lateral and vertical positional errors of T, the probability
p
tot of region penetration of T is given by

p
min is considered to be a threshold probability value. A region penetration is preferably
predicted if and only if the relation

holds. The threshold p
min preferably depends on the prediction time frame as well as the region type of T,
as discussed above in detail.
[0309] When the lateral geometry of a protected region is a polygon with a large number
of edges, it may be useful to predict a penetration of the minimum bounding box of
the region. If the predicted track is not predicted to penetrate this bounding box,
there is no need to predict a penetration of the region itself.
[0310] Preferably, a
conflict is computed from the set S of predicted tracks of a given aircraft which are predicted
to penetrate a given protected region within which the aircraft is not allowed to
fly. The conflict attributes are preferably determined as follows:
Time to conflict: minimum probe in S;
Lateral and vertical starting positions of conflict: position vector of predicted
track with minimum probe in S;
Predicted minimum lateral (resp. vertical) distance to protected region: minimum lateral
(resp. vertical) distance to region of the predicted tracks in S; and/or
Probability of protected region penetration: maximum probability of region penetration
in S.
[0311] The preferred approximate configuration parameters of the APW system, which are common
to all safety nets, have been specified above, e.g., in Tables 1 to 9. Below, in Tables
22 and 23, specifications as well as preferred approximate values of the parameters
which are specific to the APW are presented, wherein Table 22 shows the specification
of input track filtering parameters and Table 23 shows the specification of region
definition parameters.
Table 22:
Specification of Input Track Filtering Parameters of APW |
Parameter |
Description |
Example |
MAX_DIST_LAT |
Maximum lateral distance of input track to protected region in order to keep track
for further processing |
20 NM |
MAX_DIST_VERT |
Maximum vertical distance of input track to protected region in order to keep track
for further processing |
120 Fl |
Table 23:
Specification of Region Definition Parameters of APW |
Parameter |
Description |
Example |
PROTECTED |
Region is protected ? |
TRUE |
RVSM |
RVSM region ? |
TRUE |
IDENT_TYPE |
Aircraft Identification Type (mode 3/A, call sign, both) |
Mode 3/A |
CODE |
Mode 3/A code |
4324 |
CALLSIGN |
Call sign |
ABC1234 |
ALLOWED |
CODE and/or CALLSIGN allowed in region ? |
TRUE |
[0312] The present invention provides a reliable method and system for alerting of potentially
hazardous situations in air traffic which fulfil the objects as defined above. The
system and method assist the controller in his work and help him to better analyse
complex traffic situations and take correct decisions in time. Further, the rate of
nuisance alerts is reduced.
[0313] It is to be noted that the present invention, although discussed with regard to air
traffic, may also be used with regard to other forms of traffic, such as rail traffic,
e.g. trains, road traffic, e.g. cars, or sea traffic, e.g. ships or submarines, etc.
[0314] It is further to be noted, that different features, examples and embodiments and
particularly preferred features, examples and embodiments of the present invention
may be combined in any suitable way in order to define further preferred features,
examples or embodiments of the present invention.