activity
20172026
most citedProbabilistic Pursuits on Graphs

5 citations · 6 across the 7 of their papers we have counts for

collaborators

12 papers

math.GR2026

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…

cs.RO2024

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…

cs.RO2023

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…

cs.MA2022

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…

cs.MA2022

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…

cs.DM2021

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…