Autonomous mobile robots with lights
From MaRDI portal
Publication:897873
DOI10.1016/j.tcs.2015.09.018zbMath1331.68082OpenAlexW1802748673MaRDI QIDQ897873
Nicola Santoro, Shantanu Das, Giuseppe Prencipe, Masafumi Yamashita, Paola Flocchini
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.018
Related Items (28)
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ On fast pattern formation by autonomous robots ⋮ Ring exploration with myopic luminous robots ⋮ Uniform Dispersal of Robots with Minimum Visibility Range ⋮ Gathering a Euclidean closed chain of robots in linear time ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Ring exploration of myopic luminous robots with visibility more than one ⋮ Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ A structured methodology for designing distributed algorithms for mobile entities ⋮ Gathering problems for autonomous mobile robots with lights ⋮ The canonical amoebot model: algorithms and concurrency control ⋮ The mutual visibility problem for fat robots ⋮ Neighborhood mutual remainder: self-stabilizing distributed implementation and applications ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ The agreement power of disagreement ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Explicit Communication Among Stigmergic Robots ⋮ Randomized gathering of asynchronous mobile robots ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Unnamed Item ⋮ Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement ⋮ Stand up indulgent gathering ⋮ Exploration of High-Dimensional Grids by Finite Automata ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis ⋮ Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation ⋮ Arbitrary pattern formation on infinite regular tessellation graphs
Cites Work
- Gathering of asynchronous robots with limited visibility
- The effect of synchronicity on the behavior of autonomous mobile robots
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space
- Coordination without communication: the case of the flocking problem
- Rendezvous of two robots with visible bits
- Rendezvous of Two Robots with Constant Memory
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Distributed Computing by Mobile Robots: Gathering
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Leader Election Problem versus Pattern Formation Problem
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Distributed Models and Algorithms for Mobile Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Distributed Computing – IWDC 2005
This page was built for publication: Autonomous mobile robots with lights
