arXiv subjects

Victor G. Lopez

Publications and source records attributed to Victor G. Lopez.

At least 37 records · Page 2Linked to original sources

arXiv2025

Event-triggered moving horizon estimation for nonlinear systems

This work proposes an event-triggered moving horizon estimation (ET-MHE) scheme for general nonlinear systems. The key components of the proposed scheme are a novel event-triggering mechanism (ETM) and the suitable design of the MHE cost function. The main characteristic of our method is that the MHE's nonlinear optimization problem is only solved when the ETM triggers the transmission of measured data to the remote state estimator. If no event occurs, then the current state estimate results from an open-loop prediction using the system dynamics. Furthermore, we show robust global exponential stability of the ET-MHE under a suitable detectability condition. Finally, we illustrate the applicability of the proposed method in terms of a nonlinear benchmark example, where we achieved similar estimation performance compared to standard MHE using 86% less computational resources.

eess.SY↗

arXiv2025

Sample-based nonlinear detectability for discrete-time systems

This paper introduces two sample-based formulations of incremental input/output-to-state stability (i-IOSS), a suitable detectability notion for general nonlinear systems. In this work we consider the case of limited output information, i.e., measurements are only infrequently and/or irregularly available. The output-dependent term of the sample-based i-IOSS bound is properly modified to yield a characterization for detectability in presence of incomplete output sequences. We provide both a non-timediscounted and a time-discounted formulation of samplebased i-IOSS. Furthermore, conditions for an i-IOSS system to be also sample-based i-IOSS are given and the relation between the two formulations of sample-based i-IOSS is shown.

eess.SY↗

arXiv2025

Sufficient Conditions for Detectability of Approximately Discretized Nonlinear Systems

In many sampled-data applications, observers are designed based on approximately discretized models of continuous-time systems, where usually only the discretized system is analyzed in terms of its detectability. In this paper, we show that if the continuous-time system satisfies certain linear matrix inequality (LMI) conditions, and the sampling period of the discretization scheme is sufficiently small, then the whole family of discretized systems (parameterized by the sampling period) satisfies analogous discrete-time LMI conditions that imply detectability. Our results are applicable to general discretization schemes, as long as they produce approximate models whose linearizations are in some sense consistent with the linearizations of the continuous-time ones. We explicitly show that the Euler and second-order Runge-Kutta methods satisfy this condition. A batch-reactor system example is provided to highlight the usefulness of our results from a practical perspective.

eess.SY↗

arXiv2025

Insights into the explainability of Lasso-based DeePC for nonlinear systems

Data-enabled Predictive Control (DeePC) has recently gained the spotlight as an easy-to-use control technique that allows for constraint handling while relying on raw data only. Initially proposed for linear time-invariant systems, several DeePC extensions are now available to cope with nonlinear systems. Nonetheless, these solutions mainly focus on ensuring the controller's effectiveness, overlooking the explainability of the final result. As a step toward explaining the outcome of DeePC for the control of nonlinear systems, in this paper, we focus on analyzing the earliest and simplest DeePC approach proposed to cope with nonlinearities in the controlled system, using a Lasso regularization. Our theoretical analysis highlights that the decisions undertaken by DeePC with Lasso regularization are unexplainable, as control actions are determined by data incoherent with the system's local behavior. This result is true even when the available input/output samples are grouped according to the different operating conditions explored during data collection. Our numerical study confirms these findings, highlighting the benefits of data grouping in terms of performance while showing that explainability remains a challenge in control design via DeePC.

eess.SY↗

arXiv2025

Gaussian Processes with Noisy Regression Inputs for Dynamical Systems

This paper is centered around the approximation of dynamical systems by means of Gaussian processes. To this end, trajectories of such systems must be collected to be used as training data. The measurements of these trajectories are typically noisy, which implies that both the regression inputs and outputs are corrupted by noise. However, most of the literature considers only noise in the regression outputs. In this paper, we show how to account for the noise in the regression inputs in an extended Gaussian process framework to approximate scalar and multidimensional systems. We demonstrate the potential of our framework by comparing it to different state-of-the-art methods in several simulation examples.

eess.SY↗

arXiv2024

An efficient data-based off-policy Q-learning algorithm for optimal output feedback control of linear systems

In this paper, we present a Q-learning algorithm to solve the optimal output regulation problem for discrete-time LTI systems. This off-policy algorithm only relies on using persistently exciting input-output data, measured offline. No model knowledge or state measurements are needed and the obtained optimal policy only uses past input-output information. Moreover, our formulation of the proposed algorithm renders it computationally efficient. We provide conditions that guarantee the convergence of the algorithm to the optimal solution. Finally, the performance of our method is compared to existing algorithms in the literature.

eess.SY↗

arXiv2024

Data-Based System Representation and Synchronization for Multiagent Systems

This paper presents novel solutions of the data-based synchronization problem for continuous-time multiagent systems. We consider the cases of homogeneous and heterogeneous systems. First, we obtain a data-based representation of the synchronization error dynamics for homogeneous systems and show how to extend existing data-based stabilization results to stabilize such error dynamics. The proposed method relies on the solution of a set of linear matrix inequalities that are shown to be feasible. Then, we solve the synchronization problem for heterogeneous systems by means of dynamic controllers. Different from existing results, we do not require model knowledge for the followers and the leader. The theoretical results are finally validated using a numerical simulation.

eess.SY↗

arXiv2024

Data-based system representations from irregularly measured data

Non-parametric representations of dynamical systems based on the image of a Hankel matrix of data are extensively used for data-driven control. However, if samples of data are missing, obtaining such representations becomes a difficult task. By exploiting the kernel structure of Hankel matrices of irregularly measured data generated by a linear time-invariant system, we provide computational methods for which any complete finite-length behavior of the system can be obtained. For the special case of periodically missing outputs, we provide conditions on the input such that the former result is guaranteed. In the presence of noise in the data, our method returns an approximate finite-length behavior of the system. We illustrate our result with several examples, including its use for approximate data completion in real-world applications and compare it to alternative methods.

eess.SY↗

arXiv2024

An input-output continuous-time version of Willems' lemma

We illustrate a novel version of Willems' lemma for data-based representation of continuous-time systems. The main novelties compared to previous works are two. First, the proposed framework relies only on measured input-output trajectories from the system and no internal (state) information is required. Second, our system representation makes use of exact system trajectories, without resorting to orthogonal bases representations and consequent approximations. We first establish sufficient and necessary conditions for data-based generation of system trajectories in terms of suitable latent variables. Subsequently, we reformulate these conditions using measured input-output data and show how to span the full behavior of the system. Furthermore, we show how to use the developed framework to solve the data-based continuous-time simulation problem.

eess.SY↗

arXiv2024

Sample- and computationally efficient data-driven predictive control

Recently proposed data-driven predictive control schemes for LTI systems use non-parametric representations based on the image of a Hankel matrix of previously collected, persistently exciting, input-output data. Persistence of excitation necessitates that the data is sufficiently long and, hence, the computational complexity of the corresponding finite-horizon optimal control problem increases. In this paper, we propose an efficient data-driven predictive control (eDDPC) scheme which is both more sample efficient (requires less offline data) and computationally efficient (uses less decision variables) compared to existing schemes. This is done by leveraging an alternative data-based representation of the trajectories of LTI systems. We analytically and numerically compare the performance of this scheme to existing ones from the literature.

eess.SY↗

arXiv2024

Robust Data-Driven Moving Horizon Estimation for Linear Discrete-Time Systems

In this paper, a robust data-driven moving horizon estimation (MHE) scheme for linear time-invariant discrete-time systems is introduced. The scheme solely relies on offline collected data without employing any system identification step. We prove practical robust exponential stability for the setting where both the online measurements and the offline collected data are corrupted by non-vanishing and bounded noise. The behavior of the novel robust data-driven MHE scheme is illustrated by means of simulation examples and compared to a standard model-based MHE scheme, where the model is identified using the same offline data as for the data-driven MHE scheme.

eess.SY↗

arXiv2023

On the design of persistently exciting inputs for data-driven control of linear and nonlinear systems

In the context of data-driven control, persistence of excitation (PE) of an input sequence is defined in terms of a rank condition on the Hankel matrix of the input data. For nonlinear systems, recent results employed rank conditions involving collected input and state/output data, for which no guidelines are available on how to satisfy them a priori. In this paper, we first show that a set of discrete impulses is guaranteed to be persistently exciting for any controllable LTI system. Based on this result, for certain classes of nonlinear systems, we guarantee persistence of excitation of sequences of basis functions a priori, by design of the physical input only.

math.OC↗

arXiv2023

Robust Stability of Gaussian Process Based Moving Horizon Estimation

In this paper, we introduce a Gaussian process based moving horizon estimation (MHE) framework. The scheme is based on offline collected data and offline hyperparameter optimization. In particular, compared to standard MHE schemes, we replace the mathematical model of the system by the posterior mean of the Gaussian process. To account for the uncertainty of the learned model, we exploit the posterior variance of the learned Gaussian process in the weighting matrices of the cost function of the proposed MHE scheme. We prove practical robust exponential stability of the resulting estimator using a recently proposed Lyapunov-based proof technique. Finally, the performance of the Gaussian process based MHE scheme is illustrated via a nonlinear system.

eess.SY↗

arXiv2023

Sample-based observability of linear discrete-time systems

In this work, sample-based observability of linear discrete-time systems is studied. That is, we consider the case where the system output measurements are not available at every time instance. It is shown that some discrete-time systems exhibit particular behaviors that lead to pathological sampling. Depending on the characteristics of the system, different sampling schemes are developed that allow the system state to be reconstructed.

eess.SY↗

arXiv2023

An Efficient Off-Policy Reinforcement Learning Algorithm for the Continuous-Time LQR Problem

In this paper, an off-policy reinforcement learning algorithm is designed to solve the continuous-time LQR problem using only input-state data measured from the system. Different from other algorithms in the literature, we propose the use of a specific persistently exciting input as the exploration signal during the data collection step. We then show that, using this persistently excited data, the solution of the matrix equation in our algorithm is guaranteed to exist and to be unique at every iteration. Convergence of the algorithm to the optimal control input is also proven. Moreover, we formulate the policy evaluation step as the solution of a Sylvester-transpose equation, which increases the efficiency of its solution. Finally, a method to determine a stabilizing policy to initialize the algorithm using only measured data is proposed.

eess.SY↗

arXiv2023

On a Continuous-Time Version of Willems' Lemma

In this paper, a method to represent every input-output trajectory of a continuous-time linear system in terms of previously collected data is presented. This corresponds to a continuous-time version of the well-known Willems' lemma. The result is obtained by sampling the continuous signals at regular intervals, and constructing Hankel-like structures that closely resemble their discrete-time counterparts. Then, it is shown how to use measured persistently excited data to design a time-varying vector of parameters that allows the generation of arbitrary piecewise differentiable trajectories. A class of input signals that satisfies the conditions for persistence of excitation is also provided.

eess.SY↗

arXiv2023

Efficient Off-Policy Q-Learning for Data-Based Discrete-Time LQR Problems

This paper introduces and analyzes an improved Q-learning algorithm for discrete-time linear time-invariant systems. The proposed method does not require any knowledge of the system dynamics, and it enjoys significant efficiency advantages over other data-based optimal control methods in the literature. This algorithm can be fully executed off-line, as it does not require to apply the current estimate of the optimal input to the system as in on-policy algorithms. It is shown that a persistently exciting input, defined from an easily tested matrix rank condition, guarantees the convergence of the algorithm. A data-based method is proposed to design the initial stabilizing feedback gain that the algorithm requires. Robustness of the algorithm in the presence of noisy measurements is analyzed. We compare the proposed algorithm in simulation to different direct and indirect data-based control design methods.

eess.SY↗

arXiv2023

Practical exponential stability of a robust data-driven nonlinear predictive control scheme

We provide theoretical guarantees for recursive feasibility and practical exponential stability of the closed-loop system of a feedback linearizable nonlinear system when controlled by a robust data-driven nonlinear predictive control scheme. This technical report serves as a supplementary material to our recent paper "Data-driven Nonlinear Predictive Control for Feedback Linearizable Systems". The arguments shown in this report follow similar steps to those for the LTI case, since feedback linearizable systems are linear in transformed coordinates. However, the proof was suitably adapted to match the nonlinear setting under consideration, and the differences are emphasized throughout the proof.

math.OC↗