Eduardo Sebastián

Eduardo Sebastián

Auto-generated profile, based on publicly available information

Eduardo Sebastián

Department of Computer Science and Systems Engineering (DIIS) and the Engineering Research Institute of Aragon (I3A), Universidad de Zaragoza, Zaragoza, Spain

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 June 2025 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
ESEduardo Sebastián
Eduardo Sebastián
TDThai Duong
Thai Duong
NANikolay Atanasov
Nikolay Atanasov
EMEduardo Montijano
Eduardo Montijano
CSCarlos Sagues
Carlos Sagues
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 $\times 2$ greater than the state-of-the-art with robot teams $\times 6$ 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.

8 July 2022 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
ESEduardo Sebastian
Eduardo Sebastian
EMEduardo Montijano
Eduardo Montijano
CSCarlos Sagues
Carlos Sagues
This article presents a novel control strategy to herd groups of noncooperative evaders by means of a team of robotic herders. In herding problems, the motion of the evaders is typically determined by strongly nonlinear and heterogeneous reactive dynamics, which makes the development of flexible control solutions a challenging problem. In this context, we propose Implicit Control, an approach that leverages numerical analysis theory to find suitable herding inputs even when the nonlinearities in the evaders’ dynamics yield implicit equations. The intuition behind this methodology consists in driving the input, rather than computing it, toward the unknown value that achieves the desired dynamic behavior of the herd. The same idea is exploited to develop an adaptation law, with stability guarantees, that copes with uncertainties in the herd's models. Moreover, our solution is completed with a novel caging technique based on uncertainty models and control barrier functions, together with a distributed estimator to overcome the need of complete perfect measurements. Different simulations and experiments validate the generality and flexibility of the proposal.

25 May 2021 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
ESEduardo Sebastian
Eduardo Sebastian
EMEduardo Montijano
Eduardo Montijano
EOEstanis Oyarbide
Estanis Oyarbide
CBCarlos Bernal
Carlos Bernal
RGRuben Galvez
Ruben Galvez
This article presents a novel control strategy for a dual active bridge series resonant converter. The strategy seeks to ensure the stability of the converter over its entire dynamic range while enhances the transient response. Both properties allow the use of the converter in new applications, where fast dynamics are required, surpassing the performance of existing feedback loops. Starting from the generalized averaged model of the converter, we propose a nonlinear control strategy by means of Lyapunov's stability theory. After that, we derive a series of modifications in order to implement the strategy in a microcontroller or a DSP, including a sensorless method to tackle the lack of measurements of certain variables and an adaptive control law to deal with uncertain parameters in the model. The strategy is evaluated in simulations and experiments, employing a commercial converter, and comparing the results with other control policies.

17 March 2025 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
DMDiego Martinez-Baselga
Diego Martinez-Baselga
ESEduardo Sebastián
Eduardo Sebastián
EMEduardo Montijano
Eduardo Montijano
LRLuis Riazuelo
Luis Riazuelo
CSCarlos Sagues
Carlos Sagues
LMLuis Montano
Luis Montano
We present AVOCADO (AdaptiVe Optimal Collision Avoidance Driven by Opinion), a novel navigation approach to address holonomic robot collision avoidance when the robot does not know how cooperative the other agents in the environment are. AVOCADO departs from a Velocity Obstacle's (VO) formulation akin to the Optimal Reciprocal Collision Avoidance method. However, instead of assuming reciprocity, it poses an adaptive control problem to adapt to the cooperation level of other robots and agents in real time. This is achieved through a novel nonlinear opinion dynamics design that relies solely on sensor observations. As a by-product, we leverage tools from the opinion dynamics formulation to naturally avoid the deadlocks in geometrically symmetric scenarios that typically suffer VO-based planners. Extensive numerical simulations show that AVOCADO surpasses existing motion planners in mixed cooperative/ non-cooperative navigation environments in terms of success rate, time to goal and computational time. In addition, we conduct multiple real experiments that verify that AVOCADO is able to avoid collisions in environments crowded with other robots and humans.

26 June 2023 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
ESEduardo Sebastián
Eduardo Sebastián
EMEduardo Montijano
Eduardo Montijano
CSCarlos Sagues
Carlos Sagues
MFMauro Franceschelli
Mauro Franceschelli
AGAndrea Gasparri
Andrea Gasparri
This paper presents a novel solution for the discrete time dynamic average consensus problem. Given a set of time-varying input signals over the nodes of an undirected graph, the proposed algorithm tracks, at each node, the input signals’ average. The algorithm is based on a sequence of consensus stages combined with a second order diffusive protocol. The former overcomes the need of k-th order differences of the inputs and conservation of the network state average, while the latter overcomes the trade-off between speed and accuracy of the consensus stages by just storing the previous estimate at each node. The result is a protocol that is fast, arbitrarily accurate, and robust against input noises and initializations. The protocol is extended to an asynchronous and randomized version that follows a gossiping scheme that is robust against potential delays and packet losses. We study the convergence properties of the algorithms and validate them via simulations.

13 May 2024 in IEEE Control Systems Letters
Verified
Journal Article
Open access
ESEduardo Sebastián
Eduardo Sebastián
MFMauro Franceschelli
Mauro Franceschelli
AGAndrea Gasparri
Andrea Gasparri
EMEduardo Montijano
Eduardo Montijano
CSCarlos Sagues
Carlos Sagues
This letter presents a novel accelerated distributed algorithm for unconstrained consensus optimization over static undirected networks. The proposed algorithm combines the benefits of acceleration from momentum, the robustness of the alternating direction method of multipliers, and the computational efficiency of gradient tracking to surpass existing state-of-the-art methods in convergence speed, while preserving their computational and communication cost. First, we prove that, by applying momentum on the average dynamic consensus protocol over the estimates and gradient, we can study the algorithm as an interconnection of two singularly perturbed systems: the outer system connects the consensus variables and the optimization variables, and the inner system connects the estimates of the optimum and the auxiliary optimization variables. Next, we prove that, by adding momentum to the auxiliary dynamics, our algorithm always achieves faster convergence than the achievable linear convergence rate for the non-accelerated alternating direction method of multipliers gradient tracking algorithm case. Through simulations, we numerically show that our accelerated algorithm surpasses the existing accelerated and non-accelerated distributed consensus first-order optimization protocols in convergence speed.