A Small-Gain Theorem for Discrete-Time Convergent Systems and Its Applications
Convergent, contractive or incremental stability properties of nonlinear systems have attracted interest for control tasks such as observer design, output regulation and synchronization. The convergence property plays a central role in the neuromorphic (brain-inspired) computing of reservoir computing, which seeks to harness the information processing capability of nonlinear systems. This paper presents a small-gain theorem for discrete-time output-feedback interconnected systems to be uniformly input-to-output convergent (UIOC) with outputs converging to a bounded reference output uniquely determined by the input. A small-gain theorem for interconnected time-varying discrete-time uniform input-to-output stable systems that could be of separate interest is also presented as an intermediate result. Applications of the UIOC small-gain theorem are illustrated in the design of observer-based controllers and interconnected nonlinear classical and quantum dynamical systems (as reservoir computers) for black-box system identification.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Razumikhin-type ISS Lyapunov function and small gain theorem for discrete time time-delay systems with application to a biased min-consensus protocol
This paper considers small gain theorems for the global asymptotic and exponential input-to-state stability for discrete time time-delay systems using Razumikhin-type Lyapunov function. Among other things, unlike the exi…
A networked small-gain theorem based on discrete-time diagonal stability
We present a new sufficient condition for finite-gain $L_2$ input-to-output stability of a networked system. The condition requires a matrix, that combines information on the $L_2$ gains of the sub-systems and their inte…
A Polyak-Ruppert Central Limit Theorem for SA-Adam with Momentum and Non-Convergent Adaptive Preconditioning
Adaptive optimizers combining preconditioning, momentum, and weight decay (Adam and AdamW) are, under Polyak-Ruppert averaging, candidate engines for one-pass inference. Does the averaged iterate keep the classical Polya…
A Design Method of Distributed Algorithms via Discrete-time Blended Dynamics Theorem
We develop a discrete-time version of the blended dynamics theorem for the use of designing distributed computation algorithms. The blended dynamics theorem enables to predict the behavior of heterogeneous multi-agent sy…
Robust Reinforcement Learning for Risk-Sensitive Linear Quadratic Gaussian Control
This paper proposes a novel robust reinforcement learning framework for discrete-time linear systems with model mismatch that may arise from the sim-to-real gap. A key strategy is to invoke advanced techniques from contr…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)