arXiv subjects

Carlos Sagues

Publications and source records attributed to Carlos Sagues.

At least 19 recordsLinked to original sources

arXiv2026

Super-twisting over networks: A Lyapunov approach for distributed differentiation

We study distributed differentiation, where agents in a networked system estimate the average of local time-varying signals and their derivatives under mild assumptions on the agents' signals and their first and second derivatives. Existing sliding-mode methods provide only local stability guarantees and lack systematic gain selection. By isolating the structural features shared with the super-twisting algorithm and encoding them into an abstract model, we construct a Lyapunov function enabling systematic gain design and proving global finite-time convergence to consensus for the distributed differentiator. Building on this framework, we develop an event-triggered hybrid system implementation using time-varying and state dependent threshold rules and derive minimum inter-event time guarantees and accuracy bounds that quantify the trade-off between estimation accuracy and communication effort.

eess.SY↗

arXiv2025

A Note on Optimal Distributed State Estimation for Linear Time-Varying Systems

In this technical note, we prove that the ODEFTC algorithm constitutes the first optimal distributed state estimator for continuous-time linear time-varying systems subject to stochastic disturbances. Particularly, we formally show that it is able to asymptotically recover the performance, in terms of error covariance of the estimates at each node, of the centralized Kalman-Bucy filter, which is known to be the optimal filter for the considered class of systems. Moreover, we provide a simple sufficient value for the consensus gain to guarantee the stability of the distributed estimator.

math.OC↗

arXiv2024

NN-ETM: Enabling safe neural network-based event-triggering mechanisms for consensus problems

Event-triggering mechanisms (ETM) have been developed for consensus problems to reduce communication while ensuring performance guarantees, but their design has grown increasingly complex by incorporating the agent's local and neighbor information. This typically results in ad-hoc solutions, which may only work for the consensus protocol under consideration. We aim to safely incorporate neural networks in the ETM to provide a general solution while guaranteeing performance. To decouple the stability analysis of the consensus protocol from the abstraction of the neural network, we derive design criteria for the consensus and ETM pair, allowing independent analysis of each element under mild constraints. Then, we propose NN-ETM, a novel ETM featuring a neural network, to optimize communication while preserving the stability guarantees of the consensus protocol.

eess.SY↗

arXiv2024

An Audio-Based Iterative Controller for Soft Landing of Electromechanical Relays

Electromechanical relays and contactors suffer from strong collisions at the end of the switching operations. This causes several undesirable phenomena, such as clicking, mechanical wear and contact bounce. Thus, there is great interest in mitigating these switching impacts while keeping the advantageous features of these devices. This paper proposes a complete control strategy for soft landing. The control structure includes three main components. The first one is a real-time flux-tracking feedback controller, which presents several advantages over voltage or current control. The second one is a feedforward controller, which computes the flux reference signal based on a proposed dynamical model and the desired position trajectory for the switching operations. Lastly, the third control component is a learning-type run-to-run adaptation law that iteratively adapts the model parameters based on an audio signal. It exploits the repetitive nature of these devices in order to circumvent modeling discrepancies due to unit-to-unit variability or small changes between operations. The effectiveness of the proposed control is demonstrated through various experiments.

eess.SY↗

arXiv2024

Probability-Based Optimal Control Design for Soft Landing of Short-Stroke Actuators

The impact forces during switching operations of short-stroke actuators may cause bouncing, audible noise and mechanical wear. The application of soft-landing control strategies to these devices aims at minimizing the impact velocities of their moving components to ultimately improve their lifetime and performance. In this paper, a novel approach for soft-landing trajectory planning, including probability functions, is proposed for optimal control of the actuators. The main contribution of the proposal is that it considers uncertainty in the contact position and hence the obtained trajectories are more robust against system uncertainties. The problem is formulated as an optimal control problem and transformed into a two-point boundary value problem for its numerical resolution. Simulated and experimental tests have been performed using a dynamic model and a commercial short-stroke solenoid valve. The results show a significant improvement in the expected velocities and accelerations at contact with respect to past solutions in which the contact position is assumed to be perfectly known.

eess.SY↗

arXiv2024

Real-Time Electromagnetic Estimation for Reluctance Actuators

Several modeling, estimation, and control strategies have been recently presented for simple reluctance devices like solenoid valves and electromagnetic switches. In this paper, we present a new algorithm to online estimate the flux linkage and the electrical time-variant parameters of these devices, namely the resistance and the inductance, only by making use of discrete-time measurements of voltage and current. The algorithm, which is robust against measurement noise, is able to deal with temperature variations of the device and provides accurate estimations during the motion of the armature. Additionally, an integral {estimator} that uses the start of each operation of the actuator as reset condition has been also implemented for comparative purposes. The performances of both estimation methods are studied and compared by means of simulations and experimental tests, and the benefits of our proposal are emphasized. Possible uses of the estimates and further modeling developments are also described and discussed.

eess.SY↗

arXiv2024

Hybrid Dynamical Model for Reluctance Actuators Including Saturation, Hysteresis and Eddy Currents

A novel hybrid dynamical model for single-coil, short-stroke reluctance actuators is presented in this paper. The model, which is partially based on the principles of magnetic equivalent circuits, includes the magnetic phenomena of hysteresis and saturation by means of the generalized Preisach model. In addition, the eddy currents induced in the iron core are also considered, and the flux fringing effect in the air is incorporated by using results from finite element simulations. An explicit solution of the dynamics without need of inverting the Preisach model is derived, and the hybrid automaton that results from combining the electromagnetic and motion equations is presented and discussed. Finally, an identification method to determine the model parameters is proposed and experimentally illustrated on a real actuator. The results are presented and the advantages of our modeling method are emphasized.

eess.SY↗

arXiv2024

Run-to-Run Control With Bayesian Optimization for Soft Landing of Short-Stroke Reluctance Actuators

There is great interest in minimizing the impact forces of reluctance actuators during commutations, in order to reduce contact bouncing, acoustic noise and mechanical wear. In this regard, a run-to-run control algorithm is proposed to decrease the contact velocity, by exploiting the repetitive operations of these devices. The complete control is presented, with special focus on the optimization method and the input definition. The search method is based on Bayesian optimization, and several additions are introduced for its application in run-to-run control, e.g. the removal of stored points and the definition of a new acquisition function. Additionally, methods for the input parametrization and dimension reduction are presented. For analysis, Monte Carlo simulations are performed using a dynamic model of a commercial solenoid valve, comparing the proposed search method with two alternatives. Furthermore, the control strategy is validated through experimental testing, using several devices from the same ensemble of solenoid valves.

eess.SY↗

arXiv2024

Intermittent Connectivity Maintenance With Heterogeneous Robots

We consider a scenario of cooperative task servicing, with a team of heterogeneous robots with different maximum speeds and communication radii, in charge of keeping the network intermittently connected. We abstract the task locations into a $1D$ cycle graph that is traversed by the communicating robots, and we discuss intermittent communication strategies so that each task location is periodically visited, with a worst--case revisiting time. Robots move forward and backward along the cycle graph, exchanging data with their previous and next neighbors when they meet, and updating their region boundaries. Asymptotically, each robot is in charge of a region of the cycle graph, depending on its capabilities. The method is distributed, and robots only exchange data when they meet.

cs.RO↗

arXiv2023

Physics-Informed Multi-Agent Reinforcement Learning for Distributed Multi-Robot Problems

The networked nature of multi-robot systems presents challenges in the context of multi-agent reinforcement learning. Centralized control policies do not scale with increasing numbers of robots, whereas independent control policies do not exploit the information provided by other robots, exhibiting poor performance in cooperative-competitive tasks. In this work we propose a physics-informed reinforcement learning approach able to learn distributed multi-robot control policies that are both scalable and make use of all the available information to each robot. Our approach has three key characteristics. First, it imposes a port-Hamiltonian structure on the policy representation, respecting energy conservation properties of physical robot systems and the networked nature of robot team interactions. Second, it uses self-attention to ensure a sparse policy representation able to handle time-varying information at each robot from the interaction graph. Third, we present a soft actor-critic reinforcement learning algorithm parameterized by our self-attention port-Hamiltonian control policy, which accounts for the correlation among robots during training while overcoming the need of value function factorization. Extensive simulations in different multi-robot scenarios demonstrate the success of the proposed approach, surpassing previous multi-robot reinforcement learning solutions in scalability, while achieving similar or superior performance (with averaged cumulative reward up to x2 greater than the state-of-the-art with robot teams x6 larger than the number of robots at training time). We also validate our approach on multiple real robots in the Georgia Tech Robotarium under imperfect communication, demonstrating zero-shot sim-to-real transfer and scalability across number of robots.

cs.RO↗

arXiv2023

Event-Triggered Consensus for Continuous-Time Distributed Estimation

Distributed sensor networks have gained interest thanks to the developments in processing power and communications. Event-triggering mechanisms can be useful in reducing communication between the nodes of the network, while still ensuring an adequate behaviour of the system. However, very little attention has been given to continuous-time systems in this context. In this work, we propose a strategy for distributed state estimation in sensor networks, based on average dynamic consensus of the continuous measurements. While communication between nodes is discrete and heavily reduced due to the event-triggering mechanism, our method ensures that the nodes are still able to produce a continuous estimate of the global average measurement and the state of the plant, within some tuneable error bounds.

eess.SY↗

arXiv2023

Learning to Identify Graphs from Node Trajectories in Multi-Robot Networks

The graph identification problem consists of discovering the interactions among nodes in a network given their state/feature trajectories. This problem is challenging because the behavior of a node is coupled to all the other nodes by the unknown interaction model. Besides, high-dimensional and nonlinear state trajectories make it difficult to identify if two nodes are connected. Current solutions rely on prior knowledge of the graph topology and the dynamic behavior of the nodes, and hence, have poor generalization to other network configurations. To address these issues, we propose a novel learning-based approach that combines (i) a strongly convex program that efficiently uncovers graph topologies with global convergence guarantees and (ii) a self-attention encoder that learns to embed the original state trajectories into a feature space and predicts appropriate regularizers for the optimization program. In contrast to other works, our approach can identify the graph topology of unseen networks with new configurations in terms of number of nodes, connectivity or state trajectories. We demonstrate the effectiveness of our approach in identifying graphs in multi-robot formation and flocking tasks.

eess.SY↗

arXiv2023

Distributed outer approximation of the intersection of ellipsoids

The outer Lowner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices modeling the quality of each sensor. We propose a distributed algorithm to solve this problem when these matrices are defined over the network's nodes. This is of particular significance as it is the first decentralized algorithm capable of computing the covariance intersection ellipsoid by combining information from the entire network using only local interactions. The solution is based on a reformulation of the centralized problem, leading to a local protocol based on exact dynamic consensus tools. After reaching consensus, the protocol converges to an outer Lowner-John ellipsoid in finite time, and to the global optimum asymptotically. Formal convergence analysis and numerical experiments are provided to validate the proposal's advantages.

eess.SY↗

arXiv2023

LEMURS: Learning Distributed Multi-Robot Interactions

This paper presents LEMURS, an algorithm for learning scalable multi-robot control policies from cooperative task demonstrations. We propose a port-Hamiltonian description of the multi-robot system to exploit universal physical constraints in interconnected systems and achieve closed-loop stability. We represent a multi-robot control policy using an architecture that combines self-attention mechanisms and neural ordinary differential equations. The former handles time-varying communication in the robot team, while the latter respects the continuous-time robot dynamics. Our representation is distributed by construction, enabling the learned control policies to be deployed in robot teams of different sizes. We demonstrate that LEMURS can learn interactions and cooperative behaviors from demonstrations of multi-agent navigation and flocking tasks.

eess.SY↗

arXiv2022

Event-based Visual Tracking in Dynamic Environments

Visual object tracking under challenging conditions of motion and light can be hindered by the capabilities of conventional cameras, prone to producing images with motion blur. Event cameras are novel sensors suited to robustly perform vision tasks under these conditions. However, due to the nature of their output, applying them to object detection and tracking is non-trivial. In this work, we propose a framework to take advantage of both event cameras and off-the-shelf deep learning for object tracking. We show that reconstructing event data into intensity frames improves the tracking performance in conditions under which conventional cameras fail to provide acceptable results.

cs.CV↗

arXiv2022

Multi-robot Implicit Control of Massive Herds

This paper solves the problem of herding countless evaders by means of a few robots. The objective is to steer all the evaders towards a desired tracking reference while avoiding escapes. The problem is very challenging due to the highly complex repulsive evaders' dynamics and the underdetermined states to control. We propose a solution that is based on Implicit Control and a novel dynamic assignment strategy to select the evaders to be directly controlled. The former is a general technique that explicitly computes control inputs even in highly complex input-nonaffine dynamics. The latter is built upon a convex-hull dynamic clustering inspired by the Voronoi tessellation problem. The combination of both allows to choose the best evaders to directly control, while the others are indirectly controlled by exploiting the repulsive interactions among them. Simulations show that massive herds can be herd throughout complex patterns by means of a few herders.

eess.SY↗

arXiv2022

On the Stability of Electromechanical Switching Devices

Electromagnetic relays and solenoid actuators are commonly used for their bistable behavior, which allows for switching between two states in electrical, pneumatic, or hydraulic circuits, among other applications. Although there has been extensive research on modeling, estimation, and control of these electromechanical systems, a gap remains in the analysis area. This paper addresses this gap by presenting an equilibrium and stability analysis to gain deeper insight into their bistability. This analysis leverages a hybrid dynamical model to obtain analytical expressions that relate the physical parameters to the switching conditions. These expressions are useful, e.g., for fundamental understanding, quick analyses, or design optimization. The results are discussed in depth and potential practical applications are explored. Finally, the analysis is validated with experimental results from a real device.

eess.SY↗

arXiv2012

Distributed Multi-view Matching in Networks with Limited Communications

We address the problem of distributed matching of features in networks with vision systems. Every camera in the network has limited communication capabilities and can only exchange local matches with its neighbors. We propose a distributed algorithm that takes these local matches and computes global correspondences by a proper propagation in the network. When the algorithm finishes, each camera knows the global correspondences between its features and the features of all the cameras in the network. The presence of spurious introduced by the local matcher may produce inconsistent global correspondences, which are association paths between features from the same camera. The contributions of this work are the propagation of the local matches and the detection and resolution of these inconsistencies by deleting local matches. Our resolution algorithm considers the quality of each local match, when this information is provided by the local matcher. We formally prove that after executing the algorithm, the network finishes with a global data association free of inconsistencies. We provide a fully decentralized solution to the problem which does not rely on any particular communication topology. Simulations and experimental results with real images show the performance of the method considering different features, matching functions and scenarios.

cs.CV↗