Distributed Asynchronous Fusion Algorithm for Sensor Networks with Packet Losses

Chu, Tianpeng; Qi, Guoqing; Li, Yinya; Sheng, Andong

doi:https://doi.org/10.1155/2014/957439

Discrete Dynamics in Nature and Society

On this page

Abstract Introduction Conclusion Acknowledgments References Copyright Related Articles

Special Issue

Filtering and Control for Unreliable Communication: The Discrete-Time Case

View this Special Issue

Research Article | Open Access

Volume 2014 | Article ID 957439 | https://doi.org/10.1155/2014/957439

Distributed Asynchronous Fusion Algorithm for Sensor Networks with Packet Losses

Tianpeng Chu,¹Guoqing Qi,¹Yinya Li,¹and Andong Sheng¹

Academic Editor: Lifeng Ma

Received20 Sept 2013

Revised03 Dec 2013

Accepted04 Dec 2013

Published09 Jan 2014

Abstract

This paper is concerned with the problem of distributed estimation fusion over peer-to-peer asynchronous sensor networks with random packet dropouts. A distributed asynchronous fusion algorithm is proposed via the covariance intersection method. First, local estimator is developed in an optimal batch fashion by constructing augmented measurement equations. Then the fusion estimator is designed to fuse local estimates in the neighborhood. Both local estimator and fusion estimator are developed by taking into account the random packet losses. The presented estimation method improves local estimates and reduces the estimate disagreement. Simulation results validate the effectiveness of the proposed distributed asynchronous fusion algorithm.

1. Introduction

Distributed fusion and estimation problem over peer-to-peer sensor networks has attracted significant interest in the research community, because of its variety of applications, such as environmental monitoring, surveillance, and target tracking, [1–10]. In these applications, every sensor in the network does not only take measurements in a parallel manner but also acquires information from neighbors and processes it to get an estimate. Compared with the centralized fusion fashion, the main advantage of distributed fusion estimation is the computation burden alleviation and robustness enhancement.

In general, two main approaches are presented in the literature to solve the distributed fusion and estimation problem. The first approach is the consensus approach. The consensus approach was proposed in [11, 12], where local measurements are exchanged among neighbors to get local estimates, and then by using average consensus algorithms among neighbors every sensor in the network gets the same estimate in steady-state. In order to obtain the same estimate at every sensor in the network, the consensus approach may iterate several times for each new measurement. This is highly undesired when estimating the state of dynamic systems where new measurements need to be processed in a timely manner. The second approach is the diffusion approach. The diffusion approach was presented in [13], in which the estimates of local filters are calculated individually at each sensor by using the data from the neighborhood, and then the local estimates from the neighborhood are fused locally by a convex combination. Therefore, the diffusion approach is well suited for estimating the state of dynamic systems where new measurements are being taken in real time. Though the adaptive weights for the diffusion algorithm were presented in [14], the estimation error covariance information is not taken into account. In [15, 16], the covariance intersection (CI) algorithm was proposed, in which the coefficients of convex combination of the estimates are chosen by considering the error covariance information. Therefore, the CI algorithm was used to design the adaptive weights for the diffusion algorithm in [17]. Though the aforementioned works solved the distributed fusion and estimation problem in their specific perspectives, they did not take into consideration the packet dropouts which are usually unavoidable in networks.

Many results on control and state estimation in networked systems context are already presented for the problem of both unreliable communication links and measurement uncertainties. The interested readers may refer to [18–23] and the references therein for further information. We will review only those works that are closely related to the state estimation in sensor networks with packet dropouts.

The problem of packet dropouts which are usually unavoidable in sensor networks has gained a lot of attention [24–27]. Schenato addressed a minimum error covariance estimator for sensor networks with random packets losses in [28]. The critical data arrival rate which ensures the stability of Kalman filter is investigated in [29]. An optimal filter is proposed based on the probability of the packet dropouts in [30]. Sun proposed optimal linear estimators in the sense of minimum variance with respect to the packet dropout probability in [31]. Ma and Sun proposed a centralized linear optimal fusion estimator in the minimum variance sense in [32]. Though the aforementioned literatures deal with the random packet losses problem, the sensor asynchronous problem is not taken into account.

Most of the aforementioned works are developed under the synchronous assumption. And the real-world systems may usually be asynchronous. In regard to asynchronous sensor fusion, a series of linear weighted fusion (LWF) algorithms for two and more than two asynchronous sensors with and without feedback had been proposed separately in [33–36]. By establishing state-space models at each sampling rate, a new fusion algorithm for asynchronous sensors had been presented in [37]. A minimum mean-squared error (MMSE) centralized asynchronous fusion algorithm had been presented in [38], which is suitable for arbitrary sensor number, sensor sampling rates, sensor initial sampling time instants, and fusion periods. By reconstructing the optimal centralized asynchronous fusion algorithm in [38], a so-called distributed asynchronous fusion algorithm is proposed in [39], which performs equivalently to the optimal centralized asynchronous fusion algorithm. Though the aforementioned works deal with the asynchronous sensor fusion problem, the random packet dropouts problem is not taken into account. Moreover, these works always need a fusion center to accomplish the estimation task.

Motivated by the above discussion, we consider the distributed estimation fusion problem for an asynchronous sensor network with random packet dropouts. The sensor network is considered to be a peer-to-peer network with no fusion center, and the communication channels of the sensor network are unreliable. The main contribution of our paper is the development of the distributed asynchronous fusion algorithm in a peer-to-peer sensor network with random packet dropouts. Our algorithm is developed as follows. Firstly, a Bernoulli random variable is employed to describe the random packet dropouts. Then, by constructing a local augmented measurement with the random packet dropouts under consideration, an asynchronous local estimator is obtained at each sensor to compute local estimate. Further, the fusion estimators at different sensors are presented by utilizing a weighted fusion criterion based on covariance intersection method, and the error covariance information of local estimates is used to compute the fusion weights. The main advantage of the proposed distributed asynchronous fusion algorithm is the practicality when dealing with a practical asynchronous sensor network with unreliable communication links.

The rest of the paper is organized as follows. In Section 2, the asynchronous distributed estimation problem is formulated. Then, design procedures for the asynchronous distributed fusion algorithm are presented in Section 3. The effectiveness of the proposed algorithm is demonstrated by a simulation example in Section 4. Finally, the conclusion is provided in Section 5.

2. Problem Formulation

Consider a continuous-time dynamic system described by the following linear stochastic differential equation: where and is zero-mean white Gaussian noise with covariance matrix . Suppose that is the corresponding state transition matrix of , is the time when the fusion center executed the last fusion operation or the initial time if , is the oncoming fusion time instant, and is the fusion interval. Then, by discretizing the continuous-time linear system (1), we have where is zero-mean white Gaussian noise with covariance matrix .

Observations of system (1) are obtained by a sensor network which deployed spatially. The sensor network which consists of distributed sensors is considered to be a peer-to-peer network. The interconnection topology of the sensor network is denoted by . indicates that sensor and sensor are connected, otherwise implies that sensor and sensor are not connected. No fusion center exists in the sensor network, and every sensor acts also as an estimator which collects information only from its neighbors to generate local estimates. The set of sensors connected to the certain sensor is called the neighborhood of sensor and it is denoted by . Without loss of generality, assume that and the number of neighbors of sensor is given by the number of elements of , written as .

Suppose that the number of measurements provided by sensor during the th time interval is . So observations during the th time interval of system (1) can be modeled as where and are measurement matrix and zero-mean white Gaussian measurement noise with covariance matrix , respectively. corresponds to the th measurement of sensor during time interval . The set of measurements obtained by sensor during time interval is denoted by . Assume that , , and are mutually independent.

We also assume that the sensors in the network are time synchronized and time driven; therefore the sensors can easily obtain the time stamp through the digital communication network. The observations are exchanged between neighboring sensors once in every fusion interval. The packet-dropping process at every communication links is modeled as independent identically distributed (i.i.d.) Bernoulli random process. We use Bernoulli random variable (for all ) to indicate whether a packet is successfully transmitted from sensor to sensor at th time instant. If , the packet is successfully transmitted, otherwise, and the packet is dropped. Without loss of generality, it is assumed that .

The th measurement sensor got from sensor during time interval can be written as where is the packet arriving probability (PAP) and is the packet loss probability (PLP) [17].

3. Distributed Asynchronous Fusion Algorithm

3.1. Local Asynchronous Estimator

Without loss of generality, it is assumed that sensors in totally obtain a set of asynchronous measurements during the th time interval. Measurement is provided by sensor at time instant . After sensor collects all asynchronous measurements which are provided by sensors in , it reorders these measurements in time sequence. Suppose the th measurement at sensor during the th time interval which is denoted by corresponds to , then we have

As mentioned before, we can obtain the time stamp of current measurement easily. The packet is successfully transmitted, if the time stamp of the latest measurement is in the present fusion interval, that is, , otherwise . We can simplify the measurement as where , , and .

The state can be written by using (2) as where is the backward state transition matrix.

By using (6) and (7), can be rewritten as where , , and .

By denoting where , are identity matrices with proper dimensions.

We can get an augmented measurement equation at sensor as

From (2), (3), (6), and (8) we have

Suppose ; then Thus, the augmented measurement noise is zero-mean white Gaussian noise with covariance:where

From (2), (8), and (11), we have Further we have where .

It can be observed from (19) that the discrete-time process noise and the augmented measurement noise are cross correlated; this correlation comes from the common continuous-time process noise [40].

For sensor , the asynchronous local estimation problem in is converted to an estimation problem of the following system: where , , and .

Thus a local asynchronous estimation method is summarized in Theorem 1 in an optimal batch asynchronous data fusion fashion [38].

Theorem 1 (local asynchronous estimator). For sensor , after it gets asynchronous measurements from sensors in , the local asynchronous estimator at sensor is summarized as follow: given the local state estimate of system (1) and its error covariance matrix at time , the local estimate and its error covariance matrix at time are given by where and are the state estimate and one-step predicted estimate, respectively, and are the covariance matrices of filtering error and one-step prediction error, respectively, and the initial values of and are given, respectively, by and , where is a normally distributed random variable with mean equal to the initial truth ground of the state and covariance .

Proof. For neighborhood , the local asynchronous estimation problem at sensor is converted to the state estimation problem of system (20). This is a classical filtering problem with noise cross-covariance which can be solved by using the Kalman filter [40] for correlated process and measurement noises.

Remark 2. The random packets losses have been taken into account in Theorem 1. And in Theorem 1 each sensor in the sensor network generates a local estimate at the fusion time instant by using measurements only from its neighbors. These local estimates are suboptimal in the sense that not all the measurements in the sensor network are used. Therefore, a fusion criterion, which will improve each local estimation performance, weighted by matrices will be developed later in this paper. The main results will be presented in the following subsection.

3.2. CI-Based Fusion Estimator

In this subsection, a fusion criterion weighted by matrices is developed to generate fusion estimate at every sensor, and it takes into consideration the random packets dropouts. The criterion is first given in the following lemma in [16].

Lemma 3. Let denote unbiased estimates for the unknown state vector and let denote the corresponding estimated covariance matrices; the CI fusion estimator is given by the following convex combination: where and hold.

When local estimates calculated by the local estimators in Theorem 1 are available at the sensors in the sensor network, sensor collects them from its neighborhood to generate a fused estimate according to the fusion rule based on covariance intersection. For the packet-dropping process, it is also modeled as i.i.d. Bernoulli random process. Denote (for all ) as the packet transmit indicator. It is also assumed that .

Theorem 4 (CI-based fusion estimator). By gathering the local estimates provided by the sensors in neighborhood , the distributed weighted fusion filter at sensor is given by where are subject to , .

Proof. Theorem 4 follows directly from Lemma 3.

Remark 5. Different choices of can be used to optimize the update with respect to different performance criteria, such as minimizing the trace or determinant of . However such optimization is nonlinear and a high computation load is required for computing the optimal [41]. Thus, several fast CI algorithms that produce suboptimal solutions have been proposed in terms of trace or determinant minimization [41, 42]. In what follows, we choose to minimize the trace of . For sensor , a suboptimal noniterative weighting coefficients solution for fast CI fusion is given by

For clarity, the asynchronous distributed fusion algorithm is summarized in Algorithm 1.

(1) Initialization: , .
(2) Obtain local measurements .
(3) Broadcast message to neighbors.
(4) Receive messages , , from neighbors.
(5) Compute , , , and by using (9)–(19).
(6) Calculate the local estimate by using Theorem 1.
(7) Broadcast message to neighbors.
(8) Receive messages , , from neighbors.
(9) Calculate the fusion estimate by using Theorem 4 and (25).

Remark 6. In the distributed asynchronous fusion filter presented in Algorithm 1, each sensor in sensor network broadcasts its local measurement information and local estimate to its neighboring sensors; for every sensor, more information from different sensors, not only the neighboring ones, will be utilized to generate the fusion estimates, which helps improve the local estimate performance and reduce the disagreement of local estimates. Further, not all target information in the sensor network is used to generate the fusion estimate at one sensor; meanwhile the method we used to compute coefficient is suboptimal; therefore the fusion estimate is a suboptimal estimate, but it is an improved one compared with the local one.

4. Simulation

In this section, the effectiveness of the proposed estimator design method is demonstrated by presenting simulations of a target tracking system. Consider the following continuous-time dynamic system: where and is zero-mean white Gaussian noise with variance ; by discretizing the continuous-time linear system (26), we have where the process noise is a white Gaussian noise sequence with zero mean and covariance

The state of system (27) is observed by a sensor network with 12 sensor nodes, and the topology of the sensor network is shown in Figure 3. The observation equations of the sensors are given by (3) with measurement matrices , and ; measurement noise variances , and ; and sampling periods , , and , respectively. The fusion operation is performed with period (i.e., ) and initial time instant .

For performance comparison, root mean square errors (RMSE) of position and velocity given by [40] are used, where is the Monte-Carlo simulation times, is the ground truth of the th component of the state vector in the th run, and is the corresponding estimate; the disagreement potential of the estimates in the neighborhood is defined as where is the estimate of sensor at time instant , is the corresponding error covariance, and the simulation ends after 20 seconds.

We present the simulation results without packet losses firstly. As shown in Figure 1, sensors 2 and 12 are directly connected to sensor 4, thus neighborhood consists of sensors 2, 4, and 12, with sampling periods and , respectively. We take estimate performance of sensors in neighborhood to testify the effectiveness of the proposed algorithm. At each fusion instant , local estimate at sensor 4 is generated by collecting measurements from itself and sensors 2 and 12, and then sensor 4 collects local estimates from itself and sensors 2 and 12 to form fused estimates by using Theorem 4 and (25). Since trends of the simulation results are the same for both components, only the first component of the state vector is shown and analyzed below, and the simulation results of the proposed algorithm are compared with the optimal linear minimum mean-squared error centralized asynchronous fusion algorithm in [22].

Figure 2 compares estimate performance of the proposed local asynchronous estimator and fusion estimator with the centralized asynchronous fusion estimator proposed in [22]. Although the performance of local estimator and fusion estimator is close to the centralized one, the centralized asynchronous fusion algorithm outperforms them both. This verifies our conclusion that the proposed local asynchronous estimator and fusion estimator are suboptimal as we stated in Remarks 2 and 6.

Figure 3 compares the performance of the proposed local asynchronous estimator and fusion estimator. It can be observed that the RMSE of fusion estimates is smaller than that of the corresponding local estimates; this verifies that the fusion estimates improve the performance of local estimates.

Figure 4 compares the disagreement of estimates obtained by the proposed local asynchronous estimator and fusion estimator; the fusion estimator gains smaller disagreement potential than the corresponding local one. This verifies our conclusion that fusion estimator reduces the disagreement among different sensors.

Figures 5 and 6 shows the filtering performances of the sensors in with different PLPs. It can be observed that packet dropout degrades estimation performance. The fusion estimator performance still outperforms local estimator and both estimators RMSEs converge. This demonstrates the effectiveness of the proposed distributed asynchronous fusion algorithm.

5. Conclusion

A CI-based distributed asynchronous fusion algorithm has been proposed for decentralized asynchronous sensor networks with random packet dropouts in this paper. The proposed distributed asynchronous fusion algorithm is applicable to decentralized asynchronous sensor networks; it is capable of improving estimates and reducing disagreement in comparison with the local ones; meanwhile it is also able to deal with random packet losses. The simulation results demonstrate the effectiveness of the proposed distributed asynchronous fusion algorithm.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (no. 61104186 and no. 61273076) and the Natural Science Foundation of Jiangsu Province (no. BK2012801).

References

C. Chong, S. Mori, and K. Chang, “Adaptive distributed estimation,” in Proceedings of the IEEE Conference on Decision Control,, vol. 26, pp. 2233–2238, 1987.
View at: Google Scholar
K. C. Chang, R. K. Saha, and Y. Bar-Shalom, “On optimal track-to-track fusion,” IEEE Transactions on Aerospace and Electronic Systems, vol. 33, no. 4, pp. 1271–1276, 1997.
View at: Publisher Site | Google Scholar
X. Li, K. Zhang, J. Zhao, and Y. Zhu, “Optimal linear estimation fusion—part V: relationships,” in Proceedings of the 5th International Conference on Information Fusion, pp. 497–504, 2002.
View at: Google Scholar
S. Mori, W. H. Barker, C.-Y. Chong, and K.-C. Chang, “Track association and track fusion with nondeterministic target dynamics,” IEEE Transactions on Aerospace and Electronic Systems, vol. 38, no. 2, pp. 659–668, 2002.
View at: Publisher Site | Google Scholar
Y. Zhu, E. Song, J. Zhou, and Z. You, “Optimal dimensionality reduction of sensor data in multisensor estimation fusion,” IEEE Transactions on Signal Processing, vol. 53, no. 5, pp. 1631–1639, 2005.
View at: Publisher Site | Google Scholar | MathSciNet
S. Marano, V. Matta, and P. Willett, “Distributed estimation in large wireless sensor networks via a locally optimum approach,” IEEE Transactions on Signal Processing, vol. 56, no. 2, pp. 748–756, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
I. D. Schizas, G. B. Giannakis, and Z.-Q. Luo, “Distributed estimation using reduced-dimensionality sensor observations,” IEEE Transactions on Signal Processing, vol. 55, no. 8, pp. 4284–4299, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
F. S. Cattivelli, C. G. Lopes, and A. H. Sayed, “Diffusion recursive least-squares for distributed estimation over adaptive networks,” IEEE Transactions on Signal Processing, vol. 56, no. 5, pp. 1865–1877, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
R. Carli, A. Chiuso, L. Schenato, and S. Zampieri, “Distributed Kalman filtering based on consensus strategies,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 4, pp. 622–633, 2008.
View at: Publisher Site | Google Scholar
S. Kar and J. M. F. Moura, “Gossip and distributed Kalman filtering: weak consensus under weak detectability,” IEEE Transactions on Signal Processing, vol. 59, no. 4, pp. 1766–1784, 2011.
View at: Publisher Site | Google Scholar | MathSciNet
R. Olfati-Saber, “Distributed Kalman filtering for sensor networks,” in Proceedings of the 46th IEEE Conference on Decision and Control (CDC '07), pp. 5492–5498, December 2007.
View at: Publisher Site | Google Scholar
R. Olfati-Saber, “Distributed Kalman filter with embedded consensus filters,” in Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference (CDC-ECC '05), pp. 8179–8184, December 2005.
View at: Publisher Site | Google Scholar
F. S. Cattivelli and A. H. Sayed, “Diffusion strategies for distributed Kalman filtering and smoothing,” IEEE Transactions on Automatic Control, vol. 55, no. 9, pp. 2069–2084, 2010.
View at: Publisher Site | Google Scholar | MathSciNet
F. Cattivelli and A. H. Sayed, “Diffusion distributed Kalman filtering with adaptive weights,” in Proceedings of the 43rd Asilomar Conference on Signals, Systems and Computers, pp. 908–912, November 2009.
View at: Publisher Site | Google Scholar
S. J. Julier and J. K. Uhlmann, “Non-divergent estimation algorithm in the presence of unknown correlations,” in Proceedings of the American Control Conference, vol. 4, pp. 2369–2373, June 1997.
View at: Google Scholar
S. Julier and J. Uhlmann, General Decentralized Data Fusion with Covariance Intersection, Handbook of Multisensor Data Fusion, 2001.
J. Hu, L. Xie, and C. Zhang, “Diffusion Kalman filtering based on covariance intersection,” IEEE Transactions on Signal Processing, vol. 60, no. 2, pp. 891–902, 2012.
View at: Publisher Site | Google Scholar | MathSciNet
H. Dong, Z. Wang, and H. Gao, “Distributed H_∞ filtering for a class of Markovian jump nonlinear time-delay systems over lossy sensor networks,” IEEE Transactions on Industrial Electronics, vol. 60, no. 10, pp. 4665–4672, 2013.
View at: Google Scholar
L. Ma, Z. Wang, Y. Bo, and Z. Guo, “Robust $H_{\infty}$ sliding mode control for nonlinear stochastic systems with multiple data packet losses,” International Journal of Robust and Nonlinear Control, vol. 22, no. 5, pp. 473–491, 2012.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
L. Ma, Z. Wang, Y. Bo, and Z. Guo, “Finite-horizon $H_{2} / H_{\infty}$ control for a class of nonlinear Markovian jump systems with probabilistic sensor failures,” International Journal of Control, vol. 84, no. 11, pp. 1847–1857, 2011.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
D. Ding, Z. Wang, H. Dong, and H. Shu, “Distributed $H_{\infty}$ state estimation with stochastic parameters and nonlinearities through sensor networks: the finite-horizon case,” Automatica, vol. 48, no. 8, pp. 1575–1585, 2012.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
H. Dong, Z. Wang, and H. Gao, “Distributed $H_{\infty}$ filtering for a class of Markovian jump nonlinear time-delay systems over lossy sensor networks,” IEEE Transactions on Industrial Electronics, vol. 60, no. 10, pp. 4665–4672, 2013.
View at: Google Scholar
H. Dong, Z. Wang, and H. Gao, “Distributed filtering for a class of time-varying systems over sensor networks with quantization errors and successive packet dropouts,” IEEE Transactions on Signal Processing, vol. 60, no. 6, pp. 3164–3173, 2012.
View at: Publisher Site | Google Scholar | MathSciNet
N. E. Nahi, “Optimal recursive estimation with uncertain observation,” IEEE Transactions on Information Theory, vol. 15, no. 4, pp. 457–462, 1969.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
S. Kar, B. Sinopoli, and J. M. F. Moura, “Kalman filtering with intermittent observations: weak convergence to a stationary distribution,” IEEE Transactions on Automatic Control, vol. 57, no. 2, pp. 405–420, 2012.
View at: Publisher Site | Google Scholar | MathSciNet
S. Nakamori, R. Caballero-Águila, A. Hermoso-Carazo, and J. Linares-Pérez, “Linear recursive discrete-time estimators using covariance information under uncertain observations,” Signal Processing, vol. 83, no. 7, pp. 1553–1559, 2003.
View at: Publisher Site | Google Scholar
Z. Wang, D. W. C. Ho, and X. Liu, “Robust filtering under randomly varying sensor delay with variance constraints,” IEEE Transactions on Circuits and Systems, vol. 51, no. 6, pp. 320–326, 2004.
View at: Publisher Site | Google Scholar
L. Schenato, “Optimal estimation in networked control systems subject to random delay and packet loss,” in Proceedings of the 45th IEEE Conference on Decision and Control (CDC '06), pp. 5615–5620, December 2006.
View at: Google Scholar
B. Sinopoli, L. Schenato, M. Franceschetti, K. Poolla, M. I. Jordan, and S. S. Sastry, “Kalman filtering with intermittent observations,” IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1453–1464, 2004.
View at: Publisher Site | Google Scholar | MathSciNet
M. Sahebsara, T. Chen, and S. L. Shah, “Optimal $H_{2}$ filtering with random sensor delay, multiple packet dropout and uncertain observations,” International Journal of Control, vol. 80, no. 2, pp. 292–301, 2007.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
S. L. Sun, “Optimal linear estimation for networked systems with one-step random delays and multiple packet dropouts,” Acta Automatica Sinica, vol. 38, no. 3, pp. 349–356, 2012.
View at: Publisher Site | Google Scholar | MathSciNet
J. Ma and S. Sun, “Centralized fusion estimators for multisensor systems with random sensor delays, multiple packet dropouts and uncertain observations,” IEEE Transactions on Signal Processing, vol. 13, no. 4, 2013.
View at: Google Scholar
A. T. Alouani and T. R. Rice, “On optimal asynchronous track fusion,” in Proceedings of the 1st Austalian Data Fusion Symposium, pp. 147–152, November 1996.
View at: Google Scholar
A. T. Alouani and T. R. Rice, “Asynchronous fusion of correlated tracks,” in Acquisition, Tracking and Pointing XII, Proceedings of SPIE, pp. 113–118, April 1998.
View at: Publisher Site | Google Scholar
G. A. Watson, T. R. Rice, and A. T. Alouani, “Optimal track fusion with feedback for multiple asynchronous measurements,” in Aquisition, Tracking, and Pointing XIV, Proceedings of SPIE, pp. 20–33, April 2000.
View at: Google Scholar
A. T. Alouani, J. E. Gray, and D. H. McCabe, “Theory of distributed estimation using multiple asynchronous sensors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 41, no. 2, pp. 717–722, 2005.
View at: Publisher Site | Google Scholar
L. P. Yan, B. S. Liu, and D. H. Zhou, “Asynchronous multirate multisensor information fusion algorithm,” IEEE Transactions on Aerospace and Electronic Systems, vol. 43, no. 3, pp. 1135–1146, 2007.
View at: Publisher Site | Google Scholar
H. Yanyan, D. Zhansheng, and H. Chongzhao, “Optimal batch asynchronous fusion algorithm,” in Proceedings of the IEEE International Conference on Vehicular Electronics and Safety, pp. 237–240, October 2005.
View at: Publisher Site | Google Scholar
Y. Hu, Z. Duan, and D. Zhou, “Estimation fusion with general asynchronous multi-rate sensors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 46, no. 4, pp. 2090–2102, 2010.
View at: Publisher Site | Google Scholar
D. Simon, Optimal State Estimation: Kalman, H_∞, and Nonlinear Approaches, Wiley-Interscience, Hoboken, NJ, USA, 2006.
P. O. Arambel, C. Rago, and R. K. Mehra, “Covariance intersection algorithm for distributed spacecraft state estimation,” in Proceedings of the American Control Conference, pp. 4398–4403, June 2001.
View at: Google Scholar
Y. Wang and X. R. Li, “A fast and fault-tolerant convex combination fusion algorithm under unknown cross-correlation,” in Proceedings of the 12th International Conference on Information Fusion (FUSION '09), pp. 571–578, July 2009.
View at: Google Scholar

Copyright

Copyright © 2014 Tianpeng Chu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1178

Downloads

1204

Citations