Search

ABSTRACT This paper is concerned with parameter estimate and adaptive control problems of deterministic autoregressive moving average (DARMA) systems on the basis of quantized data of system output signals which are generated by a kind of uniform quantizer. By designing system input signals, the extended least‐squares (ELS) algorithm with uniform output observations is proved to yield bounded estimation errors under some mild assumptions. Moreover, the adaptive tracking controller under inaccuracy observations is also designed. To analyse the properties of tracking error, we use the expanded form of the ELS and research the boundedness of quantization noise. In addition, we give the expression of tracking error and show how it depends on the size of quantization step when the quantization step satisfies some conditions. A numerical example is supplied to demonstrate the theoretical results. [ABSTRACT FROM AUTHOR]

The problem of state estimation of a linear, dynamical state-space system where the output is subject to quantization is challenging and important in different areas of research, such as control systems, communications, and power systems. There are a number of methods and algorithms to deal with this state estimation problem. However, there is no consensus in the control and estimation community on (1) which methods are more suitable for a particular application and why, and (2) how these methods compare in terms of accuracy, computational cost, and user friendliness. In this paper, we provide a comprehensive overview of the state-of-the-art algorithms to deal with state estimation subject to quantized measurements, and an exhaustive comparison among them. The comparison analysis is performed in terms of the accuracy of the state estimation, dimensionality issues, hyperparameter selection, user friendliness, and computational cost. We consider classical approaches and a new development in the literature to obtain the filtering and smoothing distributions of the state conditioned to quantized data. The classical approaches include the extended Kalman filter/smoother, the quantized Kalman filter/smoother, the unscented Kalman filter/smoother, and the sequential Monte Carlo sampling method, also called particle filter/smoother, with its most relevant variants. We also consider a new approach based on the Gaussian sum filter/smoother. Extensive numerical simulations—including a practical application—are presented in order to analyze the accuracy of the state estimation and the computational cost. [ABSTRACT FROM AUTHOR]

The problem of state estimation of a linear, dynamical state-space system where the output is subject to quantization is challenging and important in different areas of research, such as control systems, communications, and power systems. There are a number of methods and algorithms to deal with this state estimation problem. However, there is no consensus in the control and estimation community on (1) which methods are more suitable for a particular application and why, and (2) how these methods compare in terms of accuracy, computational cost, and user friendliness. In this paper, we provide a comprehensive overview of the state-of-the-art algorithms to deal with state estimation subject to quantized measurements, and an exhaustive comparison among them. The comparison analysis is performed in terms of the accuracy of the state estimation, dimensionality issues, hyperparameter selection, user friendliness, and computational cost. We consider classical approaches and a new development in the literature to obtain the filtering and smoothing distributions of the state conditioned to quantized data. The classical approaches include the extended Kalman filter/smoother, the quantized Kalman filter/smoother, the unscented Kalman filter/smoother, and the sequential Monte Carlo sampling method, also called particle filter/smoother, with its most relevant variants. We also consider a new approach based on the Gaussian sum filter/smoother. Extensive numerical simulations—including a practical application—are presented in order to analyze the accuracy of the state estimation and the computational cost.

Filtering and smoothing algorithms are key tools to develop decision-making strategies and parameter identification techniques in different areas of research, such as economics, financial data analysis, communications, and control systems. These algorithms are used to obtain an estimation of the system state based on the sequentially available noisy measurements of the system output. In a real-world system, the noisy measurements can suffer a significant loss of information due to (among others): (i) a reduced resolution of cost-effective sensors typically used in practice or (ii) a digitalization process for storing or transmitting the measurements through a communication channel using a minimum amount of resources. Thus, obtaining suitable state estimates in this context is essential. In this paper, Gaussian sum filtering and smoothing algorithms are developed in order to deal with noisy measurements that are also subject to quantization. In this approach, the probability mass function of the quantized output given the state is characterized by an integral equation. This integral was approximated by using a Gauss–Legendre quadrature; hence, a model with a Gaussian mixture structure was obtained. This model was used to develop filtering and smoothing algorithms. The benefits of this proposal, in terms of accuracy of the estimation and computational cost, are illustrated via numerical simulations.

In this paper we introduce a novel method for linear system identification with quantized output data. We model the impulse response as a zero-mean Gaussian process whose covariance (kernel) is given by the recently proposed stable spline kernel, which encodes information on regularity and exponential stability. This serves as a starting point to cast our system identification problem into a Bayesian framework. We employ Markov Chain Monte Carlo methods to provide an estimate of the system. In particular, we design two methods based on the so-called Gibbs sampler that allow also to estimate the kernel hyperparameters by marginal likelihood maximization via the expectation–maximization method. Numerical simulations show the effectiveness of the proposed scheme, as compared to the state-of-the-art kernel-based methods when these are employed in system identification with quantized data. [ABSTRACT FROM AUTHOR]

In this paper, we address the challenging problem of multiple source localization in wireless sensor networks (WSN). We develop an efficient statistical algorithm, based on the novel application of sequential Monte Carlo (SMC) sampler methodology, that is able to deal with an unknown number of sources given quantized data obtained at the fusion center from different sensors with imperfect wireless channels. We also derive the posterior Cramér–Rao bound (PCRB) of the source location estimate. The PCRB is used to analyze the accuracy of the proposed SMC sampler algorithm and the impact that quantization has on the accuracy of location estimates of the sources. Extensive experiments show the benefits of the proposed scheme in terms of the accuracy of the estimation method that is required for model selection (i.e., the number of sources) and the estimation of the source characteristics compared to the classical importance sampling method. [ABSTRACT FROM AUTHOR]

Distributed dynamic average consensus is investigated under quantized communication data. We use a uniform quantizer with constant quantization step-size to deal with the saturation caused by the dynamic consensus error and propose a communication feedback-based distributed consensus protocol suitable for directed time-varying topologies to make the internal state of each agent's encoder consistent with the output of its neighbors' decoder. For the case where the communication topology is directed, balanced and periodically connected, it is shown that if the difference of the reference inputs satisfies some boundedness condition, then the designed quantized dynamic consensus protocol can ensure the states of all the agents achieve dynamic average consensus with arbitrarily small steady state error by properly choosing system parameters. The lower bound of the required quantization levels and the method to choose the system parameters are also presented. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Abstract: This paper considers stochastic consensus problems over lossy wireless networks. We first propose a measurement model with a random link gain, additive noise, and Markovian lossy signal reception, which captures uncertain operational conditions of practical networks. For consensus seeking, we apply stochastic approximation and derive a Markovian mode dependent recursive algorithm. Mean square and almost sure (i.e., probability one) convergence analysis is developed via a state space decomposition approach when the coefficient matrix in the algorithm satisfies a zero row and column sum condition. Subsequently, we consider a model with arbitrary random switching and a common stochastic Lyapunov function technique is used to prove convergence. Finally, our method is applied to models with heterogeneous quantizers and packet losses, and convergence results are proved. [Copyright &y& Elsevier]

Abstract: The method of surrogate data is frequently used for a statistical examination of nonlinear properties underlying original data. If surrogate data sets are generated by a null hypothesis that the data are derived by a linear process, a rejection of the hypothesis means that the original data have more complex properties. However, we found that if an algorithm for generating surrogate data, for example, amplitude adjusted Fourier transformed, is applied to sparsely quantized data, there are large discrepancies between their power spectrum and that of the original data in lower frequency regions. We performed some simulations to confirm that these errors often lead to false rejections. In this paper, in order to prevent such drawbacks, we advance an extended hypothesis, and propose two improved algorithms for generating surrogate data that reduce the discrepancies of the power spectra. We also confirm the validity of the two improved algorithms with numerical simulations by showing that the extended null hypothesis can be rejected if the time series is produced from chaotic dynamical systems. Finally, we applied these algorithms for analyzing financial tick data as a real example; then we showed that the extended null hypothesis cannot be rejected because the nonlinear statistics or nonlinear prediction errors exhibited are the same as those of the original financial tick time series. [Copyright &y& Elsevier]

Filtering and smoothing algorithms are key tools to develop decision-making strategies and parameter identification techniques in different areas of research, such as economics, financial data analysis, communications, and control systems. These algorithms are used to obtain an estimation of the system state based on the sequentially available noisy measurements of the system output. In a real-world system, the noisy measurements can suffer a significant loss of information due to (among others): (i) a reduced resolution of cost-effective sensors typically used in practice or (ii) a digitalization process for storing or transmitting the measurements through a communication channel using a minimum amount of resources. Thus, obtaining suitable state estimates in this context is essential. In this paper, Gaussian sum filtering and smoothing algorithms are developed in order to deal with noisy measurements that are also subject to quantization. In this approach, the probability mass function of the quantized output given the state is characterized by an integral equation. This integral was approximated by using a Gauss–Legendre quadrature; hence, a model with a Gaussian mixture structure was obtained. This model was used to develop filtering and smoothing algorithms. The benefits of this proposal, in terms of accuracy of the estimation and computational cost, are illustrated via numerical simulations. [ABSTRACT FROM AUTHOR]

The effects of quantized data upon parameter estimation are investigated by re-examining a variety of simple and complicated risk models previously studied by the author. In spite of this unifying theme, no general principles arise, except for demonstrating that estimation in models with two or more parameters can lead to unpredictable results, with or without the introduction to discrete data. In fact, certain common actuarial models are shown always to have poor estimation properties, even using substantial amounts of continuous data The paper concludes with a plea for the redevelopment of classical models that are continuous in nature, rather than perpetuating the current discrete multi-parameter models, whose estimation properties are poor, since modem technology now permits inexpensive capture of all kinds of continuous data. [ABSTRACT FROM AUTHOR]