Uniform multi-agent deployment on a ring
From MaRDI portal
Publication:627178
DOI10.1016/J.TCS.2010.11.023zbMath1206.68311OpenAlexW1969099455MaRDI QIDQ627178
Yotam Elor, Alfred Marcel Bruckstein
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.023
Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)
Related Items (12)
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Problem of uniform deployment on a line segment for second-order agents ⋮ Uniform multi-agent deployment on a ring ⋮ Collaborative dispersion by silent robots ⋮ Controlling anonymous mobile agents with unidirectional locomotion to form formations on a circle ⋮ Computing by Mobile Robotic Sensors ⋮ Position discovery for a system of bouncing robots ⋮ Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings ⋮ On the self-stabilization of mobile oblivious robots in uniform rings ⋮ Universal Systems of Oblivious Mobile Robots ⋮ Dispersion of mobile robots on directed anonymous graphs ⋮ Almost uniform deployment of mobile agents in dynamic rings
Cites Work
- Unnamed Item
- Unnamed Item
- Uniform multi-agent deployment on a ring
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Local spreading algorithms for autonomous robot systems
- Self-deployment of mobile sensors on a ring
- Anonymous graph exploration without collision by mobile robots
- Row straightening via local interactions
- Deterministic rendezvous in graphs
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
- Quantized Coordination Algorithms for Rendezvous and Deployment
- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
- Exclusive Perpetual Ring Exploration without Chirality
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Formations of Vehicles in Cyclic Pursuit
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- Mathematical Foundations of Computer Science 2005
- Structural Information and Communication Complexity
- Algorithms and Computation
- SOFSEM 2006: Theory and Practice of Computer Science
- LATIN 2004: Theoretical Informatics
This page was built for publication: Uniform multi-agent deployment on a ring
