Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userIdentification of Linear Systems with Multiplicative Noise from Multiple Trajectory Data
361
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study identification of linear systems with multiplicative noise from multiple trajectory data. A least-squares algorithm, based on exploratory inputs, is proposed to simultaneously estimate the parameters of the nominal system and the covariance matrix of the multiplicative noise. The algorithm does not need prior knowledge of the noise or stability of the system, but requires mild conditions of inputs and relatively small length for each trajectory. Identifiability of the noise covariance matrix is studied, showing that there exists an equivalent class of matrices that generate the same second-moment dynamic of system states. It is demonstrated how to obtain the equivalent class based on estimates of the noise covariance. Asymptotic consistency of the algorithm is verified under sufficiently exciting inputs and system controllability conditions. Non-asymptotic estimation performance is also analyzed under the assumption that system states and noise are bounded, providing vanishing high-probability bounds as the number of trajectories grows to infinity. The results are illustrated by numerical simulations.
rate research
Read More
The study of multiplicative noise models has a long history in control theory but is re-emerging in the context of complex networked systems and systems with learning-based control. We consider linear system identification with multiplicative noise from multiple state-input trajectory data. We propose exploratory input signals along with a least-squares algorithm to simultaneously estimate nominal system parameters and multiplicative noise covariance matrices. Identifiability of the covariance structure and asymptotic consistency of the least-squares estimator are demonstrated by analyzing first and second moment dynamics of the system. The results are illustrated by numerical simulations.
We present a data-driven method for solving the linear quadratic regulator problem for systems with multiplicative disturbances, the distribution of which is only known through sample estimates. We adopt a distributionally robust approach to cast the controller synthesis problem as semidefinite programs. Using results from high dimensional statistics, the proposed methodology ensures that their solution provides mean-square stabilizing controllers with high probability even for low sample sizes. As sample size increases the closed-loop cost approaches that of the optimal controller produced when the distribution is known. We demonstrate the practical applicability and performance of the method through a numerical experiment.
This paper addresses the mean-square optimal control problem for a class of discrete-time linear systems with a quasi-colored control-dependent multiplicative noise via output feedback. The noise under study is novel and shown to have advantage on modeling a class of network phenomena such as random transmission delays. The optimal output feedback controller is designed using an optimal mean-square state feedback gain and two observer gains, which are determined by the mean-square stabilizing solution to a modified algebraic Riccati equation (MARE), provided that the plant is minimum-phase and left-invertible. A necessary and sufficient condition for the existence of the stabilizing solution to the MARE is explicitly presented. It shows that the separation principle holds in a certain sense for the optimal control design of the work. The result is also applied to the optimal control problems in networked systems with random transmission delays and analog erasure channels, respectively.
Iterative trajectory optimization techniques for non-linear dynamical systems are among the most powerful and sample-efficient methods of model-based reinforcement learning and approximate optimal control. By leveraging time-variant local linear-quadratic approximations of system dynamics and reward, such methods can find both a target-optimal trajectory and time-variant optimal feedback controllers. However, the local linear-quadratic assumptions are a major source of optimization bias that leads to catastrophic greedy updates, raising the issue of proper regularization. Moreover, the approximate models disregard for any physical state-action limits of the system causes further aggravation of the problem, as the optimization moves towards unreachable areas of the state-action space. In this paper, we address the issue of constrained systems in the scenario of online-fitted stochastic linear dynamics. We propose modeling state and action physical limits as probabilistic chance constraints linear in both state and action and introduce a new trajectory optimization technique that integrates these probabilistic constraints by optimizing a relaxed quadratic program. Our empirical evaluations show a significant improvement in learning robustness, which enables our approach to perform more effective updates and avoid premature convergence observed in state-of-the-art algorithms.
This paper presents a dynamic state observer design for discrete-time linear time-varying systems that robustly achieves equalized recovery despite delayed or missing observations, where the set of all temporal patterns for the missing or delayed data is modeled by a finite-length language. By introducing a mapping of the language onto a reduced event-based language, we design a state estimator that adapts based on the history of available data at each step, and satisfies equalized recovery for all patterns in the reduced language. In contrast to existing equalized recovery estimators, the proposed design considers the equalized recovery level as a decision variable, which enables us to directly obtain the global minimum for the intermediate recovery level, resulting in improved estimation performance. Finally, we demonstrate the effectiveness of the proposed observer when compared to existing approaches using several illustrative examples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
