Decentralized connectivity-preserving deployment of large-scale robot swarms

N Majcherczyk, A Jayabalan… - 2018 IEEE/RSJ …, 2018 - ieeexplore.ieee.org
We present a decentralized and scalable approach for deployment of a robot swarm. Our
approach tackles scenarios in which the swarm must reach multiple spatially distributed …

Can We Locally Compute Sparse Connected Subgraphs?

R Rubinfeld - Computer Science–Theory and Applications: 12th …, 2017 - Springer
How can we solve optimization problems on data that is so large, that we cannot hope to
view more than a miniscule fraction of it? When attempting to solve optimization problems on …

[PDF][PDF] Communication Algorithms for Spatio-Temporal Cooperation in Multi-Robot Systems

N Majcherczyk - 2020 - digital.wpi.edu
Swarm robotics has the potential to offer key solutions for large-scale, timesensitive and
dangerous applications, such as wildfire fighting and disaster response. Teams of robots …

A deterministic and a randomized algorithm for approximating minimum spanning tree under the SINR model

F Assis - 2015 8th IFIP Wireless and Mobile Networking …, 2015 - ieeexplore.ieee.org
We describe a deterministic and a randomized distributed algorithm for computing a
spanning tree over a wireless network whose weight approximates the weight of a Minimum …

[PDF][PDF] Swarm Robotics: Measurement and Sorting

Y Zhou - 2015 - repository.rice.edu
Arranging robots in a specific order is a necessary routine in some applications on multi-
robot systems. For example, robots may need to be ordered to go through a narrow …