Mutual visibility by luminous robots without collisions

DOI10.1016/j.ic.2016.09.005zbMath1370.68285arXiv1503.04347OpenAlexW2963114728MaRDI QIDQ528203

Giovanni Viglietta, S. Gan Chaudhuri, Federico Poloni, Giuseppe Antonio Di Luna, Nicola Santoro, Paola Flocchini

Publication date: 12 May 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04347

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items

Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Mutual visibility in graphs ⋮ Mutual visibility on grid by asynchronous luminous robots ⋮ Variety of mutual-visibility problems in graphs ⋮ Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality ⋮ TRAVERSING A GRAPH IN GENERAL POSITION ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ The canonical amoebot model: algorithms and concurrency control ⋮ The mutual visibility problem for fat robots ⋮ Mutual-visibility sets in Cartesian products of paths and cycles ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ Explicit Communication Among Stigmergic Robots ⋮ Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
• Local spreading algorithms for autonomous robot systems
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Gathering few fat mobile robots in the plane
• Rendezvous of two robots with visible bits
• Forming sequences of geometric patterns with oblivious mobile robots
• Rendezvous of Two Robots with Constant Memory
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Distributed Computing by Mobile Robots: Gathering
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
• A distributed algorithm for gathering many fat mobile robots in the plane
• 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: Mutual visibility by luminous robots without collisions