k-circle formation by disoriented asynchronous robots

DOI10.1016/J.TCS.2022.03.003MaRDI QIDQ2143129zbMATH OpenOpenAlexFDO

Authors Bibhuti Das, Abhinav Chakraborty, Subhash Bhagat, Krishnendu Mukhopadhyaya

Publication date 31 May 2022

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

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

zbMATH Keywords

distributed computingasynchronousswarm roboticsoblivious\(k\)-circle formationno axis agreement

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Distributed computing by mobile robots: uniform circle formation
• Structural Information and Communication Complexity
• Squaring the Circle with Weak Mobile Robots
• Brief announcement: Mutually-visible uniform circle formation by asynchronous mobile robots on grid plane
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity

Cites work

• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Arbitrary pattern formation with four robots
• Asynchronous arbitrary pattern formation: the effects of a rigorous approach
• Asynchronous pattern formation by anonymous oblivious mobile robots
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• Distributed computing by mobile robots: gathering
• Distributed computing by mobile robots: uniform circle formation
• Embedded pattern formation by asynchronous robots without chirality
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• Gathering over meeting nodes in infinite grid
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
• Rendezvous of two robots with constant memory
• Team assembling problem for asynchronous heterogeneous mobile robots

Cited in

(5)

• Parking problem by oblivious mobile robots in infinite grids
• Brief announcement: Mutually-visible uniform circle formation by asynchronous mobile robots on grid plane
• Gathering over Meeting Nodes in Infinite Grid*
• Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
• Optimal Gathering Over Weber Meeting Nodes in Infinite Grid

This page was built for publication: \(k\)-circle formation by disoriented asynchronous robots

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