Distributed algorithms for partitioning a swarm of autonomous mobile robots
From MaRDI portal
Publication:1008735
DOI10.1016/J.TCS.2008.04.042zbMATH Open1164.68037OpenAlexW2108943074MaRDI QIDQ1008735FDOQ1008735
Authors: Asaf Efrima, David Peleg
Publication date: 30 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.042
Recommendations
Cites Work
- Distributed Models and Algorithms for Mobile Robot Systems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms – ESA 2004
- LATIN 2004: Theoretical Informatics
- Title not available (Why is that?)
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Title not available (Why is that?)
- Structural Information and Communication Complexity
- Fault-tolerant gathering algorithms for autonomous mobile robots
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Structural Information and Communication Complexity
Cited In (14)
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Geometric computations by broadcasting automata
- Distributed Models and Algorithms for Mobile Robot Systems
- Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
- Gathering asynchronous robots in the presence of obstacles
- Title not available (Why is that?)
- Leader election and gathering for asynchronous fat robots without common chirality
- \(k\)-circle formation by disoriented asynchronous robots
- Title not available (Why is that?)
- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Parking problem by oblivious mobile robots in infinite grids
- The effect of synchronicity on the behavior of autonomous mobile robots
- Team assembling problem for asynchronous heterogeneous mobile robots
This page was built for publication: Distributed algorithms for partitioning a swarm of autonomous mobile robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008735)