Eliyahu Osherovich
Papers
2
Total Citations
20
H-Index
2
About
Eliyahu Osherovich is a researcher whose work focuses on multi-agent systems, swarm robotics, and distributed algorithms for autonomous coverage problems. His research explores how simple, resource-constrained robotic agents — inspired by the behavior of ants — can collectively and efficiently explore and cover unknown continuous environments without centralized coordination. Osherovich's most recognized contribution is the development of the "Mark-Ant-Walk" algorithm, introduced in his 2008 paper, which has garnered 13 citations. This work demonstrates how ant-like robots equipped with minimal sensing capabilities — specifically the ability to deposit and detect pheromone-like markers — can achieve robust and efficient coverage of continuous domains. The elegance of this approach lies in its simplicity: individual agents follow local rules, yet collectively produce sophisticated exploratory behavior. His earlier 2006 work laid the conceptual groundwork for this framework, addressing the fundamental challenges of distributed coverage with limited robots. Osherovich's research holds particular relevance for applications in search-and-rescue operations, environmental monitoring, and autonomous exploration, where deploying large numbers of inexpensive, simple robots is more practical than relying on a few complex ones. His contributions offer valuable insights into emergent collective intelligence and scalable robotic systems.
Research Focus
Key Achievements
Top Papers
- 1
- 2Covering a Continuous Domain by Distributed, Limited Robots7 citations · 2006