Search arXivSearch

arXiv · 2009.01978

Including steady-state information in nonlinear models: an application to the development of soft-sensors

Abstract

When the dynamical data of a system only convey dynamic information over a limited operating range, the identification of models with good performance over a wider operating range is very unlikely. Nevertheless, models with such characteristic are desirable to implement modern control systems. To overcome such a shortcoming, this paper describes a methodology to train models from dynamical data and steady-state information, which is assumed available. The novelty is that the procedure can be applied to models with rather complex structures such as multilayer perceptron neural networks in a bi-objective fashion without the need to compute fixed points neither analytically nor numerically. As a consequence, the required computing time is greatly reduced. The capabilities of the proposed method are explored in numerical examples and the development of soft-sensors for downhole pressure estimation for a real deep-water offshore oil well. The results indicate that the procedure yields suitable soft-sensors with good dynamical and static performance and, in the case of models that are nonlinear in the parameters, the gain in computation time is about three orders of magnitude considering existing approaches.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leandro Freitas, Bruno H. G. Barbosa, Luis A. Aguirre. 2020-09-04. Including steady-state information in nonlinear models: an application to the development of soft-sensors. https://arxiv.org/abs/2009.01978

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY