On the computational power of oblivious robots
From MaRDI portal
Publication:5176205
DOI10.1145/1835698.1835761zbMath1315.68249OpenAlexW1983586118MaRDI QIDQ5176205
Shantanu Das, Paola Flocchini, Masafumi Yamashita, Nicola Santoro
Publication date: 2 March 2015
Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1835698.1835761
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, Information Spreading by Mobile Particles on a Line, Leader Election and Shape Formation with Self-organizing Programmable Matter, Building a nest by an automaton, The kissing problem: how to end a gathering when everyone kisses everyone else goodbye, Communication and location discovery in geometric ring networks, Position discovery for a system of bouncing robots, Localization for a system of colliding robots, Universal coating for programmable matter, Unnamed Item, Gathering in the plane of location-aware robots in the presence of spies, Synchronous robots vs asynchronous lights-enhanced robots on graphs, Survivability of bouncing robots, Pattern Formation by Oblivious Asynchronous Mobile Robots, Convergecast and broadcast by power-aware mobile agents
Uses Software
Cites Work
