Self-stabilizing gathering with strong multiplicity detection

DOI10.1016/J.TCS.2011.12.010MaRDI QIDQ418745zbMATH OpenOpenAlexFDO

Authors Yoann Dieudonné, Franck Petit

Publication date 30 May 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.12.010

zbMATH Keywords

gatheringself-stabilizationdistributed coordinationmobile robot networks

Mathematics Subject Classification ID

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

Recommendations

• Wait-free gathering without chirality
• scientific article; zbMATH DE number 2038783
• Distributed computing by mobile robots: gathering
• Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings
• Structural Information and Communication Complexity

Cites work

• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• Convex hulls of finite sets of points in two and three dimensions
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering of asynchronous robots with limited visibility
• Impossibility of gathering by a set of autonomous mobile robots
• LATIN 2004: Theoretical Informatics
• LATIN 2004: Theoretical Informatics
• Mobile robots gathering algorithm with local weak multiplicity in rings
• Self-stabilizing gathering with strong multiplicity detection
• Self-stabilizing systems in spite of distributed control
• The cost of probabilistic agreement in oblivious robot networks

Cited in

(16)

• scientific article; zbMATH DE number 7561452 (Why is no real title available?)
• Rendezvous with constant memory
• Rendezvous of two robots with constant memory
• Self-stabilizing gathering with strong multiplicity detection
• Meeting in a polygon by anonymous oblivious robots
• Self-stabilizing gathering of mobile robots under crash or Byzantine faults
• Asynchronous approach in the plane: a deterministic polynomial algorithm
• On the self-stabilization of mobile oblivious robots in uniform rings
• Gathering problems for autonomous mobile robots with lights
• Explicit communication among stigmergic robots
• Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
• Almost universal anonymous rendezvous in the plane
• Rendezvous of Asynchronous Mobile Robots with Lights
• Wait-free gathering without chirality
• Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement

This page was built for publication: Self-stabilizing gathering with strong multiplicity detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418745)