A Simple Discretization Scheme for Gain Matrix Conditioning
In industrial model predictive controllers (MPCs), models generated from regression-based system identification methods typically contain small or even physically non-existent degrees of freedom. Control issues can arise when the steady-state optimizer uses these small degrees of freedom to calculate targets for plant operation due to matrix ill-conditioning. Mathematical techniques like Relative Gain Array (RGA) and Singular Value Decomposition (SVD) are helpful for analyzing controller gain interactions and identifying conditioning issues, which can be corrected relatively easily in small models. However, these techniques are difficult and tedious to apply for larger, more complex models. This paper describes a novel, non-iterative, RGA-based, binning technique for discretizing the gain matrix and quickly solving 2x2 conditioning issues for any model size, while guaranteeing gain adjustments below a certain threshold. Higher order interactions are also discussed.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Matrix method stability and robustness of compact schemes for parabolic PDEs
The fully discrete problem for convection-diffusion equation is considered. It comprises compact approximations for spatial discretization, and Crank-Nicolson scheme for temporal discretization. The expressions for the e…
Techniques for clustering interaction data as a collection of graphs
A natural approach to analyze interaction data of form "what-connects-to-what-when" is to create a time-series (or rather a sequence) of graphs through temporal discretization (bandwidth selection) and spatial discretiza…
ClusteringCommunity DetectionModel SelectionTime Series+1Optimal Preconditioning and Fisher Adaptive Langevin Sampling
We define an optimal preconditioning for the Langevin diffusion by analytically optimizing the expected squared jumped distance. This yields as the optimal preconditioning an inverse Fisher information covariance matrix,…
PositionProper Implicit Discretization of the Super-Twisting Controller -- without and with Actuator Saturation
The discrete-time implementation of the super-twisting sliding mode controller for a plant with disturbances with bounded slope, zero-order hold actuation, and actuator constraints is considered. Motivated by restriction…
Simulation schemes for the Heston model with Poisson conditioning
Exact simulation schemes under the Heston stochastic volatility model (e.g., Broadie-Kaya and Glasserman-Kim) suffer from computationally expensive modified Bessel function evaluations. We propose a new exact simulation …