- freely available
- re-usable
Sensors 2010, 10(7), 6406-6420; doi:10.3390/s100706406
Published: 29 June 2010
Abstract
: This paper is concerned with networked estimation, where sensor data are transmitted over a network of limited transmission rate. The transmission rate depends on the sampling periods and the quantization bit lengths. To investigate how the sampling periods and the quantization bit lengths affect the estimation performance, an equation to compute the estimation performance is provided. An algorithm is proposed to find sampling periods and quantization bit lengths combination, which gives good estimation performance while satisfying the transmission rate constraint. Through the numerical example, the proposed algorithm is verified.1. Introduction
Recently, networked monitoring systems are becoming increasingly popular, where sensor data are transmitted to a monitoring station through wired or wireless networks [1, 2]. In a monitoring station, estimation algorithms (such as a Kalman filter) are used to estimate the system states. A network between sensor nodes and a monitoring station can induce many problems such as time delays, packet dropouts, and limited bandwidth, where they depend on network types and scheduling methods. We note that the network issue (for example, what kinds of scheduling methods should be used?) itself is a big research area [3]. Also time delays and packet dropouts [4–7] are one of most important problems in networked estimation problems.
In this paper we focus on the case where there are many sensors and the network bandwidth is limited. For example, suppose there are three sensors (A,B,C) and 90 bytes/s can be transmitted over a network. How does one assign 90 bytes/s to each sensor? One method is to assign 30 bytes/s to each sensor. If sensor A monitors fast changing value and sensor B monitors slowly changing value, it might not be the best strategy: more data rate should be assigned to sensor A and the data rate of sensor B should be reduced. These issues are discussed quantitatively in this paper.
Note that the data rate of each sensor depends on the sampling frequency and the quantization bit length. For example, (100 Hz, 8 bit) case and (50 Hz, 16 bit) case have the same data rate (100 bytes/s). Thus given the same data rate, we have many possible combinations of the sampling frequencies and the quantization bit lengths. We first investigate how the sampling frequency and the quantization bit length affect the estimation performance and then propose a method to choose the sampling frequency and the quantization bit length of each sensor.
Using different sampling frequencies for different sensors is discussed in [10], where the sampling frequencies is chosen by minimizing the Kalman filter error covariance. In [11], the sampling frequency assignment algorithm is given, where a sampling frequency is chosen from a finite discrete set. In [12], a similar sampling frequency assignment is considered, where location of sensors and cost of measurement are also considered in the optimization problem. We note there are other attempts, where an event-based transmission method [8, 9] is used instead of a periodic transmission. In this paper, we assume that periodic sampling of sensor data.
Quantization is an extensively studied area [13]. Relating the estimation problem, a logarithm quantizer is proposed in [14]. Although theoretically appealing, the quantizer is applied to the innovation of a filter rather than to an output directly. The effect of quantization can be reduced by treating the quantization error as measurement noises as in [15]. In [16] and [17], quantization bit length assignment algorithms are proposed, where the bit length is computed by minimizing a performance index. The performance index is not directly related to estimation performance (e.g., the filter error covariance).
Simultaneous optimization of the sampling frequency and the quantization bit length has not been reported yet. In this paper, both parameters are selected so that the estimation performance is optimized given the transmission rate constraint.
The paper is organized as follows. In Section 2., estimation performance P is defined, which depends on the sampling periods and quantization bit lengths. In Section 3., a suboptimal algorithm to compute sampling period and quantization bit length combination is proposed. Through numerical examples, the proposed method is verified in Section 4. and conclusion is given in Section 5.
2. Problem Formulation
In this section, estimation performance is defined when the sampling frequency and the quantization bit length of each sensor are given. How to optimize the sampling frequency and the quantization bit length is discussed in Section 3.
Consider a linear time-invariant system given by
Let T_{i} be the sampling period of the i-th output and thus the corresponding sampling frequency is 1/T_{i}. We assume that T_{i} is an integer multiple of constant T: that is, T_{i} satisfies the following condition:
Let l_{i} be the quantization bit length of the i-th output. Let y_{max,i} be the absolute maximum value of the i-th output: that is,
Let q_{k} be the quantization error in y_{k}, then the following is satisfied
Now we are going to model (1) in the discrete time considering the sampling period T_{i} and the quantization length bit l_{i}. Assume M_{i} = 1 (1 ≤ i ≤ p) temporarily:
We treat the quantization error as an additional measurement noise as in (6), which is also considered in [15]. The quantization error q_{k} is assumed to be uncorrelated with w_{k} and υ_{k}. If the uniform distribution is assumed, the covariance is given by
Now the temporary assumption (M_{i} = 1) is removed. The second equation of (6) is no longer true and y_{k,i} is available if k is an integer multiple of M_{i}. Let ỹ_{k} be a collection of all available y_{k,i} at time k. To define ỹ_{k} in a more formal way, let {r_{k}_{,1}, r_{k}_{,2}, . . ., r_{k,pk}} be a set of all row numbers of available y_{k}. Then ỹ_{k} is given by
Similarly υ̃_{k} and q̃_{k} can be defined and C̃_{k} is defined as follows:
For example, if M_{1} = 1 and M_{2} = 2, then ỹ_{k} and C̃_{k} are given in Table 1. We can see that C̃_{k} is periodic with the period 2, which is the least common multiple of M_{1} = 1 and M_{2} = 2.
Generally C̃_{k} is periodic with the period M, where M is the least common multiple of {M_{1}, M_{2}, . . ., M_{p}}.
Using the first equation of (6) repeatedly b times, we have
It is known that a periodic system can be transformed into a time-invariant system [18, 19]. From (12) with a = kM and b = M, we have
Let x̄_{k}, w̄_{k} ȳ_{k}, ῡ_{k} and q̄_{k} be defined by
We will apply a Kalman filter to (16). Note that
It is standard to apply a Kalman filter to (16) using (17), (18) and (19): the measurement update and the time update equations are given as follows [20]:
measurement update
$\begin{array}{l}{K}_{k}\hspace{0.17em}=\hspace{0.17em}({P}_{k}^{-}\overline{C}\prime \hspace{0.17em}+\hspace{0.17em}\overline{M})\hspace{0.17em}(\overline{C}{P}_{k}^{-}\overline{C}\prime \hspace{0.17em}+\hspace{0.17em}\overline{R}\hspace{0.17em}+\hspace{0.17em}\overline{C}\overline{M}\\ \hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}+\hspace{0.17em}\overline{M}\prime \overline{C}\prime {)}^{-1}\end{array}$${P}_{k}\hspace{0.17em}=\hspace{0.17em}{P}_{k}^{-}\hspace{0.17em}-\hspace{0.17em}{K}_{k}\hspace{0.17em}(\overline{C}{P}_{k}^{-}\overline{C}\prime \hspace{0.17em}+\hspace{0.17em}\overline{R}\hspace{0.17em}+\hspace{0.17em}\overline{C}\overline{M}\hspace{0.17em}+\hspace{0.17em}\overline{M}\prime \overline{C}\prime ){K}_{k}^{\prime}$time update
${P}_{k+1}^{-}\hspace{0.17em}=\hspace{0.17em}\overline{A}{P}_{k}\overline{A}\prime \hspace{0.17em}+\hspace{0.17em}\overline{B}\overline{Q}\overline{B}\prime $
We will use P as an estimation performance, where P is the steady-state value of ${P}_{k}^{-}$:
If the sampling period T_{i} and the quantization bit length l_{i} are given, the corresponding estimation performance can be computed from (20).
3. T_{i} and l_{i} Optimization
In this section, a method to select the sampling period T_{i} and the quantization bit l_{i} are proposed. The main trade-off is between the transmission rate and the estimation performance.
The optimization problem can be formulated as follows:
Note that T_{i} = M_{i}T and P depends on M, which is the least common multiple of M_{1}, . . ., M_{p}. To make M constant, M_{i} is assumed to satisfy
If the number of combinations is small, P can be computed for all possible combinations. For a case that the number is too large, we propose a suboptimal algorithm. The proposed algorithm is based on the following lemma.
Lemma 1 Let P (m_{1}, l_{1}, . . ., m_{i}, l_{i}, . . ., m_{p}, l_{p}) be the solution to (20). With the assumption (23), the following is satisfied.
Proof: We will prove with a simple case with m_{1} = 0 m_{2} = 0, T = 1, M = 2, and p = 2: note that T_{1} = 2^{m1}T = T and T_{2} = 2^{m2}T = T. C̄ for m_{1} = 0 and m_{2} = 0 is given by
Now consider a case with m_{1} = 0 and m_{2} = 1 Instead of computing P(0, l_{1}, 1, l_{2}) using (20) with C̄_{m1=0,m2=1}, we can compute P(0, l_{1}, 1, l_{2}) using (20) with m_{1} = 0 and m_{2} = 0 except that R̄_{m1=0,m2=0} is replaced by R̄_{modified}, which is defined by
Proving the second inequality is more straightforward from the monotonicity of the Riccati equation [21] and from the fact
The third inequality (27) is just a combination of (25) and (26):
To explain Lemma 1, we consider a simple example with the following parameters:
There are 5 × 8 × 5 × 8 = 1, 600 possible combinations (see Figure 1). Using the result in Lemma 1, we know that P is the smallest when (m_{1}, l_{1}, m_{2}, l_{2}) = (0, 16, 0, 16) and the largest when (m_{1}, l_{1}, m_{2}, l_{2}) = (4, 9, 4, 9). On the other hand, the transmission rate S is the largest when (m_{1}, l_{1}, m_{2}, l_{2}) = (0, 16, 0, 16) and the smallest when (m_{1}, l_{1}, m_{2}, l_{2}) = (4, 9, 4, 9). Note that m_{i} − 1 and l_{i} + 1 in Lemma 1 corresponds to the upper and right combination of (m_{i}, l_{i}), respectively. Thus as we move the combination from the left-bottom corner toward the right-top corner, λ′P becomes smaller while the transmission rate increases.
In the proposed algorithm, we start from the left-bottom corner combination and move the combination toward the right-top corner combination while the transmission constrained is satisfied. The proposed algorithm is stated in pseudo-codes.
(m_{i}, l_{i}) = (m_{i,max}, l_{i,min}), i = 1, . . ., p
compute λ′P and S
(P denotes P(m_{1}, l_{1}, . . ., m_{p}, l_{p}) and S is from (22))
while (S < S_{max})
L = { }
for i = 1:p
if (m_{i} > m_{i,min})
L = L ∪ {(m_{1}, l_{1}, . . ., m_{i} − 1, l_{i}, . . ., m_{p}, l_{p})}
if (l_{i} < l_{i,max})
L = L ∪ {(m_{1}, l_{1}, . . ., m_{i}, l_{i} + 1, . . ., m_{p}, l_{p})}
end
for every element of L, compute G̃_{j}
${\tilde{G}}_{j}\hspace{0.17em}=\hspace{0.17em}\frac{\lambda \prime P\hspace{0.17em}-\hspace{0.17em}\lambda \prime {\tilde{P}}_{j}}{{\tilde{S}}_{j}\hspace{0.17em}-\hspace{0.17em}S}$where P̃_{j} = P for the j-th element of Land S̃_{j} = S for the j-th element of L
(m_{i,old}, l_{i,old}) = (m_{i}, l_{i}), i = 1, . . ., p
Find the maximum of G_{j} and choose the
corresponding combination as (m_{i}, l_{i})
compute λ′P and S
end
Choose the combination (m_{i,old}, l_{i,old})
Note that G̃_{j} represents the estimation performance improvement per transmission rate increase. For each given (m_{i}, l_{i}), we choose (m_{i} − 1, l_{i}) and (m_{i}, l_{i} + 1) for the next combination candidates. There are at most 2^{p} combinations. Among the combinations, we find a combination of which G̃_{j} is the largest. This process is continued until the current transmission rate exceeds S_{max}.
The number of combinations tested in the proposed algorithm is small compared with the brute force search. For example, the proposed algorithm starts with the top-right-most combination (m_{1}, l_{1}, m_{2}, l_{2}) = (0, 16, 0, 16) and moves toward bottom-left-most combination (m_{1}, l_{1}, m_{2}, l_{2}) = (4, 9, 4, 9) at each step until S ≤ S_{max} is no longer satisfied. Unfortunately, there is no guarantee that the solution found by the proposed method is near the optimal solution. In Section 4., it is shown, however, through a numerical example that the gap between the suboptimal and optimal solution is not large.
We note that the optimization algorithm is applied once when the networked system is designed. Once the sampling period T_{i} and quantization length l_{i} are determined, they are programmed in each sensor node. Thus no additional computation is needed in the sensor node.
4. Numerical Example
In this section, the proposed method is verified for the one dimensional attitude estimation problem. The state is defined by
The optimization problem (21) with S_{max} = 500 and λ = [1 0 0]′ is considered. λ is a natural choice since we want to estimate θ.
First the optimization problem is solved by a brute force search: all possible combinations are examined. The optimal solution is given by
Secondly the proposed suboptimal algorithm is used, where the solution is given by
To test whether the proposed λP is a good indicator of the estimation performance, the data is generated with Matlab and tested with a Kalman filter. The estimation performance is evaluated with the following:
It can be seen that the optimal solution predicted by λP nearly coincides with the real optimal solution. To see how similar λP and P_{experiment} are, λP and P_{experiment} are plotted for different (m_{1}, l_{1}, m_{2}, l_{2}) combinations. Since the parameter space is four dimensional, it is not easy to visualize the result. Thus we fix (m_{1}, l_{1}) = (2, 9) and plot λP and P_{experiment} for (m_{2}, l_{2}) combinations in Figures 2 and 3. The data marked with “o” satisfies S ≤ S_{max} and the data marked with “*” does not satisfy S ≤ S_{max}.
It can be seen that the trend of λP is almost similar to that of P_{experiment}. Thus λP can be used to predict the estimation performance given the sampling periods and the quantization bit lengths.
The transmission rate S is given in Figure 4. To see the trade-off between S and the estimation performance, S and λP are given for three (m_{1}, l_{1}, m_{2}, l_{2}) combinations in Table 2. We can see that when S decreases (that is, if we transmit less data), λP tends to increase (that is, the estimation performance degrades).
Finally, to test the efficiency of the proposed algorithm, we applied the proposed algorithm to 100 random models, where A is randomly generated and the same C as in the previous simulation is used. In the brute force method, 479 combinations are tested as in the previous simulation since the same setting is used. In the proposed algorithm, the number of combinations tested is between 13 and 21. That is, the number of combinations tested in the worst case is 21. Thus we can see the convergence rate is relatively fast. To see the accuracy of the proposed algorithm, the following value is computed:
5. Conclusions
In this paper, attitude estimation over a network with a transmission rate constraint is considered. The transmission rate depends on the sampling periods and the quantization bit lengths. Basically the problem is trade-off between the estimation performance and the transmission rate, where the parameters are the sampling period and the quantization bit length.
First, how the sampling period and the quantization bit length affect the estimation performance is investigated. To do this, we introduced an augmented system and defined the estimation performance P. Secondly, the trade-off problem is formulated as an optimization problem and a suboptimal algorithm is provided. Through numerical examples, we showed that the defined estimation performance matches the real estimation performance in the sense that graphs of P and the real estimation performance are similar. We also showed the proposed algorithm could find a reasonably good solution.
While defining P, we made assumption (23), which makes the derivation of P easier but not essential. Removing that assumption and obtaining a general result is a future work. Also to test an algorithm using a real network is a future work.
This work was supported by National Research Foundation of Korea Grant funded by the Korean Government (No. 2009-0067447).
References
- Zhao, F; Guibas, L. Wireless Sensor Networks; Elsevier: San Francisco, CA, USA, 2004. [Google Scholar]
- Choi, DH; Kim, DS. Wireless fieldbus for networked control systems using LR-WPAN. Int. J. Control Autom. Syst 2008, 6, 119–125. [Google Scholar]
- Wu, W; Arapostathis, A. Optimal sensor querying: General markovian and LQG models with controlled observations. IEEE Trans. Automat. Contr 2008, 53, 1392–1405. [Google Scholar]
- He, X; Wang, Z; Zhou, DH. Robust fault detection for networked systems with communication delay and data missing. Automatica 2009, 45, 2634–2639. [Google Scholar]
- Wei, G; Wang, Z; Shu, H. Robust filtering with stochastic nonlinearities and multiple missing measurements. Automatica 2009, 45, 836–841. [Google Scholar]
- Dong, H; Wang, Z; Gao, J. Robust H_{∞} Filtering for a class of nonlinear networked systems with multiple stochastic communication delays and packet dropouts. IEEE Trans. Signal Process 2010, 58, 1957–1966. [Google Scholar]
- Lee, I; Choi, S. Discrimination of visual and haptic rendering delays in networked environments. Int. J. Control Autom. Syst 2009, 7, 25–31. [Google Scholar]
- Miskowicz, M. Send-on-delta concept: An event-based data reporting strategy. Sensors 2006, 65, 49–63. [Google Scholar]
- Suh, YS; Nguyen, VH; Ro, YS. Modified Kalman filter for networked monitoring systems employing a send-on-delta method. Automatica 2007, 43, 332–338. [Google Scholar]
- Mehra, RK. Optimization of measurement schedules and sensor designs for linear dynamic systems. IEEE Trans. Automat. Contr 1976, 21, 55–64. [Google Scholar]
- Do, LMK; Suh, YS; Nguyen, VH. Networked Kalman filter with sensor transmission interval optimization. Proceedings of SICE-ICASE International Joint Conference, Busan, Korea, 18–21 October 2006; pp. 1047–1052.
- Kadu, SC; Bhushan, M; Gudi, R. Optimal sensor network design for multirate systems. J. Process Control 2008, 18, 594–609. [Google Scholar]
- Gersho, A; Gray, RM. Vector Quantization and Signal Compression; Kluwer Academic Publishers: Norwell, MA, USA, 1992. [Google Scholar]
- Elia, N; Mitter, SK. Stabilization of linear systems with limited information. IEEE Trans. Automat. Contr 2001, 46, 1384–1400. [Google Scholar]
- Luong-Van, D; Tordon, MJ; Katupitiya, J. Covariance profiling for an adaptive Kalman filter to suppress sensor quantization effects. Proceedings of the 43rd IEEE Conference on Decision and Control, Paradise Island, Bahamas, 14–17 December 2004; pp. 2680–2685.
- Sun, S; Lin, J; Xie, L; Xiao, W. Quantized Kalman filtering. Proceedings of 22nd IEEE International Symposium on Intelligent Control, Singapore, 26–28 September 2007; pp. 7–12.
- Wen, C; Tang, X; Ge, Q. Decentralized quantized Kalman filter with limited bandwidth. Proceedings of Second International Symposium on Intelligent Information Technology Application, Shanghai, China, 21–22 December 2008; pp. 291–295.
- Lee, DJ; Tomizuka, M. Multirate Optimal State Estimation with Sensor Fusion. Proceedings of the American Control Control Conference, Denver, CO, USA, 4–6 June 2003; pp. 2887–2892.
- Chen, T; Francis, B. Optimal Sampled-Data Control Systems; Springer-Verlag: Tokyo, Japan, 1995. [Google Scholar]
- Brown, RG; Hwang, PYC. Introduction to Random Signals and Applied Kalman Filtering; John Wiley & Sons: New York, NY, USA, 1997. [Google Scholar]
- Clements, DJ; Wimmer, HK. Monotonicity of the optimal cost in the discrete-time regulator problem and Schur complements. Automatica 2001, 37, 1779–1786. [Google Scholar]
Table 1. ỹ_{k} and C̃_{k} example (M_{1} = 1 and M_{2} = 2) |
k | 1 | 2 | 3 | 4 |
---|---|---|---|---|
ỹ_{k} | [y_{k,}_{1}] | $\left[\begin{array}{c}{y}_{k,1}\\ {y}_{k,2}\end{array}\right]$ | [y_{k,}_{1}] | $\left[\begin{array}{c}{y}_{k,1}\\ {y}_{k,2}\end{array}\right]$ |
C̃_{k} | [C_{1}] | $\left[\begin{array}{c}{C}_{1}\\ {C}_{2}\end{array}\right]$ | [C_{1}] | $\left[\begin{array}{c}{C}_{1}\\ {C}_{2}\end{array}\right]$ |
Table 2. S and λP comparison |
m_{1} | l_{1} | m_{2} | l_{2} | S | λP |
---|---|---|---|---|---|
0 | 16 | 0 | 16 | 3200 | 0.000080 |
2 | 12 | 2 | 12 | 600 | 0.000165 |
4 | 9 | 4 | 9 | 112.5 | 0.001282 |
© 2010 by the authors licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).