Lasso-MPC – Predictive Control with l1-Regularised Least Squares

Lasso-MPC – Predictive Control with l1-Regularised Least Squares PDF Author: Marco Gallieri
Publisher: Springer
ISBN: 3319279637
Category : Technology & Engineering
Languages : en
Pages : 209

Get Book Here

Book Description
This thesis proposes a novel Model Predictive Control (MPC) strategy, which modifies the usual MPC cost function in order to achieve a desirable sparse actuation. It features an l1-regularised least squares loss function, in which the control error variance competes with the sum of input channels magnitude (or slew rate) over the whole horizon length. While standard control techniques lead to continuous movements of all actuators, this approach enables a selected subset of actuators to be used, the others being brought into play in exceptional circumstances. The same approach can also be used to obtain asynchronous actuator interventions, so that control actions are only taken in response to large disturbances. This thesis presents a straightforward and systematic approach to achieving these practical properties, which are ignored by mainstream control theory.

Lasso-MPC – Predictive Control with l1-Regularised Least Squares

Lasso-MPC – Predictive Control with l1-Regularised Least Squares PDF Author: Marco Gallieri
Publisher: Springer
ISBN: 3319279637
Category : Technology & Engineering
Languages : en
Pages : 209

Get Book Here

Book Description
This thesis proposes a novel Model Predictive Control (MPC) strategy, which modifies the usual MPC cost function in order to achieve a desirable sparse actuation. It features an l1-regularised least squares loss function, in which the control error variance competes with the sum of input channels magnitude (or slew rate) over the whole horizon length. While standard control techniques lead to continuous movements of all actuators, this approach enables a selected subset of actuators to be used, the others being brought into play in exceptional circumstances. The same approach can also be used to obtain asynchronous actuator interventions, so that control actions are only taken in response to large disturbances. This thesis presents a straightforward and systematic approach to achieving these practical properties, which are ignored by mainstream control theory.

Set-theoretic Approaches to the Aperiodic Control of Linear Systems

Set-theoretic Approaches to the Aperiodic Control of Linear Systems PDF Author: Florian D. Brunner
Publisher: Logos Verlag Berlin GmbH
ISBN: 3832546227
Category : Technology & Engineering
Languages : en
Pages : 244

Get Book Here

Book Description
In this thesis, we employ set-theoretic properties of additively disturbed linear discrete-time systems to develop stabilizing aperiodically updated control laws for plants controlled over communication networks. In particular, we design event-triggered and self-triggered controllers with a priori guarantees on closed-loop characteristics such as stability, asymptotic bound, and average communication rate. Different models for the disturbances are taken into account, namely arbitrary disturbances of which only a bound in the form of a compact set is known and stochastic disturbances with known probability distribution. For setups with hard constraints on the states and inputs, we propose aperiodic schemes based on robust model predictive control methods. Both the full information (state-feedback) case, as well as the limited information (output-feedback) case are investigated. It is demonstrated that the proposed controllers achieve a considerable reduction in the required network usage with only moderate or non-existing deterioration of the closed-loop properties guaranteed by comparable controllers that transmit information at every point in time.

Practical Design and Application of Model Predictive Control

Practical Design and Application of Model Predictive Control PDF Author: Nassim Khaled
Publisher: Butterworth-Heinemann
ISBN: 0128139196
Category : Technology & Engineering
Languages : en
Pages : 264

Get Book Here

Book Description
Practical Design and Application of Model Predictive Control is a self-learning resource on how to design, tune and deploy an MPC using MATLAB® and Simulink®. This reference is one of the most detailed publications on how to design and tune MPC controllers. Examples presented range from double-Mass spring system, ship heading and speed control, robustness analysis through Monte-Carlo simulations, photovoltaic optimal control, and energy management of power-split and air-handling control. Readers will also learn how to embed the designed MPC controller in a real-time platform such as Arduino®. The selected problems are nonlinear and challenging, and thus serve as an excellent experimental, dynamic system to show the reader the capability of MPC. The step-by-step solutions of the problems are thoroughly documented to allow the reader to easily replicate the results. Furthermore, the MATLAB® and Simulink® codes for the solutions are available for free download. Readers can connect with the authors through the dedicated website which includes additional free resources at www.practicalmpc.com. - Illustrates how to design, tune and deploy MPC for projects in a quick manner - Demonstrates a variety of applications that are solved using MATLAB® and Simulink® - Bridges the gap in providing a number of realistic problems with very hands-on training - Provides MATLAB® and Simulink® code solutions. This includes nonlinear plant models that the reader can use for other projects and research work - Presents application problems with solutions to help reinforce the information learned

Model Predictive Control in the Process Industry

Model Predictive Control in the Process Industry PDF Author: Eduardo F. Camacho
Publisher: Springer Science & Business Media
ISBN: 1447130081
Category : Technology & Engineering
Languages : en
Pages : 250

Get Book Here

Book Description
Model Predictive Control is an important technique used in the process control industries. It has developed considerably in the last few years, because it is the most general way of posing the process control problem in the time domain. The Model Predictive Control formulation integrates optimal control, stochastic control, control of processes with dead time, multivariable control and future references. The finite control horizon makes it possible to handle constraints and non linear processes in general which are frequently found in industry. Focusing on implementation issues for Model Predictive Controllers in industry, it fills the gap between the empirical way practitioners use control algorithms and the sometimes abstractly formulated techniques developed by researchers. The text is firmly based on material from lectures given to senior undergraduate and graduate students and articles written by the authors.

Sparsity Methods for Systems and Control

Sparsity Methods for Systems and Control PDF Author: Masaaki Nagahara
Publisher:
ISBN: 9781680837247
Category :
Languages : en
Pages : 220

Get Book Here

Book Description
The method of sparsity has been attracting a lot of attention in the fields related not only to signal processing, machine learning, and statistics, but also systems and control. The method is known as compressed sensing, compressive sampling, sparse representation, or sparse modeling. More recently, the sparsity method has been applied to systems and control to design resource-aware control systems. This book gives a comprehensive guide to sparsity methods for systems and control, from standard sparsity methods in finite-dimensional vector spaces (Part I) to optimal control methods in infinite-dimensional function spaces (Part II). The primary objective of this book is to show how to use sparsity methods for several engineering problems. For this, the author provides MATLAB programs by which the reader can try sparsity methods for themselves. Readers will obtain a deep understanding of sparsity methods by running these MATLAB programs. Sparsity Methods for Systems and Control is suitable for graduate level university courses, though it should also be comprehendible to undergraduate students who have a basic knowledge of linear algebra and elementary calculus. Also, especially part II of the book should appeal to professional researchers and engineers who are interested in applying sparsity methods to systems and control.

Multi-period Trading Via Convex Optimization

Multi-period Trading Via Convex Optimization PDF Author: Stephen P. Boyd
Publisher:
ISBN: 9781680833294
Category : Electronic books
Languages : en
Pages : 76

Get Book Here

Book Description
We consider a basic model of multi-period trading, which can be used to evaluate the performance of a trading strategy. We describe a framework for single-period optimization, where the trades in each period are found by solving a convex optimization problem that trades off expected return, risk, transaction cost and holding cost such as the borrowing cost for shorting assets. We then describe a multi-period version of the trading method, where optimization is used to plan a sequence of trades, with only the first one executed, using estimates of future quantities that are unknown when the trades are chosen. The single period method traces back to Markowitz; the multi-period methods trace back to model predictive control. Our contribution is to describe the single-period and multi-period methods in one simple framework, giving a clear description of the development and the approximations made. In this paper, we do not address a critical component in a trading algorithm, the predictions or forecasts of future quantities. The methods we describe in this paper can be thought of as good ways to exploit predictions, no matter how they are made. We have also developed a companion open-source software library that implements many of the ideas and methods described in the paper.

Partial Update Least-Square Adaptive Filtering

Partial Update Least-Square Adaptive Filtering PDF Author: Bei Xie
Publisher: Springer Nature
ISBN: 3031016815
Category : Technology & Engineering
Languages : en
Pages : 105

Get Book Here

Book Description
Adaptive filters play an important role in the fields related to digital signal processing and communication, such as system identification, noise cancellation, channel equalization, and beamforming. In practical applications, the computational complexity of an adaptive filter is an important consideration. The Least Mean Square (LMS) algorithm is widely used because of its low computational complexity ($O(N)$) and simplicity in implementation. The least squares algorithms, such as Recursive Least Squares (RLS), Conjugate Gradient (CG), and Euclidean Direction Search (EDS), can converge faster and have lower steady-state mean square error (MSE) than LMS. However, their high computational complexity ($O(N^2)$) makes them unsuitable for many real-time applications. A well-known approach to controlling computational complexity is applying partial update (PU) method to adaptive filters. A partial update method can reduce the adaptive algorithm complexity by updating part of the weight vector instead of the entire vector or by updating part of the time. In the literature, there are only a few analyses of these partial update adaptive filter algorithms. Most analyses are based on partial update LMS and its variants. Only a few papers have addressed partial update RLS and Affine Projection (AP). Therefore, analyses for PU least-squares adaptive filter algorithms are necessary and meaningful. This monograph mostly focuses on the analyses of the partial update least-squares adaptive filter algorithms. Basic partial update methods are applied to adaptive filter algorithms including Least Squares CMA (LSCMA), EDS, and CG. The PU methods are also applied to CMA1-2 and NCMA to compare with the performance of the LSCMA. Mathematical derivation and performance analysis are provided including convergence condition, steady-state mean and mean-square performance for a time-invariant system. The steady-state mean and mean-square performance are also presented for a time-varying system. Computational complexity is calculated for each adaptive filter algorithm. Numerical examples are shown to compare the computational complexity of the PU adaptive filters with the full-update filters. Computer simulation examples, including system identification and channel equalization, are used to demonstrate the mathematical analysis and show the performance of PU adaptive filter algorithms. They also show the convergence performance of PU adaptive filters. The performance is compared between the original adaptive filter algorithms and different partial-update methods. The performance is also compared among similar PU least-squares adaptive filter algorithms, such as PU RLS, PU CG, and PU EDS. In addition to the generic applications of system identification and channel equalization, two special applications of using partial update adaptive filters are also presented. One application uses PU adaptive filters to detect Global System for Mobile Communication (GSM) signals in a local GSM system using the Open Base Transceiver Station (OpenBTS) and Asterisk Private Branch Exchange (PBX). The other application uses PU adaptive filters to do image compression in a system combining hyperspectral image compression and classification.

Accelerating Monte Carlo methods for Bayesian inference in dynamical models

Accelerating Monte Carlo methods for Bayesian inference in dynamical models PDF Author: Johan Dahlin
Publisher: Linköping University Electronic Press
ISBN: 9176857972
Category :
Languages : sv
Pages : 139

Get Book Here

Book Description
Making decisions and predictions from noisy observations are two important and challenging problems in many areas of society. Some examples of applications are recommendation systems for online shopping and streaming services, connecting genes with certain diseases and modelling climate change. In this thesis, we make use of Bayesian statistics to construct probabilistic models given prior information and historical data, which can be used for decision support and predictions. The main obstacle with this approach is that it often results in mathematical problems lacking analytical solutions. To cope with this, we make use of statistical simulation algorithms known as Monte Carlo methods to approximate the intractable solution. These methods enjoy well-understood statistical properties but are often computational prohibitive to employ. The main contribution of this thesis is the exploration of different strategies for accelerating inference methods based on sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC). That is, strategies for reducing the computational effort while keeping or improving the accuracy. A major part of the thesis is devoted to proposing such strategies for the MCMC method known as the particle Metropolis-Hastings (PMH) algorithm. We investigate two strategies: (i) introducing estimates of the gradient and Hessian of the target to better tailor the algorithm to the problem and (ii) introducing a positive correlation between the point-wise estimates of the target. Furthermore, we propose an algorithm based on the combination of SMC and Gaussian process optimisation, which can provide reasonable estimates of the posterior but with a significant decrease in computational effort compared with PMH. Moreover, we explore the use of sparseness priors for approximate inference in over-parametrised mixed effects models and autoregressive processes. This can potentially be a practical strategy for inference in the big data era. Finally, we propose a general method for increasing the accuracy of the parameter estimates in non-linear state space models by applying a designed input signal. Borde Riksbanken höja eller sänka reporäntan vid sitt nästa möte för att nå inflationsmålet? Vilka gener är förknippade med en viss sjukdom? Hur kan Netflix och Spotify veta vilka filmer och vilken musik som jag vill lyssna på härnäst? Dessa tre problem är exempel på frågor där statistiska modeller kan vara användbara för att ge hjälp och underlag för beslut. Statistiska modeller kombinerar teoretisk kunskap om exempelvis det svenska ekonomiska systemet med historisk data för att ge prognoser av framtida skeenden. Dessa prognoser kan sedan användas för att utvärdera exempelvis vad som skulle hända med inflationen i Sverige om arbetslösheten sjunker eller hur värdet på mitt pensionssparande förändras när Stockholmsbörsen rasar. Tillämpningar som dessa och många andra gör statistiska modeller viktiga för många delar av samhället. Ett sätt att ta fram statistiska modeller bygger på att kontinuerligt uppdatera en modell allteftersom mer information samlas in. Detta angreppssätt kallas för Bayesiansk statistik och är särskilt användbart när man sedan tidigare har bra insikter i modellen eller tillgång till endast lite historisk data för att bygga modellen. En nackdel med Bayesiansk statistik är att de beräkningar som krävs för att uppdatera modellen med den nya informationen ofta är mycket komplicerade. I sådana situationer kan man istället simulera utfallet från miljontals varianter av modellen och sedan jämföra dessa mot de historiska observationerna som finns till hands. Man kan sedan medelvärdesbilda över de varianter som gav bäst resultat för att på så sätt ta fram en slutlig modell. Det kan därför ibland ta dagar eller veckor för att ta fram en modell. Problemet blir särskilt stort när man använder mer avancerade modeller som skulle kunna ge bättre prognoser men som tar för lång tid för att bygga. I denna avhandling använder vi ett antal olika strategier för att underlätta eller förbättra dessa simuleringar. Vi föreslår exempelvis att ta hänsyn till fler insikter om systemet och därmed minska antalet varianter av modellen som behöver undersökas. Vi kan således redan utesluta vissa modeller eftersom vi har en bra uppfattning om ungefär hur en bra modell ska se ut. Vi kan också förändra simuleringen så att den enklare rör sig mellan olika typer av modeller. På detta sätt utforskas rymden av alla möjliga modeller på ett mer effektivt sätt. Vi föreslår ett antal olika kombinationer och förändringar av befintliga metoder för att snabba upp anpassningen av modellen till observationerna. Vi visar att beräkningstiden i vissa fall kan minska ifrån några dagar till någon timme. Förhoppningsvis kommer detta i framtiden leda till att man i praktiken kan använda mer avancerade modeller som i sin tur resulterar i bättre prognoser och beslut.

Data-Driven Science and Engineering

Data-Driven Science and Engineering PDF Author: Steven L. Brunton
Publisher: Cambridge University Press
ISBN: 1009098489
Category : Computers
Languages : en
Pages : 615

Get Book Here

Book Description
A textbook covering data-science and machine learning methods for modelling and control in engineering and science, with Python and MATLAB®.

AI and Learning Systems

AI and Learning Systems PDF Author: Konstantinos Kyprianidis
Publisher: BoD – Books on Demand
ISBN: 1789858771
Category : Technology & Engineering
Languages : en
Pages : 274

Get Book Here

Book Description
Over the last few years, interest in the industrial applications of AI and learning systems has surged. This book covers the recent developments and provides a broad perspective of the key challenges that characterize the field of Industry 4.0 with a focus on applications of AI. The target audience for this book includes engineers involved in automation system design, operational planning, and decision support. Computer science practitioners and industrial automation platform developers will also benefit from the timely and accurate information provided in this work. The book is organized into two main sections comprising 12 chapters overall: •Digital Platforms and Learning Systems •Industrial Applications of AI