2 citations · 3 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DC2016
Convergence of Even Simpler Robots without Location Information
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal +1
The design of distributed gathering and convergence algorithms for tiny robots has recently received much attention. In particular, it has been shown that convergence problems can…
cs.DC2016★ 1 cited
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection
Debasish Pattanayak, Kaushik Mondal, H. Ramesh +1
There has been a wide interest in designing distributed algorithms for tiny robots. In particular, it has been shown that the robots can complete certain tasks even in the presence…