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

22 citations · 76 across the 12 of their papers we have counts for

collaborators
Showing eess.SYShow all

9 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.SY20243 cited

Perception-latency aware distributed target tracking

Rodrigo Aldana-López, Rosario Aragüés, Carlos Sagüés

This work is devoted to the problem of distributed target tracking when a team of robots detect the target through a variable perception-latency mechanism. A reference for the robo…

eess.SY2024

PLATE: A perception-latency aware estimator,

Rodrigo Aldana-López, Rosario Aragüés, Carlos Sagüés

Target tracking is a popular problem with many potential applications. There has been a lot of effort on improving the quality of the detection of targets using cameras through dif…

eess.SY20244 cited

Latency vs precision: Stability preserving perception scheduling

Rodrigo Aldana-López, Rosario Aragüés, Carlos Sagüés

In robotic systems, perception latency is a term that refers to the computing time measured from the data acquisition to the moment in which perception output is ready to be used t…

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…