activity
20142026
most citedGraduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejection

332 citations · 376 across the 32 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

eess.SY2023

Leveraging Untrustworthy Commands for Multi-Robot Coordination in Unpredictable Environments: A Bandit Submodular Maximization Approach

Zirui Xu, Xiaofeng Lin, Vasileios Tzoumas

We study the problem of multi-agent coordination in unpredictable and partially-observable environments with untrustworthy external commands. The commands are actions suggested to…

eess.SY2023

Safe Non-Stochastic Control of Control-Affine Systems: An Online Convex Optimization Approach

Hongyu Zhou, Yichen Song, Vasileios Tzoumas

We study how to safely control nonlinear control-affine systems that are corrupted with bounded non-stochastic noise, i.e., noise that is unknown a priori and that is not necessari…

eess.SY2023

Safe Non-Stochastic Control of Linear Dynamical Systems

Hongyu Zhou, Vasileios Tzoumas

We study the problem of \textit{safe control of linear dynamical systems corrupted with non-stochastic noise}, and provide an algorithm that guarantees (i) zero constraint violatio…

eess.SY2023

Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments

Zirui Xu, Xiaofeng Lin, Vasileios Tzoumas

We study the problem of multi-agent coordination in unpredictable and partially observable environments, that is, environments whose future evolution is unknown a priori and that c…

cs.LG2023★ 1 cited

Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control

Hongyu Zhou, Zirui Xu, Vasileios Tzoumas

Projection operations are a typical computation bottleneck in online learning. In this paper, we enable projection-free online learning within the framework of Online Convex Optimi…