Computing by Mobile Robotic Sensors
From MaRDI portal
Publication:5391133
DOI10.1007/978-3-642-14849-1_21zbMath1218.68047OpenAlexW36707661MaRDI QIDQ5391133
Nicola Santoro, Giuseppe Prencipe, Paola Flocchini
Publication date: 5 April 2011
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14849-1_21
Related Items (9)
On synchronization and orientation in distributed barrier coverage with relocatable sensors ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Monotonic self-stabilization and its application to robust and adaptive pattern formation ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis ⋮ Dispersion of mobile robots on directed anonymous graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Uniform multi-agent deployment on a ring
- The effect of synchronicity on the behavior of autonomous mobile robots
- Circle formation of weak robots and Lyndon words
- Energy optimal data propagation in wireless sensor networks
- 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
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Practical multiagent rendezvous through modified circumcenter algorithms
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Map construction of unknown graphs by multiple agents
- UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID
- Navigation strategies for multiple autonomous mobile robots moving in formation
- Formation of a geometric pattern with a mobile wireless sensor network
- Collective tree exploration
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Rendezvous Without Coordinates
- Swing Words to Make Circle Formation Quiescent
- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
- Distributed Models and Algorithms for Mobile Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Structural Information and Communication Complexity
- SOFSEM 2006: Theory and Practice of Computer Science
This page was built for publication: Computing by Mobile Robotic Sensors
