arXiv subjects

Gabriel de Albuquerque Gleizer

Publications and source records attributed to Gabriel de Albuquerque Gleizer.

12 recordsLinked to original sources

arXiv2026

A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems

We study the factor model problem, which aims to uncover low-dimensional structures in high-dimensional datasets. Adopting a robust data-driven approach, we formulate the problem as a saddle-point optimization. Our primary contribution is a first-order algorithm that solves this reformulation by leveraging a linear minimization oracle (LMO). We further develop semi-closed form solutions (up to a scalar) for three specific LMOs, corresponding to the Frobenius norm, Kullback-Leibler divergence, and Gelbrich (aka Wasserstein) distance. The analysis includes explicit quantification of these LMOs' regularity conditions, notably the Lipschitz constants of the dual function, which govern the algorithm's convergence performance. Numerical experiments confirm our method's effectiveness in high-dimensional settings, outperforming standard off-the-shelf optimization solvers.

math.OC↗

arXiv2025

Data-Driven Fault Isolation in Linear Time-Invariant Systems: A Subspace Classification Approach

We study the problem of fault isolation in linear systems with actuator and sensor faults within a data-driven framework. We propose a nullspace-based filter that uses solely fault-free input-output data collected under process and measurement noises. By reparameterizing the problem within a behavioral framework, we achieve a direct fault isolation filter design that is independent of any explicit system model. The underlying classification problem is approached from a geometric perspective, enabling a characterization of mutual fault discernibility in terms of fundamental system properties given a noise-free setting. In addition, the provided conditions can be evaluated using only the available data. Finally, a simulation study is conducted to demonstrate the effectiveness of the proposed method.

eess.SY↗

arXiv2025

Active Estimation of Multiplicative Faults in Dynamical Systems

This paper addresses the problem of estimating multiplicative fault signals in linear time-invariant systems by processing its input and output variables, as well as designing an input signal to maximize the accuracy of such estimates. The proposed real-time fault estimator is based on a residual generator used for fault detection and a multiple-output regressor generator, which feed a moving-horizon linear regression that estimates the parameter changes. Asymptotic performance guarantees are provided in the presence of noise. Motivated by the performance bounds, an optimal input design problem is formulated, for which we provide efficient algorithms and optimality bounds. Numerical examples demonstrate the efficacy of our approach and the importance of the optimal input design for accurate fault estimation.

eess.SY↗

arXiv2025

Output behavior equivalence and simultaneous subspace identification of systems and faults

We address the problem of identifying a system subject to additive faults, while simultaneously reconstructing the fault signal via subspace methods. We do not require nominal data for the identification, neither do we impose any assumption on the class of faults, e.g., sensor or actuator faults. We show that, under mild assumptions on the fault signal, standard PI-MOESP can recover the system matrices associated to the input-output subsystem. Then we introduce the concept of output behavior equivalence, which characterizes systems with the same output behavior set, and present a method to establish this equivalence from system matrices. Finally, we show how to estimate from data the complete set of fault matrices for which there exist a fault signal with minimal dimension that explains the data.

eess.SY↗

arXiv2022

A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence

This paper studies the reduction (abstraction) of finite-state transition systems for control synthesis problems. We revisit the notion of alternating simulation equivalence (ASE), a more relaxed condition than alternating bisimulations, to relate systems and their abstractions. As with alternating bisimulations, ASE preserves the property that the existence of a controller for the abstraction is necessary and sufficient for a controller to exist for the original system. Moreover, being a less stringent condition, ASE can reduce systems further to produce smaller abstractions. We provide an algorithm that produces minimal AS equivalent abstractions. The theoretical results are then applied to obtain (un)schedulability certificates of periodic event-triggered control systems sharing a communication channel. A numerical example illustrates the results.

cs.FL↗

arXiv2022

Computing the average inter-sample time of event-triggered control using quantitative automata

Event-triggered control (ETC) is a major recent development in cyber-physical systems due to its capability of reducing resource utilization in networked devices. However, while most of the ETC literature reports simulations indicating massive reductions in the sampling required for control, no method so far has been capable of quantifying these results. In this work, we propose an approach through finite-state abstractions to do formal quantification of the traffic generated by ETC of linear systems, in particular aiming at computing its smallest average inter-sample time (SAIST). The method involves abstracting the traffic model through $l$-complete abstractions, finding the cycle of minimum average length in the graph associated to it, and verifying whether this cycle is an infinitely recurring traffic pattern. The method is proven to be robust to sufficiently small model uncertainties, which allows its application to compute the SAIST of ETC of nonlinear systems.

eess.SY↗

arXiv2022

Chaos and order in event-triggered control

Event-triggered control (ETC) is claimed to provide enormous reductions in sampling frequency when compared to periodic sampling, but little is formally known about its generated traffic. This work shows that ETC can exhibit very complex, even chaotic traffic, especially when the triggering condition is aggressive in reducing communications. First, we characterize limit traffic patterns by observing invariant lines and planes through the origin, as well as their attractivity. Then, we present abstraction-based methods to compute limit metrics, such as limit average and limit inferior inter-sample time (IST) of periodic ETC (PETC), with considerations to the robustness of such metrics, as well as measuring the emergence of chaos. The methodology and tools allow us to find ETC examples that provably outperform periodic sampling in terms of average IST. In particular for PETC, we prove that this requires aperiodic or chaotic traffic.

eess.SY↗

arXiv2021

The Wireless Control Bus: Enabling Efficient Multi-hop Event-Triggered Control with Concurrent Transmissions

Event-triggered control (ETC) holds the potential to significantly improve the efficiency of wireless networked control systems. Unfortunately, its real-world impact has hitherto been hampered by the lack of a network stack able to transfer its benefits from theory to practice specifically by supporting the latency and reliability requirements of the aperiodic communication ETC induces. This is precisely the contribution of this paper. Our Wireless Control Bus (WCB) exploits carefully orchestrated network-wide floods of concurrent transmissions to minimize overhead during quiescent, steady-state periods, and ensures timely and reliable collection of sensor readings and dissemination of actuation commands when an ETC triggering condition is violated. Using a cyber-physical testbed emulating a water distribution system controlled over a real-world multi-hop wireless network, we show that ETC over WCB achieves the same quality of periodic control at a fraction of the energy costs, therefore unleashing and concretely demonstrating its full potential for the first time.

eess.SY↗

arXiv2021

Self-Triggered Control for Near-Maximal Average Inter-Sample Time

Self-triggered control (STC) is a sample-and-hold control method aimed at reducing communications within networked-control systems; however, existing STC mechanisms often maximize how late the next sample is, and as such they do not provide any sampling optimality in the long-term. In this work, we devise a method to construct self-triggered policies that provide near-maximal average inter-sample time (AIST) while respecting given control performance constraints. To achieve this, we rely on finite-state abstractions of a reference event-triggered control, in which early triggers are also allowed. These early triggers constitute controllable actions of the abstraction, for which an AIST-maximizing strategy can be computed by solving a mean-payoff game. We provide optimality bounds, and how to further improve them through abstraction refinement techniques.

eess.SY↗

arXiv2021

Scalable Traffic Models for Scheduling of Linear Periodic Event-Triggered Controllers

This paper addresses the problem of modeling and scheduling the transmissions generated by multiple event-triggered control (ETC) loops sharing a network. We present a method to build a symbolic traffic model of periodic ETC (PETC), which by construction provides an exact simulation of such traffic. The model is made in such a way as to avoid the combinatorial explosion that is typical of symbolic models in many applications. It is augmented with early triggering actions that can be used by a scheduler to mitigate communication conflicts. The complete networked control system is then modeled as a network of timed game automata, for which existing tools can generate a strategy that avoids communication conflicts, while keeping early triggers to a minimum. By construction, our proposed symbolic model is a quotient model of the PETC. It is relatively fast to build, and it generates few to no spurious transitions. We finally demonstrate modeling and scheduling for a numerical example.

eess.SY↗

arXiv2021

Computing the sampling performance of event-triggered control

In the context of networked control systems, event-triggered control (ETC) has emerged as a major topic due to its alleged resource usage reduction capabilities. However, this is mainly supported by numerical simulations, and very little is formally known about the traffic generated by ETC. This work devises a method to estimate, and in some cases to determine exactly, the minimum average inter-sample time (MAIST) generated by periodic event-triggered control (PETC) of linear systems. The method involves abstracting the traffic model using a bisimulation refinement algorithm and finding the cycle of minimum average length in the graph associated to it. This always gives a lower bound to the actual MAIST. Moreover, if this cycle turns out to be related to a periodic solution of the closed-loop PETC system, the performance metric is exact.

eess.SY↗

arXiv2020

Self-Triggered Output-Feedback Control of LTI Systems Subject to Disturbances and Noise

Self-triggered control (STC) and periodic event-triggered control (PETC) are aperiodic sampling techniques aiming at reducing control data communication when compared to periodic sampling. In both techniques, the effects of measurement noise in continuous-time systems with output feedback are unaddressed. In this work we prove that additive noise does not hinder stability of output-feedback PETC of linear time-invariant (LTI) systems. Then we build an STC strategy that estimates PETC's worst-case triggering times. To accomplish this, we use set-based methods, more specifically ellipsoidal sets, which describe uncertainties on state, disturbances and noise. Ellipsoidal reachability is then used to predict worst-case triggering condition violations, ultimately determining the next communication time. The ellipsoidal state estimate is recursively updated using guaranteed state estimation (GSE) methods. The proposed STC is designed to be computationally tractable at the expense of some added conservatism. It is expected to be a practical STC implementation for a broad range of applications.

eess.SY↗