Search

This paper studies identification of linear systems with binary-valued observations generated via fixed thresholds. In addition to stochastic measurement noises, the systems are also subject to structural uncertainties, including deterministic unmodelled dynamics, nonlinear model mismatch, and sensor observation bias. Since binary-valued observations can supply only limited information on the signals, truncated empirical measures are introduced to extract further information for system identification. An effective identification algorithm is constructed based on the proposed empirical measures. Optimal identification errors, time complexity, optimal input design, and impact of disturbances, unmodelled dynamics, observation bias, and nonlinear model mismatch are thoroughly investigated in a stochastic information framework. Asymptotic upper and lower bounds are established on identification errors. Numerical experiments are presented to demonstrate the effectiveness of the algorithms and the main results. [ABSTRACT FROM PUBLISHER]

This work is devoted to analyzing adaptive filtering algorithms with the use of sign-regressor for randomly time-varying parameters (a discrete-time Markov chain). In accordance with different adaption and transition rates, we analyze the corresponding asymptotic properties of the algorithms. When the adaptation rate is in line with the transition rate, we obtain a limit of a Markov switched differential equation. When the Markov chain is slowly changing the parameter process is almost a constant, and we derive a limit differential equation. When the Markov chain is fast varying, the limit system is again a differential equation that is an average with respect to the stationary distribution of the Markov chain. In addition to the limit dynamic systems, we obtain asymptotic properties of centered and scaled tracking errors. We obtain mean square errors to illustrate the dependence on the stepsize as well as on the transition rate. The limit distributions in terms of scaled errors are studied by examining certain centered and scaled error sequences. [ABSTRACT FROM AUTHOR]

Reliability of battery diagnosis depends on accurate estimation of the state of charge (SOC) and battery characterizing parameters including maximum capacity, internal impedance, polarization coefficients, and their probabilistic characterizations. This paper develops a framework that employs real-time operating data to estimate jointly the SOC and parameters, performs statistical analysis to derive quantitative diagnostic procedures with error analysis. Convergence of the algorithms, asymptotic distributions, and diagnosis reliability analysis are performed rigorously by using stochastic differential equations, central limit theorems, and large deviations principles. Simulated case studies and experimental data are used to illustrate the diagnosis algorithms and their capabilities. Experimental studies are conducted to verify the results. [ABSTRACT FROM PUBLISHER]

Establishing real-time models for electric motors is important when capturing authentic dynamic behavior of the motors to improve control performance, enhance robustness, and support diagnosis. Quantized sensors are less expensive, and remotely controlled motors mandate signal quantization. Such limitations on observations introduce challenging issues in motor parameter estimation. This paper develops estimators for model parameters of permanent-magnet direct current (PMDC) motors using quantized speed measurements. A typical linearized model structure of PMDC motors is used as a benchmark platform to demonstrate the technology and its key properties and benefits. Convergence properties are established. Simulations and experimental studies are performed to illustrate potential applications of the technology. [ABSTRACT FROM AUTHOR]

Accurate estimation of the state of charge in battery systems is of essential importance for battery system management. Due to nonlinearity, high sensitivity of the inverse mapping from external measurements, and measurement errors, SOC estimation has remained a challenging task. This is further compounded by the fact that battery characteristic model parameters change with time and operating conditions. This paper introduces an adaptive nonlinear observer design that compensates nonlinearity and achieves better estimation accuracy. A two-time-scale signal processing method is employed to attenuate the effects of measurement noises on SOC estimates. The results are further expanded to derive an integrated algorithm to identify model parameters and initial SOC jointly. Simulations were performed to illustrate the capability and utility of the algorithms. Experimental verifications are conducted on Li-ion battery packs of different capacities under different load profiles. [ABSTRACT FROM AUTHOR]

Renewable energy generation, vehicle electrification, and smart grids rely critically on energy storage devices for enhancement of operations, reliability, and efficiency. Battery systems consist of many battery cells, which have different characteristics even when they are new, and change with time and operating conditions due to a variety of factors such as aging, operational conditions, and chemical property variations. Their effective management requires high fidelity models. This paper aims to develop identification algorithms that capture individualized characteristics of each battery cell and produce updated models in real time. It is shown that typical battery models may not be identifiable, unique battery model features require modified input/output expressions, and standard least-squares methods will encounter identification bias. This paper devises modified model structures and identification algorithms to resolve these issues. System identifiability, algorithm convergence, identification bias, and bias correction mechanisms are rigorously established. A typical battery model structure is used to illustrate utilities of the methods. [ABSTRACT FROM PUBLISHER]

Abstract: This work is concerned with identification of Wiener systems whose outputs are measured by binary-valued sensors. The system consists of a linear FIR (finite impulse response) subsystem of known order, followed by a nonlinear function with a known parametrization structure. The parameters of both linear and nonlinear parts are unknown. Input design, identification algorithms, and their essential properties are presented under the assumptions that the distribution function of the noise is known and the nonlinearity is continuous and invertible. It is shown that under scaled periodic inputs, identification of Wiener systems can be decomposed into a finite number of core identification problems. The concept of joint identifiability of the core problem is introduced to capture the essential conditions under which the Wiener system can be identified with binary-valued observations. Under scaled full-rank conditions and joint identifiability, a strongly convergent algorithm is constructed. The algorithm is shown to be asymptotically efficient for the core identification problem, hence achieving asymptotic optimality in its convergence rate. For computational simplicity, recursive algorithms are also developed. [Copyright &y& Elsevier]

Abstract: This paper studies identification of systems in which only quantized output observations are available. An identification algorithm for system gains is introduced that employs empirical measures from multiple sensor thresholds and optimizes their convex combinations. Strong convergence of the algorithm is first derived. The algorithm is then extended to a scenario of system identification with communication constraints, in which the sensor output is transmitted through a noisy communication channel and observed after transmission. The main results of this paper demonstrate that these algorithms achieve the Cramér–Rao lower bounds asymptotically, and hence are asymptotically efficient algorithms. Furthermore, under some mild regularity conditions, these optimal algorithms achieve error bounds that approach optimal error bounds of linear sensors when the number of thresholds becomes large. These results are further extended to finite impulse response and rational transfer function models when the inputs are designed to be periodic and full rank. [Copyright &y& Elsevier]

This paper considers the problem of identifiability and parameter estimation of single-input–single-output, linear, time-invariant, stable, continuous-time systems under irregular and random sampling schemes. Conditions for system identifiability are established under inputs of exponential polynomial types and a tight bound on sampling density. Identification algorithms of Gauss–Newton iterative types are developed to generate convergent estimates. When the sampled output is corrupted by observation noises, input design, sampling times, and convergent algorithms are intertwined. Persistent excitation (PE) conditions for strongly convergent algorithms are derived. Unlike the traditional identification, the PE conditions under irregular and random sampling involve both sampling times and input values. Under the given PE conditions, iterative and recursive algorithms are developed to estimate the original continuous-time system parameters. The corresponding convergence results are obtained. Several simulation examples are provided to verify the theoretical results. [ABSTRACT FROM AUTHOR]