Computing by mobile robotic sensors
From MaRDI portal
Recommendations
Cites work
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Circle formation of weak robots and Lyndon words
- Collective tree exploration
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed Models and Algorithms for Mobile Robot Systems
- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
- Energy optimal data propagation in wireless sensor networks
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Formation of a geometric pattern with a mobile wireless sensor network
- Gathering of asynchronous robots with limited visibility
- scientific article; zbMATH DE number 3784244 (Why is no real title available?)
- scientific article; zbMATH DE number 1303411 (Why is no real title available?)
- scientific article; zbMATH DE number 1049494 (Why is no real title available?)
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- scientific article; zbMATH DE number 1871378 (Why is no real title available?)
- Local spreading algorithms for autonomous robot systems
- Map construction of unknown graphs by multiple agents
- Navigation strategies for multiple autonomous mobile robots moving in formation
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
- Practical multiagent rendezvous through modified circumcenter algorithms
- Rendezvous Without Coordinates
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Self-deployment of mobile sensors on a ring
- SOFSEM 2006: Theory and Practice of Computer Science
- Structural Information and Communication Complexity
- Swing Words to Make Circle Formation Quiescent
- The effect of synchronicity on the behavior of autonomous mobile robots
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Uniform multi-agent deployment on a ring
- Uniform scattering of autonomous mobile robots in a grid
Cited in
(10)- 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
- Gathering robots in graphs: the central role of synchronicity
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Mobile Robot Sensing for Environmental Applications
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
- On synchronization and orientation in distributed barrier coverage with relocatable sensors
This page was built for publication: Computing by mobile robotic sensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391133)
