Squaring the Circle with Weak Mobile Robots

DOI10.1007/978-3-540-92182-0_33MaRDI QIDQ3596732zbMATH OpenOpenAlexFDO

Authors Yoann Dieudonné, Franck Petit

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00384093/file/dieudonne-petit-algotel.pdf

zbMATH Keywords

distributed coordinationmobile robot networksself-deployment(uniform) circle formation

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Recommendations

• Distributed computing by mobile robots: uniform circle formation
• Structural Information and Communication Complexity
• Optimal circle search despite the presence of faulty robots
• Mobile robots gathering algorithm with local weak multiplicity in rings
• Reaching a Point with an Unanchored Robot Arm in a Square
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
• Motions of a short-linked robot arm in a square
• Conic formation in presence of faulty robots

Cited in

(4)

• \(k\)-circle formation by disoriented asynchronous robots
• Structural Information and Communication Complexity
• Swing Words to Make Circle Formation Quiescent
• Distributed computing by mobile robots: uniform circle formation

This page was built for publication: Squaring the Circle with Weak Mobile Robots

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