# Patent

## Title
Method and system for simultaneous receiver calibration and object localisation for multilateration

## Abstract

An apparatus for multilateration of a plurality of P objects, each having a transmitter device, and each transmitter device transmitting a signal, the apparatus including N sensors, a processing unit, each sensor receiving the transmitted signals and determining receive times of each signal. The processing unit performing steps: A. combining receive times for signals into a chronologically ordered series of message sets, wherein each message sets comprises the receive times of one of the transmitted signals, B. collecting all valid message sets that occur within a predetermined time interval, wherein k denotes a time step, and wherein each valid message set contains receive times from at least N sensors, C. estimating a time offset vector Ok comprising time offsets Oki of the receive times of the N sensors at step k and i=1 to N by processing message sets, and D. outputting a position of the objects.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is filed under 35 U.S.C. §120 and §365(c) as a continuation of PCT International Patent Application No. PCT/EP2013/053332 filed Feb. 20, 2013 which application claims priority from European Patent Application No. 12156317.5 filed Feb. 21, 2012, which applications are incorporated herein by reference in their entireties.


FIELD OF THE INVENTION
The present invention relates to a method and system for multilateration, and in particular to a method and system for multilateration, preferably wide-area multilateration, wherein object localisation and receiver calibration are performed.
BACKGROUND OF THE INVENTION
Multilateration is a method for tracking objects, i.e., for retrieving reliable information about the state of one or more objects. The state might comprise the position and/or the velocity of the objects, but is not restricted to these quantities. In general, the state can comprise all information about the object that is considered necessary, for example, the acceleration of the objects. There is a wide range of applications for multilateration methods. Particularly relevant are wide-area multilateration (WAM) methods employed in civil or military air surveillance, i.e., for tracking the positions, velocities, etc. of aircraft or other objects like, e.g., helicopters, unmanned aerial vehicles, or satellites. Another example for multilateration is the localisation of a cell phone in case of an emergency call. Multilateration methods can also be used for automotive applications based on retrieving information about the objects in the environment of a car, for example, to increase the security or the driving comfort.
The basic principle of multilateration is to receive signals transmitted by one or more objects to be tracked at several receivers, in the following also designated as sensors, located at different receiver sites, in the following also designated as sensor positions, and to make use of the different receiving times of each of the signals measured at the different receiver sites. To that end, a multilateration system comprises at least a number of receivers and a processing unit configured to process the receiving times of a signal measured at each of the receivers and to output an estimated set of information comprising, e.g., the respective positions of the one or more objects.
Various assemblies and methods can be deployed for surveillance. For example, primary or secondary radar can be used. Primary radar uses the reflection of a signal at the surface of an object. Thus, it can be used in order to localise “uncooperative” objects that are not autonomously emitting signals and/or do not answer requests solicited by the multilateration system. In a secondary radar system, signals transmitted from the multilateration system by means of an “interrogator” are answered by a transponder of an object. Such a system is also called an “active system”. In contrast to this, a “passive system” makes use of signals autonomously transmitted by an object or solicited by other equipment. Furthermore, it can be distinguished between deterministic and stochastic multilateration methods.
A rather straightforward technique for finding the position of an object by means of the above described equipment is a deterministic method as follows.
A relation between an object's position emitting a signal and the receiving times of the signal at each of the receivers is given by a set of N equations




  
    
      
        
          
            y
            i
          
          =
          
            
              
                
                
                  
                    x
                    _
                  
                  -
                  
                    
                      S
                      _
                    
                    i
                  
                
                
              
              c
            
            +
            
              
                t
                e
              
              ⁡
              
                (
                
                  i
                  ∈
                  
                    {
                    
                      1
                      ,
                      ...
                      ⁢
                      
                        
                      
                      ,
                      N
                    
                    }
                  
                
                )
              
            
          
        
        ,
      
    
    
      
        (
        1
        )
      
    
  




with x denoting the position of the object and Si denoting the position of the i'th receiver, N labelling the number of receivers, c denoting the propagation velocity of the medium (ca. 3×108 m/s in air), te labelling the emission time of the signal, yi being the measured receiving times at the i'th receiver, and ∥·∥ denoting the Euclidean norm or L2 norm in space. Usually, the dimension D of the space, and thus, also the dimension of the vectors x and Si, is 2 or 3. In order to remove the unknown emission time te, the equation set (1) is transformed into another equation set comprising the time differences of arrival (TDOA) instead of the measured receiving times. Therefore, without loss of generality a reference receiver, for example the receiver at S1, may be chosen and the measured receiving times of each of the other receivers may be subtracted from the measured receiving time at S1. The result is a set of (N−1) equations, each of which describing a hyperboloid in space. The position of the object is then given by the intersection of these hyperboloids. For the 2-dimensional case, it follows that at least N=3 receivers are required for a unique determination of an object's position. Then, the position of the object is given by the intersection of 2 hyperbolas. In the 3-dimensional case, 4 receivers are necessary to locate the object at the intersection point of 3 hyperboloids. Additional receivers can be used to improve the accuracy of the result.

As the described method is a purely deterministic model, it ignores that measurements in real world are superimposed with noise. To address this issue, estimation methods have to be employed that allow for an explicit consideration of noise or measurement errors within the calculation. The issue has been discussed, for example, in Ref [1], where an “equation error” is introduced and a least-square procedure is used for an estimation of the position of an object. Under certain assumptions, the algorithm proposed in Ref [1] can be considered as a maximum-likelihood estimator. A further development is the maximum-likelihood estimator proposed in Ref [2], where additionally an intermediate variable is used. This leads to a hyperspace solution.
Furthermore, variants of the Kálmán filter proved to be especially suitable to address the problem of tracking objects. The Kálmán filter allows for an estimation of a system's state in real time, even in those cases where only information from inaccurate observations is available. When using Kálmán filters, it is prerequisite that the dynamics of the system state is described separately from the measurement process. This is normally done by (i) a system equation describing the time evolution of the system state and (ii) a measurement equation coupling the system state with the measurements. Usually, both of the equations comprise a deterministic and a stochastic part. This way, it is not only possible to describe noisy observations, but also to deal with uncertainties in modelling the dynamic behaviour of the state [10].
In a time-discretised approach, system equation and measurement equation can then be written in the form:

zk+1=a(zk,wk),  (2)

yk=h(zk,vk),  (3)

wherein the function a recursively describes the time evolution of the system state zk by propagating it from a given time step k to the next time step (k+1), and the function h establishes for any time step k a relation for the system state zk and the measurement yk. Further, wk and vk are random variables describing uncertainties of the time evolution model of Eq. (2) or noise during the measurement process described by Eq. (3). Then, due to the stochastic nature of the Equations (2) and (3), also the state zk and the measurement yk are random variables. The time propagation of a probability distribution of the state zk can then be described by a two-step procedure comprising a prediction step and a filter step. Be fe(zk) an estimated distribution of zk at time step k. Then, in a first step, a prediction for the distribution fp(zk) of the state zk at time step (k+1) is given by the Chapman-Kolmogorov equation

fp(zk+1)=∫f(zk+1|zk)·fe(zk)dzk,  (4)

wherein the transition density f(zk+1|zk) is defined by Eq. (2). In the second step, the current measurement ŷk is used to filter the result of Eq. (4) according to Bayes' rule

fe(zk)=ck·f(ŷk|zk)·fp(zk),  (5)

where ck=1/(∫f(ŷk|zk)·fp(zk)·dzk) is a normalization constant and f(ŷk|zk) is the likelihood defined by Eq. (3).

Under the conditions that Equations (2) and (3) both are linear and that the state is normally distributed, the density fp predicted in Eq. (2) as well as the estimated density fe of the filter step in Eq. (5) can be derived exactly within the Kálmán framework that yields the first two moments, i.e., expectation value and covariance, of these distributions. As under said conditions both densities stay normally distributed for all time steps, the densities are completely described therewith.
However, the Kálmán filter method described above is restricted to purely linear models. As multilateration methods are in general based on non-linear measurement equations, the original formulation of the Kálmán filter cannot be applied. However, variants such as the extended Kálmán filter (EKF) or the unscented Kálmán filter (UKF) are available that provide approximations in case of non-linear equations. An analysis of the performance of these filters in the context of multilateration is given in Ref. [3], which also addresses the recent trend “towards the use of a number of lower cost, low fidelity sensors” [3]. The EKF has been derived from the original Kálmán filter by means of a successive linearization of the process [9]. On the other hand, the UKF or the so-called Gaussian filters are examples of sample-based linear regression Kálmán filters (LRKFs) [10]. Several types of Gaussian filters have been discussed in detail in Ref [9], and it has been shown that these filters are numerically superior over the EKF without causing additional numerical costs. In some cases, for example if the considered equations can be separated into a linear and a nonlinear substructure or if the state vector comprises a directly observed and an indirectly observed part, only part of the filtering process has to be treated in an approximate fashion, when appropriate decomposition methods are used as, for example, proposed in Ref. [10] for the class of Gaussian filters.
Attention should be paid to the fact that all multilateration methods mentioned so far, i.e., the deterministic method of Eq. (1) as well as the stochastic methods described in Refs. [1-3], do not work on the raw data obtained from the measured receiving times, but on the TDOA (time difference of arrival) measurements. This implies that these methods are ultimately based on finding the intersection point of a number of hyperboloids. As mentioned above, the reason for this is to eliminate the unknown emission time of the signals from the description. However, intersecting hyperboloids “is considered a hard task” [6]. Therefore, in Refs. [5] and [6] a multilateration method is developed that allows to reduce the problem to finding the intersection of cones, which is numerically much easier to handle. The emission time b of a signal is thereby estimated. In Ref. [5], the estimation is performed by minimising the Mahalanobis distance M(b) with respect to b.
As already outlined above, closed-form solutions as proposed in Refs. [1,2] or state estimators as disclosed in Ref. [3] can be used, when the arrival times are converted to time difference of arrival. On the other hand, if the arrival times are processed directly, the problem is equal to the GPS problem and the closed-form solution of Ref [4] can be used. Further approaches that process arrival times directly by using a state estimator can be found in Ref [5] or [6] (see above), where in the latter one a system model describes the evolution of the emission time over time. Note, that in Ref. [5], no system model is used to describe the emission time. The emission time is determined by using a certain distance measure in a separate step.
A drawback of state of the art multilateration methods and systems is that all sensors of the multilateration system need to be accurately synchronized, so that the measured receiving times can be performed with a sufficiently high precision. Thus, it is required that all sensors have the same time base so that clock offsets of each of the sensor clocks are eliminated. This synchronization requires high effort and is usually performed by means of additional reference transponders or atomic clocks. The process for determining clock offsets, so that all sensor clocks are synchronized, is called calibration.
BRIEF SUMMARY OF THE INVENTION
The object of the present invention is to provide a method and a system for multilateration, wherein no synchronisation of the sensor clocks is required.
This object is achieved by a method and a system with the features of the claims.
In multilateration, preferably wide-area multilateration (WAM), signals emitted from several objects, e.g. aircraft, are received at different sensors. According to the measured receiving times, the positions of the objects are estimated. The present invention performs clock calibration and localization simultaneously, i.e., no explicit calibration of the sensors is required. Furthermore, the present invention directly operates on the measured receiving time. No conversion to time differences of arrival (TDOA) is necessary. This is achieved by modelling the emission times of the signal as a fully correlated noise process.
The present invention relies on that the signals of a plurality of objects, for example several aircraft and preferably signals representing aircraft motions serve for synchronization part and the estimated sensor offset for the localization part. The requirements for the algorithm are that at least one of several aircraft has to be localized in order to solve the synchronization problem. The transmitted signals of several aircraft (at unknown positions) are used, where the number of necessary aircraft for performing the calculations can be determined by comparing the number of unknowns (the number of aircraft times their degrees of freedom plus the number of unknown aircraft offsets plus the number of unknown sensor offsets) versus the number of given measurements (the length of the below further specified measurement vector).
The advantage of the invention is that it allows the use of many inexpensive unsynchronized sensors, compared to using a few sensors that are accurately synchronized, e.g., with atomic clocks. Furthermore, no synchronization to a global clock is needed and the time delay in the transmission, e.g., from antennas to sensors, is taken into consideration. The wording “unsynchronized sensors” means that the clocks associated with each of sensors, in the following also referred to as “sensor clocks”, are not required to be synchronized to each other. In fact, the inherent time of each of the sensor clocks might be completely arbitrary, except for the requirement that the inherent time of each of the sensor clocks must not comprise discontinuities.
The new approach according to the invention is based on the concept that a certain number of objects can be localized in order to calibrate the network and that a series of additional measurements can be processed chronologically in the estimator. The present invention is particularly suitable for passive systems, see above.
According to the invention, it is required that a transmitted signal can be uniquely related to an object to be tracked by the multilateration system. For processing the transmitted signal, only its measured receiving time at the sensors is used. However, a transmitted signal may also comprise additional information such as, for example, the object's position according to WGS84, the barometric height, and the like.
For the method according to the invention, the following assumptions are made:

    
    
        A transmitted signal, which is considered as a single event in time, can be detected at different sensors at different receiving times.
        Each sensor can form a message which contains the receiving time of each transmitted signal and sufficient information to uniquely identify the transmitting object and the specific event in time.
        The sensor messages relating to a single transmission event can be combined in a message set which contains the receiving times measured from the sensors.
        Furthermore, the message sets are processed in a chronological way, so that the sensor offset can be estimated.
    
    


In other words a transmitter device of an object generates a respective signal. A sensor detects the signal and creates a message. The processing unit collects messages and creates a message set. The algorithm processes the message set. The message set depends on one respective object. Thus, a message set stems from one signal emitted by the object and received by several sensors. The measurement vector is the collection of several message sets from different objects and its arrangement in a vector. Thus, the measurement vector depends on all available objects.
In the method according to the present invention, the emission time is modelled as a fully correlated measurement noise, where no explicit system model is assumed. The emission time can be calculated in a similar way as in Ref [5].
One aspect of the invention is related to a method for multilateration of at least one of a plurality of P objects. The method uses a plurality of N sensors; a processing unit; a transmitter device in each of the objects, wherein each of the transmitters is configured to transmit a respective signal. The method comprises the following steps: (i) transmitting signals by the transmitter device of each of the objects; (ii) receiving the transmitted signals from each of the objects and measuring the respective receiving times by each of the sensors; (iii) combining the measured receiving times of the received signals into a chronologically ordered series of message sets, wherein each of the message sets comprises the receiving times of a single transmitted signal; (iv) collecting all valid message sets yk that occur within a predetermined time interval ΔTk, wherein the index kε{1, . . . , NΔT} denotes a time step, and wherein a message set is valid, when it contains at least two measured receiving times; (v) processing at least two of chronologically obtained message sets by means of said processing unit performing an estimation process, wherein during the estimation process a time offset vector ok is estimated, wherein ok comprises the time offsets oki of the measurements of each of the N sensors at time step k and iε{1, . . . , N}; and (vi) outputting the position of said at least one of a plurality of objects.
In other words, the combination of the measured time events according to the above aspect is performed as follows:
Received measurement times are asynchronously recorded at the individual sensors and transmitted to a central processing unit. Received measurement times from different sensors that relate to the same transmitted signal are used to form a message set; a valid message set contains received measurement times from at least two sensors. The above stated step (iii) corresponds to grouping the valid message sets into bins of length ΔTk and creating a measurement vector. This is a means for assembling required measurement vectors from the individual measurements. These measurement vectors now contain receiving times from several objects to several sensors, which are used for solving the simultaneous calibration problem in subsequent processing steps. In addition to this grouping process, the measurement vectors are sorted with respect to the receiving times in order to avoid complicated methods for including out-of-sequence measurement information into the estimation process.
In the formulas below starting with Eq. (6) grouping can be seen as follows. The individual receiving times for one object and one sensor is given in Eq. (6) and in more detail in Eq. (13) with the nonlinear distance functional from Eq. (10). The measurement vector in Eq. (24) is the one resulting from grouping and contains several individual receiving times.
Specific grouping time intervals for typical sensor setups used in the aerospace context are given hereunder.
The term “chronologically obtained” means that the corresponding message sets are sorted in time.
To illustrate the mentioned use of two consecutive measurement sets: For solely calculating the object positions and the sensor time offsets, processing a single message (of sufficient length) is sufficient. When, in addition, the velocities of the objects and the drift of the sensor clocks are desired, two consecutive measurement sets are used for performing the required calculations.
According to one aspect of the invention, the estimation process of the method comprises: a prediction step that is performed according to the Chapman-Kolmogorov equation; and a filter step that is performed using Bayes' rule.
According to one aspect of the invention, the method further comprises a step, wherein an emission time vector bk is modelled as a full correlated noise process and/or is estimated, preferably by using a distance expression depending on an expectation value of bk, wherein bk comprises the emission times bkj of each of the P objects at time step k, wherein jε{1, . . . , P}.
According to one aspect of the invention, the filter step is performed in accordance with a measurement equation

yk={tilde over (h)}(xk,S,bk,ok,vk),

that, for any time step k, describes a relation between a measurement yk, and wherein {tilde over (h)} is a function depending on: an object position vector xk at a time step k, comprising the positions xkj of each of the P objects at time step k, wherein jε{1, . . . , P}; a sensor position vector S comprising the positions Si of each of the N sensors, wherein iε{1, . . . , N}; the time offset vector ok; a general noise vector vk comprising general noises vki,j at time step k, wherein iε{1, . . . , N} and jε{1, . . . , P}; and possibly the emission time vector bk (i.e., the expression defining the function {tilde over (h)} might or might not explicitly depend on the emission time vector bk).

According to one aspect of the invention, the measurement equation is given by

yk=h(xk1, . . . ,xkP)+Hb·bk+Ho·ok+vk 

with

Hb=IP1N, Ho=1PIN.

According to one aspect of the invention, the prediction step is performed in accordance with a model for describing the time evolution of a state. In this model for describing the time evolution of a state, the time is described by a series of discrete time steps kε{1, . . . , NΔT}. For each of the time steps kε{1, . . . , NΔT}, the state is thereby given by a vector zk comprising: the object position vector xk; an object velocity vector {dot over (x)}k comprising the velocity of each of the objects; the sensor offset vector ok; a sensor drift vector {dot over (o)}k comprising the drift of each of the sensor offsets. Further, the model comprises a recursive system equation

zk+1=a(zk,wk),

wherein a is a function depending on the state at time step k and wk denotes a noise process over the time steps kε{1, . . . , NΔT}.

According to one aspect of the invention, the function a is an affine function, preferably a linear function, of the state zk and the noise wk.
According to one aspect of the invention, the noise process wk over the time steps kε{1, . . . , NΔT} is modelled as a Gaussian distributed process.
According to one aspect of the invention, the prediction step is performed using the Kálmán predictor equations.
According to one aspect of the invention, it is assumed that the measurement and the state are jointly Gaussian distributed, and that the estimated density is described by an expectation value and a covariance.
According to one aspect of the invention, the dependency for the component of the height is reduced by applying a rotation operator on the coordinates of the sensor positions.
According to one aspect of the invention, the dynamics in the measurement values for the j'th object is reduced by subtracting the minimal value of the message set from each of the components of the measurement vector yk, and by adding, to the result thereof, the expected distance of the j'th object.
According to one aspect of the invention, the number P of the objects is between 2 and 10, preferably between 3 and 5, and most preferably P=4; and/or the number N of the sensors is between 5 and 15, preferably between 6 and 10, and most preferably N=7.
According to one aspect of the invention, the length of each of the grouping time intervals ΔTk with kε{1, . . . , NΔT} is between 0.01 and 10 s, preferably between 0.1 and 5 s, and most preferably is equal to 0.5 s.
One aspect of the invention is related to a system for multilateration of at least one of a plurality of P objects. The system uses a plurality of N sensors and a transmitter device in each of the objects, wherein each of the transmitters is configured to transmit a respective message signal. The system further comprises a processing unit configured to preferably operate according to a method according to one of the aspects as described above.
The basic concept of the present invention can be summarized as follows:
The solution of the problem of localizing a set of objects (aircraft) transmitting signals at unknown transmission times is based on receiving times in a set of sensors (base stations), where the sensors are not synchronized with respect to each other and with respect to the objects.
The invention allows calibrating the sensors, which is equivalent to determining a set of offsets relating the true time to the time base used in the sensors. No assumptions about the size of these offsets are made, so the offsets can be arbitrarily large and unbounded.
In this method the effective offsets disturbing the system are determined as they influence the localization procedure. This includes the timing errors themselves, but also signal run times in the receivers, certain propagation and processing delays and so forth. As a result, the effective offsets are not easily measurable, if at all.
The first challenge is how to perform the sensor time offset calibration without changing the hardware setup of the localization system and without using additional, outside information.
According to the present invention the objects, e.g., aircraft, are themselves used for performing the calibration. This has not been done before the present invention was made and was not apparent for several reasons. First, the object positions are unknown and can only be calculated once the sensor offsets are given. So, the objects cannot simply be used as reference beacons. Second, by including the objects into the calibration process for the sensor time offsets, more unknown variables are introduced, which include three unknowns for every aircraft position and a further unknown for the additional transmission offset in every object.
Hence, using the objects themselves for calibration results in two more challenges. The second challenge is that every object introduces new unknowns into the calibration process. Instead of solving the calibration process, this makes the (initial) problem harder.
The present invention provides a solution of this problem. Under certain circumstances, but that there are only a few object/sensor-configurations, it is possible to estimate the sensor offsets given the receiving times. A unique solution can be given if the condition N·P≧N+P·(D+1) is fulfilled. In all other circumstances, the desired variables cannot be obtained. For example, five sensors (base stations) require at least 5 objects (aircraft) for the estimation problem to be fully solved.
The third challenge resulting from using the objects themselves for calibration is that calibration now relies on received signals, for which both the transmission times (in the object) and the receiving times (in the sensor) are unknown. The two corresponding offsets always occur additively and cannot be separated.
The present patent application discloses an appropriate estimation structure to allow for the calculation of the desired offsets. For that purpose, the unknown sensor time offsets, according to the invention, are treated as time-varying quantities modelled as state variables with explicit models for their respective time evolution, see Eqs. (18) to (23).
This set of unknown sensor time offsets is then explicitly estimated simultaneously to the main state, i.e., the object positions, and to the first set of unknown offsets (corresponding to the object transmission offsets in the present notation). The main insight for making this estimation possible is to set up the fully coupled regular system of equations for the two sets of offsets in Eq. (27) that allows for their simultaneous estimation together with the object positions and transmission offsets. This procedure can also be applied when only a calibration is desired and the object parameters are not of interest.
This simultaneous estimation of the sensor time offsets, the object positions, and the transmission time offsets cannot be achieved by considering the standard mathematical setup for performing the object localization. The present invention uses a system of equations that are extended by the right amount of redundant objects and are brought into the right structure. According to an embodiment of the present invention the composition of the dependency matrices in Eq. (27) is provided that result in a regular (i.e., solvable) system of equations. Equivalently, the matrices, in Eq. (25) have to have the right size and structure.
Thus, the present invention provides the right vector-matrix-structure that allows a separation of the two sets of offsets and allows achieving the so called observability of the desired variables, i.e., their solution based on the given measurements.



BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING
In the following, the invention is illustrated and explained with the help of examples and figures. The figures show:
FIG. 1: Two aircraft emitting messages, which are received from different sensors.
FIG. 2: The different measurement models. a) Time of flight; b) Time of flight and emission time; c) Time of flight, emission time and sensor offset; d) Time of flight, emission time, sensor offset and noise.
FIGS. 3 (a) and (b): The RMSE for 30 and 10 aircraft at different noise level. The dashed lines (short dashes and long dashes) show the results for calibrated data, in the case when at every time step all or only parts of the measurements are available, respectively. The solid line and the dash-dotted line show the results for uncalibrated data, in the case when at every time step all or only parts of the measurements are available, respectively.
FIG. 4: Experimental results: Plot for Latitude and Longitude. The thin light lines are the estimated trajectory of the aircraft. The thick black lines are the ADS-B (Automatic Dependent Surveillance Broadcast) data from the aircraft.
FIG. 5: Flowchart of one embodiment of the method.



DETAILED DESCRIPTION OF THE INVENTION
The following notation will be used throughout the explanations given hereinafter:
k: time step
P: total number of objects to be tracked
N: total number of sensors
zk: state at time step k
xkj: position of object j at time step k
yki,j: measurement at sensor i, that comes from object j at time step k
Si: position of sensor i
vki,j, w: noise processes
As illustrated in FIG. 1, in multilateration tracking, the positions of P objects, for example aircraft A1 . . . AP, located at unknown positions xkj for j=1, . . . , P have to be calculated at different time steps k. Several sensors S1 . . . SN located at known positions Si for i=1, . . . , N are measuring time events. A measured event, which stems from the object j, at sensor i at time step k is defined as yki,j. The sensors are in communication with a processing unit PU which receives information from the sensor and produces output information according to techniques set forth below.
The relationship between the measured time event and the position of the objects is given by a non-linear measurement equation

yki,j=hi,j(xkj,Si,vki,j),  (6)

where the measured quantities are corrupted with noise vki,j.

Furthermore, the dynamical behaviour of the system is described by a system equation

zk+1=a(zk,wk),  (7)

where the state variable zk comprises the position of the objects and further state variables like velocity, etc.

In order to estimate the position of the objects, the Bayesian framework is used. It consists of the prediction and filter step. In the prediction step, the estimated density fe(zk) of the previous filter step is propagated from time step k to (k+1) by means of the Chapman-Kolmogorov equation

fp(zk+1)=∫f(zk+1|zk)·fe(zk)dzk,  (8)

where f (zk+1|zk) is the transition density defined by Eq. (7).

In the filter step, the current measurement value ŷk is used for updating the result of the prediction step fp(zk) according to Bayes' rule

fe(zk)=ck·f(ŷk|zk)·fp(zk),  (9)

where ck=1/(∫f(ŷk|zk)·fp(zk)·dzk) is a normalization constant and f(ŷk|zk) is the likelihood defined by Eq. (6).

In order to derive a measurement model for the method for multilateration according to the invention, i.e., a method for multilateration in the case of unsynchronized sensor clocks, the different influences in the measurement process are described. First, only the time of arrival is considered, then this is extended to the case that the emission time is unknown. After that, the sensor offset and the influence of the noise are described. The four different models are shown in FIG. 2.
1) Time of Flight: The time of flight describes the travelling time of a signal from an object j to a sensor i. The relationship between the measured time of arrival dki,j and the unknown object position xkj is then given by the Euclidean distance according to




  
    
      
        
          
            d
            k
            
              i
              ,
              j
            
          
          =
          
            
              
                
                
                  
                    
                      x
                      _
                    
                    k
                    j
                  
                  -
                  
                    
                      S
                      _
                    
                    i
                  
                
                
              
              2
            
            c
          
        
        ,
      
    
    
      
        (
        10
        )
      
    
  




where c is the wave propagation speed and ∥·∥2 is the L2 norm.

2) Time of Flight+Unknown Emission Time: In the second scenario, the sensor cannot directly determine the travelling time due to the fact that the emission time of the object for a certain message is not known. This unknown emission time bkj leads to an unknown offset

yki,j=dki,j+bkj,  (11)

where this emission time is equal for all sensors for this certain message. In the following, the emission time is referred to as object offset.

3) Time of Flight+Unknown Emission Time+Sensor Offset: The third scenario is a situation, where in addition to the above described situation of scenario 2), also the sensor clocks are not synchronized to each other. Thus, every sensor has a sensor offset okj and this results in

yki,j=dki,j+bkj+oki.  (12)

This sensor offset is equal to all messages, which are measured at the same time.

4) Time of Flight+Unknown Emission Time+Sensor Offset+Noise: In a real scenario, disturbances occur. In order to cope with these uncertainties, a noise process vki,j is used, which leads to

yki,j=dki,j+bkj+oki+vki,j.  (13)

In detail, Eq. (13) decomposes the individual receiving time into

    
    
        dki,j, the spatial distance between the affected object and the affected sensor divided by the wave propagation speed, which results in the net travelling time,
        bkj, the offset corresponding to the unknown transmitting time in the object,
        oki, the offset corresponding to the unknown receiving time—or equivalently the lack of lack of synchronization—in the sensor,
        vki,j, zero-mean noise.
    
    


According to one aspect of the invention reference is just made to the offsets in the sensors as these are the ones to be estimated. The travelling times between sensors and objects is used for calculating the object positions simultaneously to the sensor offsets.
The system model describes the evolution of the state over time. In the following, the motion model for an aircraft and the system model for the sensor offset are discussed. Finally, a discussion for the aircraft offset is made.
1) Motion Models for Aircraft: Different types of motion models for aircraft can be applied, depending on the expected motion to be performed. In one embodiment, a standard motion model, the constant velocity model, is applied [7, 8]. The constant velocity model is described in state space as




  
    
      
        
          
            [
            
              
                
                  
                    
                      x
                      _
                    
                    
                      k
                      +
                      1
                    
                    j
                  
                
              
              
                
                  
                    
                      
                        x
                        _
                      
                      .
                    
                    
                      k
                      +
                      1
                    
                    j
                  
                
              
            
            ]
          
          =
          
            
              
                A
                
                  
                    x
                    _
                  
                  ,
                  
                    
                      x
                      _
                    
                    .
                  
                
              
              ·
              
                [
                
                  
                    
                      
                        
                          x
                          _
                        
                        k
                        j
                      
                    
                  
                  
                    
                      
                        
                          
                            x
                            _
                          
                          .
                        
                        k
                        j
                      
                    
                  
                
                ]
              
            
            +
            
              
                w
                _
              
              
                k
                ❘
              
              
                
                  x
                  _
                
                ,
                
                  
                    x
                    .
                  
                  _
                
              
            
          
        
        ,
      
    
    
      
        (
        14
        )
      
    
  




where the system matrix is given by





  
    
      
        
          
            A
            
              
                x
                _
              
              ,
              
                
                  x
                  _
                
                .
              
            
          
          =
          
            [
            
              
                
                  I
                
                
                  
                    T
                    ·
                    I
                  
                
              
              
                
                  0
                
                
                  I
                
              
            
            ]
          
        
        ,
      
    
    
      
        (
        15
        )
      
    
  




where T is the sampling time and {dot over (x)}kj the velocity of the aircraft j.

The process noise wkx,{dot over (x)} is assumed as Gaussian distributed, with zero-mean and covariance matrix given by




  
    
      
        
          C
          
            
              x
              _
            
            ,
            
              
                x
                _
              
              .
            
          
        
        =
        
          
            [
            
              
                
                  
                    
                      
                        T
                        3
                      
                      3
                    
                    ⁢
                    
                      C
                      
                        
                          x
                          _
                        
                        .
                      
                    
                  
                
                
                  
                    
                      
                        T
                        2
                      
                      2
                    
                    ⁢
                    
                      C
                      
                        
                          x
                          _
                        
                        .
                      
                    
                  
                
              
              
                
                  
                    
                      
                        T
                        2
                      
                      2
                    
                    ⁢
                    
                      C
                      
                        
                          x
                          _
                        
                        .
                      
                    
                  
                
                
                  
                    TC
                    
                      
                        x
                        _
                      
                      .
                    
                  
                
              
            
            ]
          
          .
        
      
    
    
      
        (
        16
        )
      
    
  




The covariance matrix C{dot over (x)} depends on the continuous time system model

C{dot over (x)}=diag([CxCyCz]).  (17)

This is a specific object motion model, a so-called “constant velocity model”, with generic noise parameters for the acceleration that is modelled as white noise. Cx, Cy, Cz denote the spatial variances of the acceleration in a Cartesian space. For a concrete application, these values have to be determined based on practical considerations. Here reference can be made to Ref [8].
2) Sensor Offset Models: Due to the clock drift, the clock of each of several sensors drift apart and a sensor/clock offset okj of sensor i occurs. The clock offset is modelled as a continuous time process

{dot over (o)}i(t)=ρi(t),  (18)

where the ρi(t) is modelled as a noise process with time characteristics of the drift, given by

{dot over (ρ)}i(t)=w{dot over (o)}(t),  (19)

which leads to

öi(t)=w{dot over (o)}(t).  (20)

After time discretisation the time discrete system model is given by





  
    
      
        
          
            [
            
              
                
                  
                    
                      o
                      k
                      i
                    
                    +
                    1
                  
                
              
              
                
                  
                    
                      
                        o
                        .
                      
                      k
                      i
                    
                    +
                    1
                  
                
              
            
            ]
          
          =
          
            
              
                A
                
                  o
                  ,
                  
                    o
                    .
                  
                
              
              ·
              
                [
                
                  
                    
                      
                        o
                        k
                        i
                      
                    
                  
                  
                    
                      
                        
                          o
                          .
                        
                        k
                        i
                      
                    
                  
                
                ]
              
            
            +
            
              
                w
                _
              
              k
              
                o
                ,
                
                  o
                  .
                
              
            
          
        
        ,
      
    
    
      
        (
        21
        )
      
    
  




where the system matrix is given by





  
    
      
        
          A
          
            o
            ,
            
              o
              .
            
          
        
        =
        
          [
          
            
              
                1
              
              
                T
              
            
            
              
                0
              
              
                1
              
            
          
          ]
        
      
    
    
      
        (
        22
        )
      
    
  




and the process wko,{dot over (o)} is assumed as Gaussian distributed, with covariance





  
    
      
        
          C
          
            o
            ,
            
              o
              .
            
          
        
        =
        
          
            [
            
              
                
                  
                    
                      
                        T
                        3
                      
                      3
                    
                    ⁢
                    
                      C
                      
                        o
                        .
                      
                    
                  
                
                
                  
                    
                      
                        T
                        2
                      
                      2
                    
                    ⁢
                    
                      C
                      
                        o
                        .
                      
                    
                  
                
              
              
                
                  
                    
                      
                        T
                        2
                      
                      2
                    
                    ⁢
                    
                      C
                      
                        o
                        .
                      
                    
                  
                
                
                  
                    TC
                    
                      o
                      .
                    
                  
                
              
            
            ]
          
          .
        
      
    
    
      
        (
        23
        )
      
    
  




C{dot over (o)} is the variance of the continuous time process.

3) Aircraft Offset Models: In the proposed approach it is assumed that the evolution of the emission time over time cannot be described by an adequate system model. The emission times are assumed as a noise process bkj which is modelled later as a full correlated noise process in the measurement equation.
In the following, the resulting measurement equation and system equation for the method for multilateration according to the invention with unsynchronised clocks are shown for a complete message set. Furthermore, an inequality for one time step is given.
Based on Eq. (13), the resulting measurement equation for P aircraft and N sensors is given by

yk=h(xk1, . . . ,xkP)+Hb·bk+Ho·ok+vk  (24)

where

Hb=IP1N, Ho=1PIN.  (25)

 stands for the Kronecker product. In the non-linear equation, the times of flight are listed according to

h(xk1, . . . ,xkP)=[dk1,1 . . . dkN,1 . . . dki,j . . . dkN,P]T  (26)

Using Eqs. (25) and (26), Eq. (24) can also be written in the form




  
    
      
        
          
            y
            _
          
          k
        
        =
        
          
            
              1
              c
            
            ⁡
            
              [
              
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          1
                        
                        -
                        
                          
                            S
                            _
                          
                          1
                        
                      
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          1
                        
                        -
                        
                          
                            S
                            _
                          
                          N
                        
                      
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          P
                        
                        -
                        
                          
                            S
                            _
                          
                          1
                        
                      
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          P
                        
                        -
                        
                          
                            S
                            _
                          
                          N
                        
                      
                      
                    
                  
                
              
              ]
            
          
          +
          
            
              [
              
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    ⋮
                  
                  
                    ⋮
                  
                  
                    ⋮
                  
                
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋱
                  
                  
                    
                      
                    
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
                
                  
                    ⋮
                  
                  
                    ⋮
                  
                  
                    ⋮
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
              
              ]
            
            ·
            
              [
              
                
                  
                    
                      b
                      k
                      1
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      b
                      k
                      P
                    
                  
                
              
              ]
            
          
          +
          
            
              [
              
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋱
                  
                  
                    
                      
                    
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋮
                  
                  
                    
                      
                    
                  
                
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋱
                  
                  
                    
                      
                    
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
              
              ]
            
            ·
            
              [
              
                
                  
                    
                      o
                      k
                      1
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      o
                      k
                      N
                    
                  
                
              
              ]
            
          
          +
          
            
              
                v
                _
              
              k
            
            .
          
        
      
    
    
      
        (
        27
        )
      
    
  




As described before, the emission time is considered as fully correlated noise due to the fact that no system model for the emission time can be assumed. In this case, the new noise process vkF in

yk=h(xk1, . . . ,xkP)+Ho·ok+vkF  (28)

consists of

vkF=Hb·bk+vk.  (29)

The first two moments of noise process are then given by




  
    
      
        
          
            
              μ
              _
            
            k
            
              
                υ
                _
              
              F
            
          
          =
          
            
              H
              b
            
            ·
            
              
                μ
                _
              
              k
              
                b
                _
              
            
          
        
        ,
        
          

        
        ⁢
        
          
            C
            k
            
              
                υ
                _
              
              F
            
          
          =
          
            
              
                H
                b
              
              ·
              
                C
                k
                
                  b
                  _
                
              
              ·
              
                
                  (
                  
                    H
                    b
                  
                  )
                
                T
              
            
            +
            
              
                C
                k
                
                  υ
                  _
                
              
              .
            
          
        
      
    
    
      
        (
        30
        )
      
    
  




The system state consists of the positions, the velocities, the sensor offsets, and the sensor drifts, according to

zk=[(xk1)T({dot over (x)}k1)T . . . (ok1)T({dot over (o)}k1)T . . . ]T.  (31)

The system equation can be modelled as a linear system equation based on Eqs. (14) and (21), given by

zk+1=A·zk+wk,  (32)

where the system matrix is given by

A=blkdiag(Ax,{dot over (x)}, . . . ,Ax,{dot over (x)},Ao,{dot over (o)}, . . . ,Ao,{dot over (o)})  (33)

and the covariance of the process noise

Cw=blkdiag(Cx,{dot over (x)}, . . . ,Cx,{dot over (x)},Co,{dot over (o)}, . . . ,Co,{dot over (o)}).  (34)

If P aircraft are emitting signals, which are received by N sensors, N·P possible measurements can be used for one time step. The measurement equation consists of N+P·(D+1) unknown variables, where D is the considered dimension, in general D=3. A unique solution can be given if the condition N·P≧N+P·(D+1) is fulfilled.
For estimation, a Gaussian assumed density filter [9] is used, where the involved densities are described by the first two moments. Due to the linear motion model, Eq. (8) can be solved with the Kálmán predictor equation. However, due to the non-linear measurement equation, Eq. (9) cannot be solved directly. In order to solve the filter step, it is assumed that state and measurement are jointly Gaussian distributed.
Due to the non-linear measurement equation, a Gaussian assumed density filter is used. The filter step is solved based on the first two moments and it is assumed that the measurement and state are jointly Gaussian distributed. For a given measurement ŷk, the conditional Gaussian is given by




  
    
      
        
          
            
              μ
              _
            
            k
            e
          
          =
          
            
              
                μ
                _
              
              k
              p
            
            +
            
              
                C
                k
                
                  
                    z
                    _
                  
                  ,
                  
                    y
                    _
                  
                
              
              ·
              
                
                  (
                  
                    C
                    k
                    
                      y
                      _
                    
                  
                  )
                
                
                  -
                  1
                
              
              ·
              
                (
                
                  
                    
                      
                        y
                        _
                      
                      ^
                    
                    k
                  
                  -
                  
                    (
                    
                      
                        
                          μ
                          _
                        
                        k
                        
                          y
                          _
                        
                      
                      +
                      
                        
                          H
                          b
                        
                        ·
                        
                          
                            μ
                            _
                          
                          k
                          
                            b
                            _
                          
                        
                      
                    
                    )
                  
                
                )
              
            
          
        
        ,
        
          

        
        ⁢
        
          
            C
            k
            e
          
          =
          
            
              C
              k
              p
            
            -
            
              
                C
                k
                
                  
                    z
                    _
                  
                  ,
                  
                    y
                    _
                  
                
              
              ·
              
                
                  (
                  
                    c
                    k
                    
                      y
                      _
                    
                  
                  )
                
                
                  -
                  1
                
              
              ·
              
                
                  (
                  
                    C
                    k
                    
                      
                        z
                        _
                      
                      ,
                      
                        y
                        _
                      
                    
                  
                  )
                
                T
              
            
          
        
        ,
      
    
    
      
        (
        35
        )
      
    
  




where μkp and Ckp are the predicted mean and covariance. In order to calculate the estimated mean μke and covariance Cke, the three unknown moments, i.e., the cross-covariance between state and measurement Ckz,y, the covariance of the measurement process Cky, and the predicted measurement μky have to be calculated. It should be noted that for the calculation of the predicted measurement μky the values of the aircraft offsets are not considered. The values for the aircraft offsets are determined in a separate step, which will be explained below.

In the method for multilateration according to the invention, decomposition methods as proposed in Ref [10] are applied in order to reduce the mathematical effort. When using these decomposition methods in conditional linear models, it is possible to approximate the above outlined calculations, i.e., in particular the calculation of the expressions of Eqs. (35), with regard to the positions by a sample-based approach. The sample points are propagated through the measurement equation in Eq. (28). These sample points and the decomposed part are then used in order to calculate the mean and the covariance of the measurement process, as well as the cross-covariance between state and measurement.
Until now the aircraft offset is still unknown. In order to determine the aircraft offset, the Mahalanobis distance of the measurement density is used. For any time step k, the Mahalanobis distance can be expressed by a function of the mean value μkb of the aircraft offset bk. Then, the minimum of the Mahalanobis distance corresponds to the best estimation value for the aircraft offset. In order to find the best estimation value for the aircraft offset, the derivation of the Mahalanobis with respect to the mean value of the aircraft offset is taken,




  
    
      
        
          
            
              
                
                  d
                  
                    
                  
                
                
                  d
                  
                    
                      μ
                      _
                    
                    k
                    
                      b
                      _
                    
                  
                
              
              ⁢
              
                
                  
                    (
                    
                      
                        
                          
                            y
                            _
                          
                          ^
                        
                        k
                      
                      -
                      
                        (
                        
                          
                            
                              μ
                              _
                            
                            k
                            
                              y
                              _
                            
                          
                          +
                          
                            
                              H
                              b
                            
                            ·
                            
                              
                                μ
                                _
                              
                              k
                              
                                b
                                _
                              
                            
                          
                        
                        )
                      
                    
                    )
                  
                  T
                
                ·
                
                  
                    (
                    
                      C
                      k
                      
                        y
                        _
                      
                    
                    )
                  
                  
                    -
                    1
                  
                
                ·
                
                  (
                  
                    
                      
                        
                          y
                          ^
                        
                        _
                      
                      k
                    
                    -
                    
                      (
                      
                        
                          
                            μ
                            _
                          
                          k
                          
                            y
                            _
                          
                        
                        +
                        
                          
                            H
                            b
                          
                          ·
                          
                            
                              μ
                              _
                            
                            k
                            
                              b
                              _
                            
                          
                        
                      
                      )
                    
                  
                  )
                
              
            
            =
            0
          
          ,
        
        ⁢
        
          
        
      
    
    
      
        (
        36
        )
      
    
  




which leads to





  
    
      
        
          
            -
            2
          
          ⁢
          
            
              
                (
                
                  H
                  b
                
                )
              
              T
            
            ·
            
              
                (
                
                  C
                  k
                  
                    y
                    _
                  
                
                )
              
              
                -
                1
              
            
            ·
            
              (
              
                
                  
                    
                      y
                      _
                    
                    ^
                  
                  k
                
                -
                
                  (
                  
                    
                      
                        μ
                        _
                      
                      k
                      
                        y
                        _
                      
                    
                    +
                    
                      
                        H
                        b
                      
                      ·
                      
                        
                          μ
                          _
                        
                        k
                        
                          b
                          _
                        
                      
                    
                  
                  )
                
              
              )
            
          
        
        =
        0.
      
    
    
      
        (
        37
        )
      
    
  




The aircraft offset is then calculated by




  
    
      
        
          
            μ
            _
          
          k
          
            b
            _
          
        
        =
        
          
            
              (
              
                
                  
                    (
                    
                      H
                      b
                    
                    )
                  
                  T
                
                ⁢
                
                  
                    (
                    
                      C
                      k
                      
                        y
                        _
                      
                    
                    )
                  
                  
                    -
                    1
                  
                
                ⁢
                
                  H
                  b
                
              
              )
            
            
              -
              1
            
          
          ⁢
          
            
              (
              
                H
                b
              
              )
            
            T
          
          ⁢
          
            
              (
              
                C
                k
                
                  y
                  _
                
              
              )
            
            
              -
              1
            
          
          ⁢
          
            (
            
              
                
                  
                    y
                    ^
                  
                  _
                
                k
              
              -
              
                
                  μ
                  _
                
                k
                
                  y
                  _
                
              
            
            )
          
        
      
    
    
      
        (
        38
        )
      
    
  




and then used in Eq. (35).

Due to the linear models in Eq. (32), the Kálmán predictor equations are used, which are given by

μkp=A·μke,

Ckp=A·Cke·(A)T+Cw.  (39)

With reference to FIG. 5, the method can be sketched as follows. At step 510, for an arbitrary time step, with the predicted density of the state described by its two first moments, i.e., the expectation value μP and the covariance matrix CP, the predicted measurement μy, the covariance of the measurement process Cy, and the cross-covariance between the state and the measurement Cz,y are calculated. Then, at step 520, the calculated quantities are used to obtain an estimation for the aircraft offset μb according to Eq. (38). Next, at step 530, in the filter step, the estimated density of the state described by its expectation value μe and Ce is calculated according to Eq. (35) using the results from the previous steps. Then, at step 540, according to the Kálmán predictor equations (39), the expressions μe and Ce are used to calculate the predicted density of the state for the next time step, which is again given by the expectation value μP and the covariance matrix CP.
Embodiments of the invention may also comprise a feature that allows for an improvement of the accuracy of the method for multilateration. This optional feature is related to the implementation of the method for multilateration and will be discussed in the following. The estimation is performed in a Cartesian coordinate system. Due to the fact that the aircraft is moving on a certain barometric height, this leads to the fact that the aircraft moves in a certain Cartesian space on a plane. In order to reduce dependencies for the component in the z axis, a transformation can be used. It is assumed that the certain area lies at latitude α and longitude β, and so a rotation matrix is given by




  
    
      
        R
        =
        
          
            
              [
              
                
                  
                    
                      cos
                      ⁡
                      
                        (
                        α
                        )
                      
                    
                  
                  
                    0
                  
                  
                    
                      -
                      
                        sin
                        ⁡
                        
                          (
                          α
                          )
                        
                      
                    
                  
                
                
                  
                    0
                  
                  
                    1
                  
                  
                    0
                  
                
                
                  
                    
                      sin
                      ⁡
                      
                        (
                        α
                        )
                      
                    
                  
                  
                    0
                  
                  
                    
                      cos
                      ⁡
                      
                        (
                        α
                        )
                      
                    
                  
                
              
              ]
            
            ⁡
            
              [
              
                
                  
                    1
                  
                  
                    0
                  
                  
                    0
                  
                
                
                  
                    0
                  
                  
                    
                      cos
                      ⁡
                      
                        (
                        β
                        )
                      
                    
                  
                  
                    
                      -
                      
                        sin
                        ⁡
                        
                          (
                          β
                          )
                        
                      
                    
                  
                
                
                  
                    0
                  
                  
                    
                      sin
                      ⁡
                      
                        (
                        β
                        )
                      
                    
                  
                  
                    
                      cos
                      ⁡
                      
                        (
                        β
                        )
                      
                    
                  
                
              
              ]
            
          
          .
        
      
    
    
      
        (
        40
        )
      
    
  




The sensor positions are rotated, in such a way, that the dependencies in the z axis are removed according to

R·Si.  (41)

In order to reduce the dynamics in the measurement values for the j'th aircraft, the minimal value can be subtracted from the message set

yk1 . . . N,j=[yki,j . . . ykN,j]T  (42)

coming from the j'th aircraft, and to reduce the dynamic in the aircraft offset for the j'th aircraft, a possible distance can be added according to

yk1 . . . N,j−min(yk1 . . . N,j)+dkargmin(yk1 . . . N,j),j.  (43)

For the proposed estimator it is useful to have a certain number of measurements over time. If the drift is slowly varying, the message sets from different aircraft can be collected over some short time horizon.
According to the embodiments of the invention described above, the method for multilateration has been evaluated with simulated and real data. In the simulation, the method of the invention is compared to the case, when the sensors are accurately synchronized. In the experiment, the estimated positions are compared to the ADS-B position of the aircraft.
In the simulation, the method according to the invention is compared to the case when the sensor offset is perfectly known, where both algorithms make use of a state estimator (Gaussian assumed density filter-GADF) and in the latter one the sensor offset is omitted from the state space. For the simulation, 8 sensors are placed according to Ref [11] so as to measure the receiving times of messages from different aircraft. The number of aircraft was selected to 10 and 30, respectively. The measured receiving times comprise the time of flight, an aircraft and sensor offset. Furthermore, the receiving times are corrupted with Gaussian noise varying from zero to 0.1 km. The simulation time is 360 seconds, with a sampling time of 0.1 seconds.
Furthermore, the algorithms are compared between full measurement, i.e., all sensors received data from all aircraft at every time step, to part measurements, i.e., only a part of the possible measurement are measured. In FIG. 3(a), the root-mean-square error (RMSE) for all aircraft (30 aircraft) are shown for the case of calibrated and uncalibrated data, as well for full and part measurements. The ground truth corresponds to when the sensor offset is perfectly known. For uncalibrated data and full measurement, the method according to the invention has a higher RMSE than the ground truth, when the noise level increases. This deviation increases, when only part measurements are taken.
If the number of aircraft is decreased to 10, the accuracy for the method according to the invention compared to calibrated clocks is decreased as shown in FIG. 3(b). This can be explained by the fact that less aircraft serve for synchronization.
In the real world experiment, uncalibrated data was used in order to estimate the trajectory of the aircraft. The proposed approach was compared to the ADS-B data from the aircraft. The whole dataset contains a recording about 13 minutes. In the evaluation, data over a 0.1 second horizon are collected to a data set for every measurement step. Furthermore, preferably a validation gate is used in order to cope with outliers. Outliers can cause poor estimates for the localization and synchronisation procedure. The validation gate is used for checking the result of the calculation before updating the estimated state of the system. More specifically, in order to detect outliers, the predicted measurement is compared to actual measurement depending on a given uncertainty. In FIG. 4 the results for the proposed approach and the ADS-B-data are shown.
While the invention has been illustrated and described in detail in the drawings and foregoing description, such illustration and description are to be considered illustrative or exemplary and not restrictive. It will be understood that changes and modifications may be made by those of ordinary skill within the scope of the following claims. In particular, the present invention covers further embodiments with any combination of features from different embodiments described above and below.
Furthermore, in the claims the word “comprising” does not exclude other elements or steps, and the indefinite article “a” or “an” does not exclude a plurality. A single unit may fulfil the functions of several features recited in the claims. The terms “essentially”, “about”, “approximately” and the like in connection with an attribute or a value particularly also define exactly the attribute or exactly the value, respectively. Any reference signs in the claims should not be construed as limiting the scope.
REFERENCES


    [1] J. O. Smith and J. S. Abel, “Closed-Form Least-Squares Source Location Estimation from Range-Difference Measurements,” IEEE Transactions of Acoustics, Speech, and Signal Processing, vol. ASSP-35, no. 12, pp. 1661-1669, December 1987.
    [2] Y. Chan and K. Ho, “A Simple and Efficient Estimator for Hyperbolic Location,” IEEE Transactions on Signal Processing, vol. 42, no. 8, pp. 1905-1915, August 1994.
    [3] F. Fletcher, B. Ristic, and D. Musicki, “Recursive Estimation of Emitter Location using TDOA Measurements from two UAVs,” in Proceedings of the 10th International Conference on Information Fusion (Fusion 2007), Quebec, Canada, July 2007, pp. 1-8.
    [4] S. Bancroft, “An Algebraic Solution of the GPS Equations,” IEEE Transactions on Aerospace and Electronic Systems, vol. AES-21, no. 1, pp. 56-59, January 1985.
    [5] F. Beutler and U. D. Hanebeck, “A Two-Step Approach for Offset and Position Estimation from Pseudo-Ranges Applied to Multilateration Tracking,” in Proceedings of the 13th International Conference on Information Fusion (Fusion 2010), Edinburgh, United Kingdom, July 2010, pp. 1-8.
    [6] P. Dunau, F. Packi, F. Beutler, and U. D. Hanebeck, “Efficient Multilateration Tracking System with Concurrent Offset Estimation using Stochastic Filtering Techniques,” in Proceedings of the 13th International Conference on Information Fusion (Fusion 2010), Edinburgh, United Kingdom, July 2010, pp. 1-8.
    [7] G. Welch, B. D. Allen, A. Ilie, and G. Bishop, “Measurement Sample Time Optimization for Human Motion Tracking/Capture Systems,” in Proceedings of Trends and Issues in Tracking for Virtual Environments, Workshop at the IEEE Virtual Reality 2007 Conference, Charlotte, N.C., March 2007.
    [8] Y. Bar-Shalom, X. R. Li, and T. Kirubarajan, Estimation with Applications to Tracking and Navigation: Theory, Algorithms and Software. John Wiley & Sons, Inc., 2001.
    [9] K. Ito and K. Xiong, “Gaussian Filters for Nonlinear Filtering Problems,” IEEE Transactions on Automatic Control, vol. 45, no. 5, pp. 910-927, May 2000.
    [10] F. Beutler, M. F. Huber, and U. D. Hanebeck, “Gaussian Filtering using State Decomposition Methods,” in Proceedings of the 12th International Conference on Information Fusion (Fusion 2009), Seattle, Wash., July 2009, pp. 1-8.
    [11] J. Isaacs, D. Klein, and J. Hespanha, “Optimal Sensor Placement for Time Difference of Arrival Localization,” in Proceedings of the 48th IEEE Conference on Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference (CDC/CCC 2009), Shanghai, China, December 2009, pp. 7878-7884.

## Claims

1. A processing unit apparatus for use in a system for multilateration of at least one of a plurality of P objects, each of the plurality of P objects having a transmitter device, and each of the transmitter devices being configured to transmit a respective signal, each of a plurality of N sensors adapted to receive the transmitted signals from each of the objects and to measure respective receive times of each of the signals, the processing unit apparatus adapted to be operatively coupled to the plurality of sensors and to perform steps comprising:
A. combining the receive times for the signals into a chronologically ordered series of message sets, wherein each of the message sets comprises the receive times of one of the transmitted signals as determined by each sensor;
B. collecting all valid message sets that occur within a predetermined time interval ΔTk, wherein the index kε{1, . . . , NΔT} denotes a time step, and wherein each valid message set contains receive times from at least N sensors;
C. estimating a time offset vector ok comprising time offsets oki of the receive times of the N sensors at time step k and iε{1, . . . , N} by processing at least one of the message sets; and
D. outputting a position of said at least one of the plurality of objects.

2. The apparatus of claim 1, wherein the step of estimating comprises:
a prediction step that is performed according to a Chapman-Kolmogorov equation; and
a filter step that is performed using Bayes' rule.

3. The apparatus of claim 2, wherein an emission time vector bk is at least one of (i) modelled as a full-correlated noise process and (ii) estimated by using a distance expression depending on an expectation value of bk, wherein bk comprises emission times bkj of each of the P objects at time step k, wherein jε{1, . . . , P}.

4. The apparatus of claim 2, wherein the filter step is performed in accordance with a measurement equation


yk={tilde over (h)}(xk,S,bk,ok,vk),


that, for any time step k, describes a relation between a message set yk, and wherein {tilde over (h)} is a function depending on:
an object position vector xk at time step k, comprising positions xkj of each of the P objects at time step k, wherein jε{1, . . . , P};
a sensor position vector S comprising positions Si of the N sensors, wherein iε{1, . . . , N};
the time offset vector ok;
a general noise vector vk comprising general noises vki,j at time step k.

5. The apparatus of claim 4, wherein the measurement equation is given by


yk=h(xk1, . . . ,xkP)+Hb·bk+Ho·ok+vk 



with



Hb=IP1N, Ho=1PIN.

6. The apparatus of claim 2, wherein the prediction step is performed in accordance with a model for describing the time evolution of states, the time is described by a series of discrete time steps kε{1, . . . , NΔT}, wherein for each of the time steps kε{1, . . . , NΔT} the state is given by a vector zk comprising:
the object position vector xk;
an object velocity vector {dot over (x)}k comprising the velocity of each of the objects;
the sensor offset vector ok;
a sensor drift vector {dot over (o)}k comprising the drift of each of the sensor offsets;

and wherein the model comprises a recursive system equation


zk+1=a(zk,wk),


wherein a is a function depending on the state at time step k and wk denotes a noise process over the time steps kε{1, . . . , NΔT}.

7. The apparatus of claim 6, wherein the function a is a linear, affine function, of the state zk and the noise wk.

8. The apparatus of claim 3, wherein the noise process is modelled as a Gaussian distributed process.

9. The apparatus of claim 2, wherein the prediction step is performed using the Kálmán predictor equations.

10. The apparatus of claim 6, wherein:
the receive times and the states are jointly Gaussian distributed; and
an estimated density of the states is described by an expectation value and a covariance.

11. The apparatus of claim 2, wherein a dependency for a component of a height of one of the plurality of objects is reduced by applying a rotation operator on coordinates of positions of the sensors.

12. The apparatus of claim 11, wherein dynamics in values for the j'th objects are reduced by subtracting a minimal value of the message set from each of the components of the measurement vector yk, and by adding, to the result thereof, an expected distance of the j'th object, where jε{1, . . . , P}.

13. The apparatus of claim 1, wherein
the N sensors are located at known positions (S1, . . . SN), respectively;
the transmitter devices in the objects are at unknown positions (xk1, . . . , xkP), respectively,
the transmitter device of each of the objects transmits signals at unknown times of transmissions;
the steps further comprising
providing a measurement equation for the P objects and the N sensors of






  
    
      
        
          
            y
            _
          
          k
        
        =
        
          
            
              1
              c
            
            ⁡
            
              [
              
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          1
                        
                        -
                        
                          
                            S
                            _
                          
                          1
                        
                      
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          1
                        
                        -
                        
                          
                            S
                            _
                          
                          N
                        
                      
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          P
                        
                        -
                        
                          
                            S
                            _
                          
                          1
                        
                      
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      
                      
                        
                          
                            x
                            _
                          
                          k
                          P
                        
                        -
                        
                          
                            S
                            _
                          
                          N
                        
                      
                      
                    
                  
                
              
              ]
            
          
          +
          
            
              [
              
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    ⋮
                  
                  
                    ⋮
                  
                  
                    ⋮
                  
                
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋱
                  
                  
                    
                      
                    
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
                
                  
                    ⋮
                  
                  
                    ⋮
                  
                  
                    ⋮
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
              
              ]
            
            ·
            
              [
              
                
                  
                    
                      b
                      k
                      1
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      b
                      k
                      P
                    
                  
                
              
              ]
            
          
          +
          
            
              [
              
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋱
                  
                  
                    
                      
                    
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋮
                  
                  
                    
                      
                    
                  
                
                
                  
                    1
                  
                  
                    0
                  
                  
                    ...
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋱
                  
                  
                    
                      
                    
                  
                
                
                  
                    0
                  
                  
                    ...
                  
                  
                    1
                  
                
              
              ]
            
            ·
            
              [
              
                
                  
                    
                      o
                      k
                      1
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      o
                      k
                      N
                    
                  
                
              
              ]
            
          
          +
          
            
              v
              _
            
            k
          
        
      
    
    
      
        
      
    
  




that, for any time step k, describes a relation between a message set yk, and wherein yk is depends on:
c, which is the propagation speed of the transmitted signals in the considered medium;
an object position vector xk at a time step k, comprising the positions xkj of each of the P objects at time step k;
a sensor position vector S comprising the positions Si of each of the N sensors, wherein ∥·∥ is the standard Euclidian norm;
the time offset vector ok, wherein ok=(ok1, . . . , okN);
a general noise vector vk comprising general noises vki,j at time step k, wherein each of the sensors is identified by an index i and each of the objects is identified by index j and the receive times are identified by the index yki,j;

wherein the numbers of N sensors and P objects fulfil the following condition:
N·P≧N+P·(D+1); and, where D is the considered dimension; and
wherein the transmission time vector is designated by bk comprising the transmission times bkj of each of the P objects at time step k;
the calculated object positions are identified by xk1, . . . , xxP.

14. The apparatus of claim 13, wherein transmission time vector bk is multiplied with a matrix Hb and the resulting term is modelled as a fully correlated noise process by using a distance expression depending on an expectation value of bk, where


Hb=IP1N, Ho=1PIN.

15. A method for multilateration of at least one of a plurality of P objects, each of the plurality of P objects having a transmitter device, and each of the transmitter devices being configured to transmit a respective signal, the method using a plurality of N sensors,
each sensor adapted to receive the transmitted signals from each of the objects and to determine respective receive times of each of the signals, the method comprising:
A. combining the receive times for the signals into a chronologically ordered series of message sets, wherein each of the message sets comprises the receive times of a single transmitted signal as determined by each sensor;
B. collecting all valid message sets that occur within a predetermined time interval ΔTk, wherein the index kε{1, . . . , NΔT} denotes a time step, and wherein a valid message set contains receive times from at least N sensors;
C. estimating a time offset vector ok comprising time offsets oki of the receive times of the N sensors at time step k and iε{1, . . . , N} by processing at least one of the message sets; and
D. outputting the position of said at least one of the plurality of objects.