Autonomous mobile robots with lights
From MaRDI portal
Publication:897873
DOI10.1016/J.TCS.2015.09.018zbMATH Open1331.68082OpenAlexW1802748673MaRDI QIDQ897873FDOQ897873
Authors: Shantanu Das, P. Flocchini, G. Prencipe, N. Santoro, Masafumi Yamashita 
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
Recommendations
- Synchronous robots vs asynchronous lights-enhanced robots on graphs
- Rendezvous of Asynchronous Mobile Robots with Lights
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Ring exploration with myopic luminous robots
Cites Work
- Distributed Models and Algorithms for Mobile Robot Systems
- Distributed computing by mobile robots: gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- The effect of synchronicity on the behavior of autonomous mobile robots
- Coordination without communication: the case of the flocking problem
- Leader election problem versus pattern formation problem
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Distributed Computing – IWDC 2005
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- The gathering problem for two oblivious robots with unreliable compasses
- Rendezvous of two robots with visible bits
- Rendezvous of Two Robots with Constant Memory
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space
Cited In (33)
- Explicit Communication Among Stigmergic Robots
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
- Gathering a Euclidean closed chain of robots in linear time
- The mutual visibility problem for fat robots
- Gathering robots in graphs: the central role of synchronicity
- Arbitrary pattern formation on infinite regular tessellation graphs
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Neighborhood mutual remainder: self-stabilizing distributed implementation and applications
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Ring exploration of myopic luminous robots with visibility more than one
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- A structured methodology for designing distributed algorithms for mobile entities
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- The agreement power of disagreement
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
- Ring exploration with myopic luminous robots
- Stand up indulgent gathering
- The canonical amoebot model: algorithms and concurrency control
- On fast pattern formation by autonomous robots
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Title not available (Why is that?)
- Exploration of High-Dimensional Grids by Finite State Machines
- Exploration of High-Dimensional Grids by Finite Automata
- Gathering problems for autonomous mobile robots with lights
- Uniform Dispersal of Robots with Minimum Visibility Range
- Ring exploration of myopic luminous robots with visibility more than one
- Randomized gathering of asynchronous mobile robots
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds
- Rendezvous of Asynchronous Mobile Robots with Lights
- Fast dispersion of mobile robots on arbitrary graphs
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
- The Agreement Power of Disagreement
This page was built for publication: Autonomous mobile robots with lights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897873)
