5 citations · 6 across the 7 of their papers we have counts for
12 papers
Simple Lattices in Products of Davis Complexes
Michal Amir, Nir Lazarovich
Burger and Mozes (1997) constructed the first examples of simple uniform lattices in products of trees. In this paper, we construct simple uniform lattices in products of certain D…
Time, Travel, and Energy in the Uniform Dispersion Problem
Michael Amir, Alfred M. Bruckstein
We investigate the algorithmic problem of uniformly dispersing a swarm of robots in an unknown, gridlike environment. In this setting, our goal is to study the relationships betwee…
Patrolling Grids with a Bit of Memory
Michael Amir, Dmitry Rabinovich, Alfred M. Bruckstein
This work addresses the challenge of patrolling regular grid graphs of any dimension using a single mobile agent with minimal memory and limited sensing range. We show that it is i…
Multi-Agent Distributed and Decentralized Geometric Task Allocation
Michael Amir, Yigal Koifman, Yakov Bloch +2
We consider the general problem of geometric task allocation, wherein a large, decentralised swarm of simple mobile agents must detect the locations of tasks in the plane and posit…
Stigmergy-based, Dual-Layer Coverage of Unknown Indoor Regions
Ori Rappel, Michael Amir, Alfred M. Bruckstein
We present algorithms for uniformly covering an unknown indoor region with a swarm of simple, anonymous and autonomous mobile agents. The exploration of such regions is made diffic…
Optimal Physical Sorting of Mobile Agents
Dmitry Rabinovich, Michael Amir, Alfred M. Bruckstein
Given a collection of red and blue mobile agents located on two grid rows, we seek to move all the blue agents to the far left side and all the red agents to the far right side, th…
A Discrete Model of Collective Marching on Rings
Michael Amir, Noa Agmon, Alfred M. Bruckstein
We study the collective motion of autonomous mobile agents on a ringlike environment. The agents' dynamics is inspired by known laboratory experiments on the dynamics of locust swa…
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…
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…
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…
Probabilistic Pursuits on Graphs
Michael Amir, Alfred M. Bruckstein
We consider discrete dynamical systems of "ant-like" agents engaged in a sequence of pursuits on a graph environment. The agents emerge one by one at equal time intervals from a so…
Ramsey-nice families of graphs
Ron Aharoni, Noga Alon, Michal Amir +5
For a finite family of fixed graphs let be the smallest integer for which every -coloring of the edges of the complete graph yields a…