Costas Busch

About

Costas Busch is a leading researcher in distributed robotics and algorithmic swarm intelligence, whose work has fundamentally advanced the coordination of autonomous mobile robots under constrained communication and visibility. His primary research areas include the **Complete Visibility** and **Mutual Visibility** problems, where he has pioneered efficient algorithms for enabling robots to see all others despite obstructed lines of sight. Busch’s major contributions lie in developing time-optimal and color-optimal solutions for robots equipped with colored lights, achieving **logarithmic-time** and **O(1)-time** complete visibility—landmark results that have garnered over 180 citations collectively. His 2015 paper on "Mutual Visibility with an Optimal Number of Colors" (43 citations) and his 2016 work on "Complete Visibility for Robots with Lights in O(1) Time" (41 citations) are particularly influential, establishing new benchmarks for speed and resource efficiency. Busch has also tackled the challenging domain of **fat robots** (robots with physical extent), demonstrating how to achieve visibility without collisions. His work is notable for its tight theoretical analysis and practical applicability, making him a key figure in the distributed robotics community.

Research Focus

Key Achievements

Top Papers

1. 1
   Mutual Visibility with an Optimal Number of Colors

   43 citations · 2015
2. 2
   Complete Visibility for Robots with Lights in O(1) Time

   41 citations · 2016
3. 3
   Logarithmic-Time Complete Visibility for Robots with Lights

   37 citations · 2015
4. 4
   O(log N)-Time Complete Visibility for Asynchronous Robots with Lights

   24 citations · 2017
5. 5
   The Complete Visibility Problem for Fat Robots with Lights

   18 citations · 2018
6. 6
   Tight Analysis of a Collisionless Robot Gathering Algorithm

   13 citations · 2017
7. 7
   Bounds on mutual visibility algorithms

   11 citations · 2015
8. 8
   Brief Announcement

   10 citations · 2017
9. 9
   How to Make Fat Autonomous Robots See all Others Fast?

   6 citations · 2018
10. 10
    Complete Visibility for Oblivious Robots in $$\mathcal{O}(N)$$ Time

    2 citations · 2019

Key Collaborators

Contact & Links