5 citations · 5 across the 2 of their papers we have counts for
2 papers
math.OC2017
Solution of network localization problem with noisy distances and its convergence
Ananya Saha, Buddhadeb Sau
The network localization problem with convex and non-convex distance constraints may be modeled as a nonlinear optimization problem. The existing localization techniques are mainly…
cs.DC2017★ 5 cited
Crash tolerant gathering on grid by asynchronous oblivious robots
Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri +1
Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed inde…