Towards Efficient Maximum Likelihood Estimation of LPV-SS Models

How to efficiently identify multiple-input multiple-output (MIMO) linear parameter-varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling variable still remains an open question, as identification methods proposed in the literature suffer heavily from the curse of dimensionality and/or depend on over-restrictive approximations of the measured signal behaviors. However, obtaining an SS model of the targeted system is crucial for many LPV control synthesis methods, as these synthesis tools are almost exclusively formulated for the aforementioned representation of the system dynamics. Therefore, in this paper, we tackle the problem by combining state-of-the-art LPV input-output (IO) identification methods with an LPV-IO to LPV-SS realization scheme and a maximum likelihood refinement step. The resulting modular LPV-SS identification approach achieves statical efficiency with a relatively low computational load. The method contains the following three steps: 1) estimation of the Markov coefficient sequence of the underlying system using correlation analysis or Bayesian impulse response estimation, then 2) LPV-SS realization of the estimated coefficients by using a basis reduced Ho-Kalman method, and 3) refinement of the LPV-SS model estimate from a maximum-likelihood point of view by a gradient-based or an expectation-maximization optimization methodology. The effectiveness of the full identification scheme is demonstrated by a Monte Carlo study where our proposed method is compared to existing schemes for identifying a MIMO LPV system

A robust iterative learning control for continuous-time nonlinear systems with disturbances

In this paper, we study the trajectory tracking problem using iterative learning control for continuous-time nonlinear systems with a generic fixed relative degree in the presence of disturbances. This class of controllers iteratively refine the control input relying on the tracking error of the previous trials and some properly tuned learning gains. Sufficient conditions on these gains guarantee the monotonic convergence of the iterative process. However, the choice of the gains is heuristically hand-tuned given an approximated system model and no information on the disturbances. Thus, in the cases of inaccurate knowledge of the model or iteration-varying measurement errors, external disturbances, and delays, the convergence condition is unlikely to be verified at every iteration. To overcome this issue, we propose a robust convergence condition, which ensures the applicability of the pure feedforward control even if other classical conditions are not fulfilled for some trials due to the presence of disturbances. Furthermore, we quantify the upper bound of the nonrepetitive disturbance that the iterative algorithm is able to handle. Finally, we validate the convergence condition simulating the dynamics of a two degrees of freedom underactuated arm with elastic joints, where one is active, and the other is passive, and a Franka Emika Panda manipulator

Performance Improvement of Low-Cost Iterative Learning-Based Fuzzy Control Systems for Tower Crane Systems

This paper is dedicated to the memory of Prof. Ioan Dzitac, one of the fathers of this journal and its founding Editor-in-Chief till 2021. The paper addresses the performance improvement of three Single Input-Single Output (SISO) fuzzy control systems that control separately the positions of interest of tower crane systems, namely the cart position, the arm angular position and the payload position. Three separate low-cost SISO fuzzy controllers are employed in terms of first order discrete-time intelligent Proportional-Integral (PI) controllers with Takagi-Sugeno-Kang Proportional-Derivative (PD) fuzzy terms. Iterative Learning Control (ILC) system structures with PD learning functions are involved in the current iteration SISO ILC structures. Optimization problems are defined in order to tune the parameters of the learning functions. The objective functions are defined as the sums of squared control errors, and they are solved in the iteration domain using the recent metaheuristic Slime Mould Algorithm (SMA). The experimental results prove the performance improvement of the SISO control systems after ten iterations of SMA

Relaxing Fundamental Assumptions in Iterative Learning Control

Iterative learning control (ILC) is perhaps best decribed as an open loop feedforward control technique where the feedforward signal is learned through repetition of a single task. As the name suggests, given a dynamic system operating on a finite time horizon with the same desired trajectory, ILC aims to iteratively construct the inverse image (or its approximation) of the desired trajectory to improve transient tracking. In the literature, ILC is often interpreted as feedback control in the iteration domain due to the fact that learning controllers use information from past trials to drive the tracking error towards zero. However, despite the significant body of literature and powerful features, ILC is yet to reach widespread adoption by the control community, due to several assumptions that restrict its generality when compared to feedback control. In this dissertation, we relax some of these assumptions, mainly the fundamental invariance assumption, and move from the idea of learning through repetition to two dimensional systems, specifically repetitive processes, that appear in the modeling of engineering applications such as additive manufacturing, and sketch out future research directions for increased practicality: We develop an L1 adaptive feedback control based ILC architecture for increased robustness, fast convergence, and high performance under time varying uncertainties and disturbances. Simulation studies of the behavior of this combined L1-ILC scheme under iteration varying uncertainties lead us to the robust stability analysis of iteration varying systems, where we show that these systems are guaranteed to be stable when the ILC update laws are designed to be robust, which can be done using existing methods from the literature. As a next step to the signal space approach adopted in the analysis of iteration varying systems, we shift the focus of our work to repetitive processes, and show that the exponential stability of a nonlinear repetitive system is equivalent to that of its linearization, and consequently uniform stability of the corresponding state space matrix.PhDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/133232/1/altin_1.pd

Nussbaum gain based iterative learning control for a class of multi-input multi-output nonlinear systems.

YesAn adaptive iterative learning control(ILC) approach is proposed for a class of multi-input multi-output (MIMO) uncertain nonlinear systems without prior knowledge about system control gain matrices. The Nussbaum-type gain and the positive definite discrete matrix kernel are proposed for dealing with selection of the unknown control gain and learning of the repeatable uncertainties, respectively. Asymptotic convergence for a trajectory tracking within a finite time interval is achieved through repetitive tracking. Simulations are carried out to show the validity of the proposed control method

A Factor Graph Approach to Automated Design of Bayesian Signal Processing Algorithms

The benefits of automating design cycles for Bayesian inference-based algorithms are becoming increasingly recognized by the machine learning community. As a result, interest in probabilistic programming frameworks has much increased over the past few years. This paper explores a specific probabilistic programming paradigm, namely message passing in Forney-style factor graphs (FFGs), in the context of automated design of efficient Bayesian signal processing algorithms. To this end, we developed "ForneyLab" (https://github.com/biaslab/ForneyLab.jl) as a Julia toolbox for message passing-based inference in FFGs. We show by example how ForneyLab enables automatic derivation of Bayesian signal processing algorithms, including algorithms for parameter estimation and model comparison. Crucially, due to the modular makeup of the FFG framework, both the model specification and inference methods are readily extensible in ForneyLab. In order to test this framework, we compared variational message passing as implemented by ForneyLab with automatic differentiation variational inference (ADVI) and Monte Carlo methods as implemented by state-of-the-art tools "Edward" and "Stan". In terms of performance, extensibility and stability issues, ForneyLab appears to enjoy an edge relative to its competitors for automated inference in state-space models.Comment: Accepted for publication in the International Journal of Approximate Reasonin