Eyal Regev

Papers

Total Citations

H-Index

About

Eyal Regev is a researcher whose work lies at the intersection of distributed robotics, stochastic processes, and cooperative multi-agent systems. His most-cited paper, "The Cooperative Cleaners Problem in Stochastic Dynamic Environments" (2012, 8 citations), explores the strengths and limitations of collaborative teams of simple agents, specifically "ant robots," tasked with covering a connected region on a grid that expands unpredictably. This work addresses fundamental challenges in coordinating autonomous agents under uncertainty, where the environment's area is unknown and evolves stochastically. Regev’s contributions provide insights into efficient coverage strategies, balancing exploration, and task allocation among minimalistic robots—a problem with applications in search-and-rescue, environmental monitoring, and swarm robotics. While his citation count reflects a focused, niche impact, his research advances theoretical foundations for resilient, decentralized systems. Regev’s work is notable for bridging algorithmic theory and practical robotics, offering a framework for designing robust multi-agent teams in dynamic, real-world settings. For students and researchers, his studies illuminate the delicate interplay between simplicity, cooperation, and adaptability in autonomous systems.