Vladimir Yanovski
Papers
5
Total Citations
281
H-Index
5
About
Vladimir Yanovski is a researcher whose work sits at the intersection of multi-agent systems, swarm robotics, and distributed algorithms. His research explores how groups of simple, resource-limited robots can cooperate to accomplish complex collective tasks — drawing inspiration from the behavior of social insects like ants. Yanovski is perhaps best known for his foundational contributions to the "Cooperative Cleaners" problem, a framework for modeling how minimal robots can systematically cover and clean a domain without centralized control. His 2007 paper on this topic has accumulated 131 citations, establishing it as a key reference in the swarm robotics literature. His earlier work on distributed ant algorithms for network patrolling (2003, 103 citations) similarly shaped the field's understanding of how decentralized agents can efficiently monitor dynamic environments. Yanovski has progressively extended these ideas into more challenging settings, examining how multi-agent systems cope with expanding and dynamically changing domains — work that reflects a consistent drive to bridge theoretical algorithms with practical robotic challenges. His research remains highly relevant for students and practitioners interested in autonomous systems, distributed computing, and bio-inspired approaches to robotics.
Research Focus
Key Achievements
Top Papers
- 1Cooperative Cleaners: A Study in Ant Robotics131 citations · 2007
- 2A Distributed Ant Algorithm for\protect Efficiently Patrolling a Network103 citations · 2003
- 3Multi-agent Cooperative Cleaning of Expanding Domains34 citations · 2010
- 4Covering a Continuous Domain by Distributed, Limited Robots7 citations · 2006
- 5Swarm ant robotics for a dynamic cleaning problem — upper bounds6 citations · 2009