Minimizing Travel in the Uniform Dispersal Problem for Robotic Sensors. - Michael Amir; Alfred M. Bruckstein (AAMAS, 2019)

Fast and Reliable Dispersal of Crash-Prone Agents on Graphs. - Michael Amir; Alfred M. Bruckstein (CoRR, 2019)

Probabilistic pursuits on graphs. - Michael Amir; Alfred M. Bruckstein (Theor. Comput. Sci., 2019)

Fast Uniform Dispersion of a Crash-prone Swarm. - Michael Amir; Freddy M. Bruckstein (Robotics: Science and Systems, 2020)

A Discrete Model of Collective Marching on Rings. - Michael Amir; Noa Agmon; Alfred M. Bruckstein (DARS, 2021)

"What to Do With Two Lanes?": Optimal Physical Sorting of Mobile Vehicles. - Dmitry Rabinovich; Michael Amir (CoRR, 2021)

Stigmergy-based, Dual-Layer Coverage of Unknown Indoor Regions. - Ori Rappel; Michael Amir; Alfred M. Bruckstein (CoRR, 2022)

A Locust-Inspired Model of Collective Marching on Rings. - Michael Amir; Noa Agmon; Alfred M. Bruckstein (Entropy, 2022)

Stigmergy-based, Dual-Layer Coverage of Unknown Regions. - Ori Rappel; Michael Amir; Alfred M. Bruckstein (AAMAS, 2023)

Multi-Agent Distributed and Decentralized Geometric Task Allocation. - Michael Amir; Yigal Koifman; Yakov Bloch; Ariel Barel; Alfred M. Bruckstein (CDC, 2023)

Competitive Ant Coverage: The Value of Pursuit. - Alon Shats; Michael Amir; Noa Agmon (IROS, 2023)

Patrolling Grids with a Bit of Memory. - Michael Amir; Dmitry Rabinovich; Alfred M. Bruckstein (CoRR, 2023)

Optimally reordering mobile agents on parallel rows. - Dmitry Rabinovich; Michael Amir; Alfred M. Bruckstein (Theor. Comput. Sci., 2024)

Time, Travel, and Energy in the Uniform Dispersion Problem. - Michael Amir; Alfred M. Bruckstein (IEEE Trans. Robotics, 2025)

When Is Diversity Rewarded in Cooperative Multi-Agent Learning? - Michael Amir; Matteo Bettini; Amanda Prorok (CoRR, 2025)

ReCoDe: Reinforcement Learning-based Dynamic Constraint Design for Multi-Agent Coordination. - Michael Amir; Guang Yang 018; Zhan Gao; Keisuke Okumura 001; Heedo Woo; Amanda Prorok (CoRR, 2025)