On time complexity for connectivity-preserving scattering of mobile robots

DOI10.1016/J.TCS.2018.04.047zbMath1395.68266OpenAlexW2799458848MaRDI QIDQ1643151

Taisuke Izumi, Sébastien Tixeuil, Daichi Kaino, Maria Gradinariu Potop-Butucaru

Publication date: 18 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.047

zbMATH Keywords

time complexityscattering problemautonomous mobile robots

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence for robotics (68T40)

Related Items (2)

Gathering a Euclidean closed chain of robots in linear time ⋮ Randomized gathering of asynchronous mobile robots

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• The cost of probabilistic agreement in oblivious robot networks
• Self-deployment of mobile sensors on a ring
• Optimal Byzantine-resilient convergence in uni-dimensional robot networks
• Complexity of barrier coverage with relocatable sensors in the plane
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed Barrier Coverage with Relocatable Sensors

This page was built for publication: On time complexity for connectivity-preserving scattering of mobile robots