Uniform multi-agent deployment on a ring
From MaRDI portal
Publication:627178
DOI10.1016/J.TCS.2010.11.023zbMATH Open1206.68311OpenAlexW1969099455MaRDI QIDQ627178FDOQ627178
Authors: Yotam Elor, Alfred M. 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
Recommendations
- Uniform Deployment of Mobile Agents in Dynamic Rings
- Uniform Deployment of Mobile Agents in Asynchronous Rings
- Almost uniform deployment of mobile agents in dynamic rings
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)
Cites Work
- Deterministic rendezvous in graphs
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- LATIN 2004: Theoretical Informatics
- Formations of Vehicles in Cyclic Pursuit
- Title not available (Why is that?)
- Row straightening via local interactions
- Uniform multi-agent deployment on a ring
- Self-deployment of mobile sensors on a ring
- Anonymous graph exploration without collision by mobile robots
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Title not available (Why is that?)
- Structural Information and Communication Complexity
- Algorithms and Computation
- Local spreading algorithms for autonomous robot systems
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Exclusive perpetual ring exploration without chirality
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms
- SOFSEM 2006: Theory and Practice of Computer Science
- Quantized coordination algorithms for rendezvous and deployment
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- Mathematical Foundations of Computer Science 2005
Cited In (20)
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
- Almost uniform deployment of mobile agents in dynamic rings
- On the self-stabilization of mobile oblivious robots in uniform rings
- LATIN 2004: Theoretical Informatics
- Computing by mobile robotic sensors
- Collaborative dispersion by silent robots
- Uniform Deployment of Mobile Agents in Dynamic Rings
- Dispersion of mobile robots on directed anonymous graphs
- Universal systems of oblivious mobile robots
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- Problem of uniform deployment on a line segment for second-order agents
- Uniform multi-agent deployment on a ring
- Self-deployment of mobile sensors on a ring
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- Controlling anonymous mobile agents with unidirectional locomotion to form formations on a circle
- Position discovery for a system of bouncing robots
- Distributed pattern formation in a ring
- Fast dispersion of mobile robots on arbitrary graphs
- Uniform Deployment of Mobile Agents in Asynchronous Rings
- Distance-2-dispersion with termination by a strong team
This page was built for publication: Uniform multi-agent deployment on a ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627178)
