Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
type: Item
instance of: scholarly article
title: Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
zbMATH Open document ID: 1407.68531
author: Mattia D'Emidio
author: Gabriele Di Stefano
author: Daniele Frigioni
author: Alfredo Navarra
published in: Information and Computation
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6987966
zbMATH Keywords: mobile robots
zbMATH Keywords: computational complexity
zbMATH Keywords: distributed algorithms
zbMATH Keywords: luminous robots
MaRDI profile type: Publication
full work available at URL: j.ic.2018.09.010
OpenAlex ID: W2890780660
cites work: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
cites work: Anonymous graph exploration with binoculars
cites work: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
cites work: Locating and repairing faults in a network with mobile agents
cites work: How to meet when you forget: log-space rendezvous in arbitrary graphs
cites work: Gathering on rings under the look-compute-move model
cites work: Gathering six oblivious robots on anonymous symmetric rings
cites work: Computing on rings by oblivious robots: a unified approach for different tasks
cites work: A unified approach for gathering and exclusive searching on rings under weak assumptions
cites work: Autonomous mobile robots with lights
cites work: On the computational power of oblivious robots
cites work: Explore and repair graphs with black holes using mobile entities
cites work: Synchronous robots vs asynchronous lights-enhanced robots on graphs
cites work: Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
cites work: About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
cites work: Gathering of oblivious robots on infinite grids with minimum traveled distance
cites work: Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
cites work: Leader Election Problem versus Pattern Formation Problem
cites work: Exploring an unknown dangerous graph using tokens
cites work: Distributed Models and Algorithms for Mobile Robot Systems
cites work: Remembering without memory: tree exploration by asynchronous oblivious robots
cites work: Computing without communicating: ring exploration by asynchronous oblivious robots
cites work: Gathering of asynchronous robots with limited visibility
cites work: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
cites work: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
cites work: Pattern Formation by Oblivious Asynchronous Mobile Robots
cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
cites work: Gathering asynchronous oblivious mobile robots in a ring
cites work: Graph decomposition for memoryless periodic exploration
cites work: Distributed Computing – IWDC 2005
cites work: Design and Analysis of Distributed Algorithms
cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
DOI: 10.1016/J.IC.2018.09.010
description: scientific article; zbMATH DE number 6987966