research
∙
05/19/2023
Meeting Times of Non-atomic Random Walks
In this paper, we revisit the problem of classical meeting times of rand...
share
research
∙
04/12/2023
Stand-Up Indulgent Gathering on Lines
We consider a variant of the crash-fault gathering problem called stand-...
research
∙
02/07/2023
Stand Up Indulgent Gathering
We consider a swarm of mobile robots evolving in a bidimensional Euclide...
research
∙
11/25/2022
Fault-Tolerant Offline Multi-Agent Path Planning
We study a novel graph path planning problem for multiple agents that ma...
research
∙
05/10/2022
QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator
We present QUANTAS: a simulator that enables quantitative performance an...
research
∙
05/04/2022
Constrained Backward Time Travel Planning is in P
We consider transportation networks that are modeled by dynamic graphs, ...
research
∙
05/20/2021
Unreliable Sensors for Reliable Efficient Robots
The vast majority of existing Distributed Computing literature about mob...
research
∙
04/08/2021
Practical Byzantine Reliable Broadcast on Partially Connected Networks
In this paper, we consider the Byzantine reliable broadcast problem on a...
research
∙
01/18/2021
Computer Aided Formal Design of Swarm Robotics Algorithms
Previous works on formally studying mobile robotic swarms consider neces...
research
∙
01/14/2021
Asynchronous Gathering in a Torus
We consider the gathering problem for asynchronous and oblivious robots ...
research
∙
12/07/2020
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids
We consider the problem of constructing a maximum independent set with m...
research
∙
11/17/2020
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs
In this paper, we focus on the uniform bipartition problem in the popula...
research
∙
10/09/2020
Stand Up Indulgent Rendezvous
We consider two mobile oblivious robots that evolve in a continuous Eucl...
research
∙
07/31/2020
Quixo Is Solved
Quixo is a two-player game played on a 5×5 grid where the players try to...
research
∙
02/13/2020
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links
Self-stabilizing protocols enable distributed systems to recover correct...
research
∙
11/12/2019
Gathering on Rings for Myopic Asynchronous Robots with Lights
We investigate gathering algorithms for asynchronous autonomous mobile r...
research
∙
07/23/2019
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space
The paper details the first successful attempt at using model-checking t...
research
∙
05/22/2019
Asynchronous Scattering
In this paper, we consider the problem of scattering a swarm of mobile o...
research
∙
03/21/2019
Multi-hop Byzantine Reliable Broadcast Made Practical
We revisit Byzantine tolerant reliable broadcast algorithms in multi-hop...
research
∙
11/05/2018
Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures
Ensuring reliable communication despite possibly malicious participants ...
research
∙
05/10/2018
Ring Exploration with Myopic Luminous Robots
We investigate exploration algorithms for autonomous mobile robots evolv...
research
∙
08/21/2017
Optimally Gathering Two Robots
We present an algorithm that ensures in finite time the gathering of two...
research
∙
06/16/2017
Concurrent Geometric Multicasting
We present MCFR, a multicasting concurrent face routing algorithm that u...
research
∙
08/02/2016