Learning Tracking Control Over Unknown Fading Channels Without System Information

Iterative learning control for differential inclusion systems with random fading channels by varying average technique

The aim of this paper is to study iterative learning control for differential inclusion systems with random fading channels between the plant and the controller. In reality, the phenomenon of fading will inevitably occur in network transmission, which will greatly affect the tracking ability of output trajectory. This study discusses the impact of fading channel on tracking performance at the input and output sides, respectively. First, a set-valued mapping in a differential inclusion system with uncertainty is converted into a single-valued mapping by means of a Steiner-type selector. Then, to offset the effect of the fading channel and improve the tracking ability, a variable local average operator is constructed. The convergence of the learning control algorithm designed by the average operator is proved. The results show that the parameters in the varying local average operator can be adjusted to trade-off between the learning rate and the fading offset rate. Finally, the theoretical results are verified by numerical simulation of the switched reluctance motors.

Q-learning based fault estimation and fault tolerant iterative learning control for MIMO systems

This paper proposes a Q-learning based fault estimation (FE) and fault tolerant control (FTC) scheme under iterative learning control (ILC) framework. Due to the repetitive demands on control actuators for repetitive tasks, ILC is sensitive to actuator faults. Moreover, unknown faults varying with both time and trial axes pose a challenge to the control performance of ILC. This paper introduces Q-learning algorithm for FE to continuously adjust the estimator and adapt the changing faults. Then, FTC is designed by adopting the norm-optimal iterative learning control (NOILC) framework, where the controller is adjusted based on the FE results from Q-learning to counteract the influence of faults. Finally, the simulation on the plant of a mobile robot verifies the effectiveness of the proposed algorithm.

A Probabilistically Quantized Learning Control Framework for Networked Linear Systems

In this article, we consider quantized learning control for linear networked systems with additive channel noise. Our objective is to achieve high tracking performance while reducing the communication burden on the communication network. To address this problem, we propose an integrated framework consisting of two modules: a probabilistic quantizer and a learning scheme. The employed probabilistic quantizer is developed by employing a Bernoulli distribution driven by the quantization errors. Three learning control schemes are studied, namely, a constant gain, a decreasing gain sequence satisfying certain conditions, and an optimal gain sequence that is recursively generated based on a performance index. We show that the control with a constant gain can only ensure the input error sequence to converge to a bounded sphere in a mean-square sense, where the radius of this sphere is proportional to the constant gain. On the contrary, we show that the control that employs any of the two proposed gain sequences drives the input error to zero in the mean-square sense. In addition, we show that the convergence rate associated with the constant gain is exponential, whereas the rate associated with the proposed gain sequences is not faster than a specific exponential trend. Illustrative simulations are provided to demonstrate the convergence rate properties and steady-state tracking performance associated with each gain, and their robustness against modeling uncertainties.

Accelerated Learning Control for Point-to-Point Tracking Systems

In this study, we investigate the accelerated learning control schemes for point-to-point tracking systems (PTSs) with measurement noise. The asymptotic convergence of the generated input sequence has been a long-standing open issue for point-to-point tracking problems because there are infinite possible input candidates that can drive the system dynamics to track the desired reference at specified time instants. An accelerated gradient algorithm and its generalized version with a novel direction regulation matrix are proposed, with the learning gain is adaptively triggered by the practical tracking errors. The learning gain remains constant at the early stage and begins to decrease after a certain number of iterations. The input sequence generated by the proposed scheme converges to a specified limit for any fixed initial input, with the limit being closest to the initial input, in a certain sense. Numerical simulations are provided to verify the theoretical results.