arXiv subjects

David Gomez-Gutierrez

Publications and source records attributed to David Gomez-Gutierrez.

4 recordsLinked to original sources

arXiv2026

Hierarchical parameter estimation for distributed networked systems: a dynamic consensus approach

This work introduces a novel two-stage distributed framework to globally estimate constant parameters in a networked system, separating shared information from local estimation. The first stage uses dynamic average consensus to aggregate agents' measurements into surrogates of centralized data. Using these surrogates, the second stage implements a local estimator to determine the parameters. By designing an appropriate consensus gain, the persistence of excitation of the regressor matrix is achieved, and thus, exponential convergence of a local Gradient Estimator (GE) is guaranteed. The framework facilitates its extension to switched network topologies, quantization, and the heterogeneous substitution of the GE with a Dynamic Regressor Extension and Mixing (DREM) estimator, which supports relaxed excitation requirements.

eess.SY↗

arXiv2025

Optimal robust exact first-order differentiators with Lipschitz continuous output

The signal differentiation problem involves the development of algorithms that allow to recover a signal's derivatives from noisy measurements. This paper develops a first-order differentiator with the following combination of properties: robustness to measurement noise, exactness in the absence of noise, optimal worst-case differentiation error, and Lipschitz continuous output where the output's Lipschitz constant is a tunable parameter. This combination of advantageous properties is not shared by any existing differentiator. Both continuous-time and sample-based versions of the differentiator are developed and theoretical guarantees are established for both. The continuous-time version of the differentiator consists in a regularized and sliding-mode-filtered linear adaptive differentiator. The sample-based, implementable version is then obtained through appropriate discretization. An illustrative example is provided to highlight the features of the developed differentiator.

eess.SY↗

arXiv2025

Exact Leader Estimation: A New Approach for Distributed Differentiation

A novel strategy aimed at cooperatively differentiating a signal among multiple interacting agents is introduced, where none of the agents needs to know which agent is the leader, i.e. the one producing the signal to be differentiated. Every agent communicates only a scalar variable to its neighbors; except for the leader, all agents execute the same algorithm. The proposed strategy can effectively obtain derivatives up to arbitrary $m$-th order in a finite time under the assumption that the $(m+1)$-th derivative is bounded. The strategy borrows some of its structure from the celebrated homogeneous robust exact differentiator by A. Levant, inheriting its exact differentiation capability and robustness to measurement noise. Hence, the proposed strategy can be said to perform robust exact distributed differentiation. In addition, and for the first time in the distributed leader-observer literature, sampled-data communication and bounded measurement noise are considered, and corresponding steady-state worst-case accuracy bounds are derived. The effectiveness of the proposed strategy is verified numerically for second- and fourth-order systems, i.e., for estimating derivatives of up to first and third order, respectively.

eess.SY↗

arXiv2023

Implementing prescribed-time convergent control: sampling and robustness

According to recent results, convergence in a prespecified or prescribed finite time can be achieved under extreme model uncertainty if control is applied continuously over time. This paper shows that this extreme amount of uncertainty cannot be tolerated under sampling, not even if sampling could become infinitely frequent as the deadline is approached, unless the sampling strategy were designed according to the growth of the control action. Robustness under model uncertainty is analyzed and the amount of uncertainty that can be tolerated under sampling is quantified in order to formulate the least restrictive prescribed-time control problem that is practically implementable. Some solutions to this problem are given for a scalar system. Moreover, either under a-priori knowledge of bounds for initial conditions, or if the strategy can be selected after the first measurement becomes available, it is shown that the real, practically achievable objectives can also be reached with linear time-invariant control and uniform sampling. These derivations serve to yield insight into the real advantages that implementation of prescribed-time controllers may have.

eess.SY↗