research
∙
06/15/2022
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
We consider a swarm of n robots in a d-dimensional Euclidean space. The ...
share
research
∙
05/23/2022
The k-Server with Preferences Problem
The famous k-Server Problem covers plenty of resource allocation scenari...
research
∙
09/24/2021
The Max-Line-Formation Problem
We consider n robots with limited visibility: each robot can observe oth...
research
∙
10/09/2020
Gathering in Linear Time: A Closed Chain of Disoriented Luminous Robots with Limited Visibility
This work focuses on the following question related to the Gathering pro...
research
∙
10/05/2020
A Discrete and Continuous Study of the Max-Chain-Formation Problem
Most existing robot formation problems seek a target formation of a cert...
research
∙
05/17/2020
The Online Multi-Commodity Facility Location Problem
We consider a natural extension to the metric uncapacitated Facility Loc...
research
∙
05/13/2020
