System identification: theory for the user
System identification: theory for the user
Identification and stochastic adaptive control
Identification and stochastic adaptive control
Information-based complexity and nonparametric worst-case system identification
Journal of Complexity - Special issue: invited articles dedicated to J. F. Traub on the occasion of his 60th birthday
Modern Control Engineering
Asymptotically efficient parameter estimation using quantized output observations
Automatica (Journal of IFAC)
Joint state and event observers for linear switching systems under irregular sampling
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Algorithms for system identification, estimation, and adaptive control in stochastic systems rely mostly on different types of signal averaging to achieve uncertainty reduction, convergence, stability, and performance enhancement. The core of such algorithms is various types of laws of large numbers that reduce the effect of noises when they are averaged. Many of the noise sequences encountered are often correlated and nonwhite. In the case of state estimation using quantized information such as in networked systems, convergence must be analyzed on double-indexed and randomly weighted sums of mixing-type stochastic processes, which are correlated with the remote past and distant future being asymptotically independent. This paper presents new results on convergence analysis of such processes. Strong laws of large numbers and convergence rates for such problems are established. These results resolve some fundamental issues in state observer designs with random sampling times, quantized information processing, and other applications.