Leader Election Problem versus Pattern Formation Problem

DOI10.1007/978-3-642-15763-9_26zbMath1290.68021arXiv0902.2851OpenAlexW2108096938MaRDI QIDQ3588308

Franck Petit, Vincent Villain, Yoann Dieudonné

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

pattern formationleader electionmobile robot networks

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (18)

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ On fast pattern formation by autonomous robots ⋮ Plane formation by synchronous mobile robots without chirality ⋮ Deterministic geoleader election in disoriented anonymous systems ⋮ Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality ⋮ A structured methodology for designing distributed algorithms for mobile entities ⋮ Asynchronous arbitrary pattern formation: the effects of a rigorous approach ⋮ Autonomous mobile robots with lights ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Building a nest by an automaton ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Unnamed Item ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ Getting close without touching: near-gathering for autonomous mobile robots ⋮ Monotonic self-stabilization and its application to robust and adaptive pattern formation ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Arbitrary pattern formation on infinite regular tessellation graphs

This page was built for publication: Leader Election Problem versus Pattern Formation Problem