activity
20112026
most citedEquitable Persistent Coverage of Non-Convex Environments with Graph-Based Planning

22 citations · 64 across the 31 of their papers we have counts for

collaborators
Showing eess.SYShow all

11 papers · 1 filter

eess.SY2025

Policy Gradient with Self-Attention for Model-Free Distributed Nonlinear Multi-Agent Games

Eduardo Sebastián, Maitrayee Keskar, Eeman Iqbal +3

Multi-agent games in dynamic nonlinear settings are challenging due to the time-varying interactions among the agents and the non-stationarity of the (potential) Nash equilibria. I…

eess.SY2023

ECO-DKF: Event-Triggered and Certifiable Optimal Distributed Kalman Filter under Unknown Correlations

Eduardo Sebastián, Eduardo Montijano, Carlos Sagüés

This paper presents ECO-DKF, the first Event-Triggered and Certifiable Optimal Distributed Kalman Filter. Our algorithm addresses two major issues inherent to Distributed Kalman Fi…

eess.SY2023

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

Eduardo Sebastian, Thai Duong, Nikolay Atanasov +2

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 b…

eess.SY2023★ 1 cited

Distributed outer approximation of the intersection of ellipsoids

Rodrigo Aldana-Lopez, Eduardo Sebastian, Rosario Aragues +2

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…

eess.SY2022

Multi-robot Implicit Control of Massive Herds

Eduardo Sebastian, Eduardo Montijano, Carlos Sagues

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 e…

eess.SY2022

LEMURS: Learning Distributed Multi-Robot Interactions

Eduardo Sebastian, Thai Duong, Nikolay Atanasov +2

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 m…

eess.SY2022

Adaptive Multi-robot Implicit Control of Heterogeneous Herds

Eduardo Sebastián, Eduardo Montijano, Carlos Sagüés

This paper presents a novel control strategy to herd groups of non-cooperative evaders by means of a team of robotic herders. In herding problems, the motion of the evaders is typi…

eess.SY2021

All-in-one: Certifiable Optimal Distributed Kalman Filter under Unknown Correlations

Eduardo Sebastián, Eduardo Montijano, Carlos Sagüés

The optimal fusion of estimates in a Distributed Kalman Filter (DKF) requires tracking of the complete network error covariance, problematic in terms of memory and communication. A…

eess.SY2020

Multi-robot Implicit Control of Herds

Eduardo Sebastián, Eduardo Montijano

This paper presents a novel control strategy to herd a group of non-cooperative evaders by means of a team of robotic herders. In herding problems, the motion of the evaders is typ…

eess.SY2019★ 14 cited

Distributed estimation and control of node centrality in undirected asymmetric networks

Eduardo Montijano, Gabriele Oliva, Andrea Gasparri

Measures of node centrality that describe the importance of a node within a network are crucial for understanding the behavior of social networks and graphs. In this paper, we addr…

eess.SY2011

Chebyshev Polynomials in Distributed Consensus Applications

Eduardo Montijano, Juan I. Montijano, Carlos Sagues

In this paper we analyze the use of Chebyshev polynomials in distributed consensus applications. We study the properties of these polynomials to propose a distributed algorithm tha…