Autonomous mobile robots with lights

DOI10.1016/J.TCS.2015.09.018MaRDI QIDQ897873zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asynchronousdistributed computinglightsmobile entitiesoblivious

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

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

• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Coordination without communication: the case of the flocking problem
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed computing by mobile robots: gathering
• Distributed Computing – IWDC 2005
• Distributed Models and Algorithms for Mobile Robot Systems
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Gathering of asynchronous robots with limited visibility
• Leader election problem versus pattern formation problem
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
• Rendezvous of two robots with constant memory
• Rendezvous of two robots with visible bits
• The effect of synchronicity on the behavior of autonomous mobile robots
• The gathering problem for two oblivious robots with unreliable compasses

Cited in

(47)

• Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• The topology of look-compute-move robot wait-free algorithms with hard termination
• Asynchronous filling by myopic luminous robots
• 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
• On fast pattern formation by autonomous robots
• Ring exploration with myopic luminous robots
• Gathering a Euclidean closed chain of robots in linear time
• Gathering robots in graphs: the central role of synchronicity
• Randomized gathering of asynchronous mobile robots
• Gathering problems for autonomous mobile robots with lights
• The agreement power of disagreement
• Uniform Dispersal of Robots with Minimum Visibility Range
• Mobile robots with uncertain visibility sensors: possibility results and lower bounds
• Optimal rendezvous \(\mathcal{L}\)-algorithms for asynchronous mobile robots with external-lights
• Exploration of High-Dimensional Grids by Finite Automata
• Explicit communication among stigmergic robots
• Stand up indulgent gathering
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• 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
• 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
• The Agreement Power of Disagreement
• Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
• Exploration of High-Dimensional Grids by Finite State Machines
• Fast dispersion of mobile robots on arbitrary graphs
• Ring exploration of myopic luminous robots with visibility more than one
• The mutual visibility problem for fat robots with lights
• Gathering semi-synchronously scheduled two-state robots
• Infinite grid exploration with synchronous myopic robots without chirality
• Pattern formation for fat robots with memory
• Computational power of autonomous robots: transparency vs. opaqueness
• Pattern formation for fat robots with lights
• On the computational power of energy-constrained mobile robots
• Gathering on rings for myopic asynchronous robots with lights
• Rendezvous and merging for two metamorphic robotic systems without global compass
• Deterministic color-optimal self-stabilizing semi-synchronous gathering: two certified algorithms
• Pattern formation of mobile agents in dynamic grids
• On the computational power of mobile robots under sequential schedulers
• Synchronous robots vs asynchronous lights-enhanced robots on graphs

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)