Pavan Poudel
Papers
9
Total Citations
131
H-Index
7
About
Pavan Poudel’s research lies at the intersection of distributed robotics, algorithmic swarm intelligence, and fault-tolerant coordination. His work focuses on fundamental problems such as gathering, scattering, and visibility among autonomous mobile robots operating under limited visibility, asynchronous cycles, and one-axis agreement constraints. Poudel’s most influential contribution is his 2020 paper on fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement (34 citations), which provides a rigorous algorithmic solution for robots to achieve mutual visibility despite failures. He also made significant strides in time-optimal uniform scattering on a grid (28 citations), where he designed a distributed strategy for robots to spread evenly across a grid network. His 2017 work on universally optimal gathering under limited visibility (17 citations) addresses a core challenge in multi-robot coordination. Poudel’s contributions extend to sublinear-time mutual visibility for fat oblivious robots and a 2-approximation algorithm for the online tethered coverage problem. His research is notable for its theoretical depth, practical relevance to robot swarms, and emphasis on optimality and fault tolerance, making him a rising figure in distributed robotic systems.
Research Focus
Key Achievements
Top Papers
- 1
- 2Time-optimal uniform scattering in a grid28 citations · 2019
- 3Universally Optimal Gathering Under Limited Visibility17 citations · 2017
- 4Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots15 citations · 2020
- 5Sublinear-time mutual visibility for fat oblivious robots10 citations · 2019
- 6A 2-Approximation Algorithm for the Online Tethered Coverage Problem9 citations · 2019
- 7
- 8Time-Optimal Gathering under Limited Visibility with One-Axis Agreement6 citations · 2021
- 9Complete Visitability for Autonomous Robots on Graphs4 citations · 2018