On time complexity for connectivity-preserving scattering of mobile robots

DOI10.1016/J.TCS.2018.04.047zbMATH Open1395.68266OpenAlexW2799458848MaRDI QIDQ1643151FDOQ1643151

Authors: Taisuke Izumi, Daichi Kaino, Sébastien Tixeuil, Maria 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

Recommendations

• The random bit complexity of mobile robots scattering
• Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots
• The cost of probabilistic agreement in oblivious robot networks
• Scatter of robots
• Universally optimal gathering under limited visibility

zbMATH Keywords

time complexityscattering problemautonomous mobile robots

Mathematics Subject Classification ID

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

Cites Work

• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Gathering of asynchronous robots with limited visibility
• Self-deployment of mobile sensors on a ring
• Title not available (Why is that?)
• Optimal Byzantine-resilient convergence in uni-dimensional robot networks
• The cost of probabilistic agreement in oblivious robot networks
• Complexity of barrier coverage with relocatable sensors in the plane
• Distributed barrier coverage with relocatable sensors

Cited In (5)

• Gathering a Euclidean closed chain of robots in linear time
• The random bit complexity of mobile robots scattering
• Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots
• Self-stabilizing mobile medical robots scattering algorithm
• Randomized gathering of asynchronous mobile robots

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1643151)