3 papers
cs.DM2019
Fast Uniform Dispersion of a Crash-prone Swarm
Michael Amir, Alfred M. Bruckstein
We consider the problem of completely covering an unknown discrete environment with a swarm of asynchronous, frequently-crashing autonomous mobile robots. We represent the environm…
cs.MA2019
Minimizing Travel in the Uniform Dispersal Problem for Robotic Sensors
Michael Amir, Alfred M. Bruckstein
The limited energy capacity of individual robotic agents in a swarm often limits the possible cooperative tasks they can perform. In this work, we investigate the problem of coveri…
math.CO2018
Two Erdős--Hajnal-type Theorems in Hypergraphs
Michal Amir, Asaf Shapira, Mykhaylo Tyomkyn
The Erdős--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph , have homogeneous sets of size significantl…