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

35 papers

cs.RO2026

ScaffoldM3C: A Multimodal Sequential Monte Carlo Framework for Generative Stable Construction Planning

Gadiel Sznaier Camps, Chengyang He, Guillaume Sartoretti +2

Autonomously constructing physically realizable 3D structures remains a significant challenge due to combinatorial action spaces, interchangeable components, equifinal assembly seq…

cs.RO2025

Curriculum Imitation Learning of Distributed Multi-Robot Policies

Jesús Roche, Eduardo Sebastián, Eduardo Montijano

Learning control policies for multi-robot systems (MRS) remains a major challenge due to long-term coordination and the difficulty of obtaining realistic training data. In this wor…

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…

cs.RO2024

Gen-Swarms: Adapting Deep Generative Models to Swarms of Drones

Carlos Plou, Pablo Pueyo, Ruben Martinez-Cantin +3

Gen-Swarms is an innovative method that leverages and combines the capabilities of deep generative models with reactive navigation algorithms to automate the creation of drone show…

cs.RO2024★ 4 cited

AVOCADO: Adaptive Optimal Collision Avoidance driven by Opinion

Diego Martinez-Baselga, Eduardo Sebastián, Eduardo Montijano +3

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…

math.OC2024

Accelerated Alternating Direction Method of Multipliers Gradient Tracking for Distributed Optimization

Eduardo Sebastián, Mauro Franceschelli, Andrea Gasparri +2

This paper presents a novel accelerated distributed algorithm for unconstrained consensus optimization over static undirected networks. The proposed algorithm combines the benefits…