Distributed computation in dynamic networks

F Kuhn, N Lynch, R Oshman - Proceedings of the forty-second ACM …, 2010 - dl.acm.org
In this paper we investigate distributed computation in dynamic networks in which the
network topology changes from round to round. We consider a worst-case model in which …

[HTML][HTML] On the transformation capability of feasible mechanisms for programmable matter

O Michail, G Skretas, PG Spirakis - Journal of Computer and System …, 2019 - Elsevier
We study theoretical models of programmable matter systems, consisting of n spherical
modules kept together by magnetic or electrostatic forces and able to perform two minimal …

A hybrid PSO algorithm for multi-robot target search and decision awareness

JT Ebert, F Berlinger, B Haghighat… - 2022 IEEE/RSJ …, 2022 - ieeexplore.ieee.org
Groups of robots can be tasked with identifying a location in an environment where a feature
cue is past a threshold, then disseminating this information throughout the group–such as …

Naming and counting in anonymous unknown dynamic networks

O Michail, I Chatzigiannakis, PG Spirakis - Symposium on Self-Stabilizing …, 2013 - Springer
In this work, we study the fundamental naming and counting problems (and some variations)
in networks that are anonymous, unknown, and possibly dynamic. In counting, nodes must …

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 …

Optimizing communication in air-ground robot networks using decentralized control

S Gil, M Schwager, BJ Julian… - 2010 IEEE International …, 2010 - ieeexplore.ieee.org
We develop a distributed controller to position a team of aerial vehicles in a configuration
that optimizes communication-link quality, to support a team of ground vehicles performing a …

[HTML][HTML] Pushing lines helps: Efficient universal centralised transformations for programmable matter

A Almethen, O Michail, I Potapov - Theoretical Computer Science, 2020 - Elsevier
In this work, we study a discrete system of entities residing on a two-dimensional square
grid. Each entity is modelled as a node occupying a distinct cell of the grid. The set of all n …

Security protocol with IDS framework using mobile agent in robotic MANET

M Rath, BK Pattanayak - … Journal of Information Security and Privacy …, 2019 - igi-global.com
Nanotechnologies guarantee new potential outcomes for maintaining accessibility issues in
versatile robots in an automated based Mobile Adhoc Networks (MANETs). In multi-robot …

[PDF][PDF] Fault-tolerance through k-connectivity

A Cornejo, N Lynch - … on network science and systems issues in …, 2010 - groups.csail.mit.edu
We consider a system composed of autonomous mobile robots that communicate by
exchanging messages in a wireless ad-hoc network. In this setting, the failure of a single …

Decentralized task allocation in lossy networks: A simulation study

M Rantanen, N Mastronarde… - 2019 16th Annual …, 2019 - ieeexplore.ieee.org
Advances in hardware, software and sensing are bringing swarms of robots to daily life. A
major challenge in enabling such applications is multi-robot coordination. Most multi-robot …