Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2018.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2890780660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous graph exploration with binoculars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and repairing faults in a network with mobile agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet when you forget: log-space rendezvous in arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering on rings under the look-compute-move model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering six oblivious robots on anonymous symmetric rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on rings by oblivious robots: a unified approach for different tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach for gathering and exclusive searching on rings under weak assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autonomous mobile robots with lights / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explore and repair graphs with black holes using mobile entities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous robots vs asynchronous lights-enhanced robots on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of oblivious robots on infinite grids with minimum traveled distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leader Election Problem versus Pattern Formation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown dangerous graph using tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Models and Algorithms for Mobile Robot Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remembering without memory: tree exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing without communicating: ring exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of asynchronous robots with limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Formation by Oblivious Asynchronous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering asynchronous oblivious mobile robots in a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition for memoryless periodic exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing – IWDC 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns / rank
 
Normal rank

Revision as of 12:59, 17 July 2024

scientific article
Language Label Description Also known as
English
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
scientific article

    Statements

    Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 December 2018
    0 references
    mobile robots
    0 references
    computational complexity
    0 references
    distributed algorithms
    0 references
    luminous robots
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references