Distributed Computing by Mobile Robots: Gathering

No abstract is available for this paper.

• Publication year

  2012

• Venue

  SIAM journal on computing (Print)

• Publication date

  2012-08-16

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1137/100796534
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A New Approach for Analyzing Convergence Algorithms for Mobile Robots

  2011cited by this paper
• A tight runtime bound for synchronous gathering of autonomous robots with limited visibility

  2011cited by this paper
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses

  2011cited by this paper
• Computing by Mobile Robotic Sensors

  2011cited by this paper
• Collisionless Gathering of Robots with an Extent

  2011cited by this paper
• On the computational power of oblivious robots: forming a series of geometric patterns

  2010cited by this paper
• Characterizing geometric patterns formable by oblivious anonymous mobile robots

  2010cited by this paper
• Gathering Asynchronous Transparent Fat Robots

  2010cited by this paper
• Practical multiagent rendezvous through modified circumcenter algorithms

  2009influential reference
• The Projection Median of a Set of Points in R2

  2009cited by this paper
• Deaf, Dumb, and Chatting Asynchronous Robots

  2009cited by this paper
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots

  2009cited by this paper
• Using eventually consistent compasses to gather memory-less mobile robots with limited visibility

  2009influential reference
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity

  2008cited by this paper
• Gathering Multiple Robotic Agents with Crude Distance Sensing Capabilities

  2008cited by this paper
• Local spreading algorithms for autonomous robot systems

  2008cited by this paper
• Distributed Algorithms for Robotic Networks

  2008cited by this paper
• Encyclopedia of Complexity and Systems Science

  2008cited by this paper
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots

  2008cited by this paper
• Rendezvous without coordinates

  2008influential reference
• Reconfiguration methods for mobile sensor networks

  2007cited by this paper
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots

  2007cited by this paper
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case

  2007influential reference
• Impossibility of gathering by a set of autonomous mobile robots

  2007cited by this paper
• Distributed Models and Algorithms for Mobile Robot Systems

  2007cited by this paper
• The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case

  2007cited by this paper
• Aggregation in Swarm Robotic Systems: Evolution and Probabilistic Control

  2007cited by this paper
• How to meet in anonymous network

  2006cited by this paper
• Gathering few fat mobile robots in the plane

  2006cited by this paper
• Multirobot Rendezvous With Visibility Sensors in Nonconvex Environments

  2006influential reference
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements

  2006cited by this paper
• Gathering asynchronous oblivious mobile robots in a ring

  2006cited by this paper
• Circle formation of weak mobile robots

  2006cited by this paper
• Getting mobile autonomous robots to rendezvous

  2006cited by this paper
• Efficient Algorithms for Detecting Regular Point Configurations

  2005influential reference
• Gradual spatial pattern formation of homogeneous robot group

  2005cited by this paper
• Energy-efficient deployment of Intelligent Mobile sensor networks

  2005cited by this paper
• Gathering of asynchronous robots with limited visibility

  2005cited by this paper
• Gathering Non-oblivious Mobile Robots

  2004cited by this paper
• Distributed Circle Formation for Anonymous Oblivious Robots

  2004cited by this paper
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems

  2004cited by this paper
• Formation of a geometric pattern with a mobile wireless sensor network

  2004cited by this paper
• Fault-tolerant gathering algorithms for autonomous mobile robots

  2004influential reference
• The multi-agent rendezvous problem

  2003influential reference
• A general algorithm for robot formations using local sensing and minimal communication

  2002cited by this paper
• An Incremental Self-Deployment Algorithm for Mobile Sensor Networks

  2002cited by this paper
• Gathering Autonomous Mobile Robots

  2002cited by this paper
• Current State of the Art in Distributed Autonomous Mobile Robotics

  2000cited by this paper
• Distributed memoryless point convergence algorithm for mobile robots with limited visibility

  1999cited by this paper
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

  1999influential reference
• A robust distributed convergence algorithm for autonomous mobile robots

  1997cited by this paper
• Distributed algorithms for formation of geometric patterns with many mobile robots

  1996cited by this paper
• Smallest enclosing disks (balls and ellipsoids)

  1991cited by this paper
• New Results and New Trends in Computer Science

  1991cited by this paper
• Another proof of the defect relation for moving targets

  1991cited by this paper
• The algebraic degree of geometric optimization problems

  1988cited by this paper
• Euclidean Constructibility in Graph-Minimization Problems

  1969cited by this paper

• Gathering Semi-Synchronously Scheduled Two-State Robots

  2026cites this paper
• Maximal Independent Set via Leader Election by Mobile Agents from Arbitrary Initial Configuration Without Global Knowledge

  2026cites this paper
• Universal Dancing by Luminous Robots under Sequential Schedulers

  2025cites this paper
• On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs

  2025cites this paper
• On the computational power of energy-constrained mobile robots

  2025cites this paper
• Asynchronous Gathering of Opaque Robots with Mobility Faults

  2025cites this paper
• Can Like Attract Like? A Study of Homonymous Gathering in Networks

  2025cites this paper
• Optimal gathering of robots in anonymous butterfly networks via leader election

  2025cites this paper
• Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin

  2025cites this paper
• Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents

  2025cites this paper
• Pairbot: Enhancing Computational Capabilities by Pairing of Autonomous Mobile Robots

  2025cites this paper
• Deterministic Color-Optimal Self-stabilizing Semi-synchronous Gathering: A Certified Algorithm

  2025cites this paper
• Approach of Agents with Restricted Fuel Tanks

  2025cites this paper
• Uniform k -circle formation by asynchronous fat robots

  2025cites this paper
• Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems

  2025cites this paper
• Asynchronous Separation of Unconscious Colored Robots

  2024cites this paper
• Universal Pattern Formation by Oblivious Robots Under Sequential Schedulers

  2024cites this paper
• Impossibility of Self-Organized Aggregation Without Computation

  2024cites this paper
• Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots

  2024cites this paper
• Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid

  2024cites this paper
• On the power of bounded asynchrony: convergence by autonomous robots with limited visibility

  2024cites this paper
• Gathering Problem for Fat Mobile Robots Using Memory

  2024cites this paper
• Gathering Semi-Synchronously Scheduled Two-State Robots

  2024cites this paper
• The Agreement Power of Disagreement

  2023cites this paper
• Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots

  2023cites this paper
• Fast deterministic rendezvous in labeled lines

  2023cites this paper
• Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights

  2023cites this paper
• Pattern Formation for Fat Robots with Memory

  2023cites this paper
• Compatibility of convergence algorithms for autonomous mobile robots

  2023cites this paper
• Asynchronous Gathering of Robots with Finite Memory on a Circle under Limited Visibility

  2023cites this paper
• Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots

  2023cites this paper
• On Asynchrony, Memory, and Communication: Separations and Landscapes

  2023cites this paper
• Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs

  2023cites this paper
• Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes

  2023cites this paper
• Rendezvous on a Known Dynamic Point on a Finite Unoriented Grid

  2023cites this paper
• Pattern Formation for Fat Robots with Lights

  2023cites this paper
• Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots

  2023cites this paper
• The Mutual Visibility Problem for Fat Robots

  2022cites this paper
• How to Meet at a Node of Any Connected Graph

  2022cites this paper
• On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis

  2022cites this paper
• A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility

  2022cites this paper
• Designing Distributed Algorithms for Autonomous Robots

  2022cites this paper
• k-Circle formation by disoriented asynchronous robots

  2022cites this paper
• Deterministic Rendezvous in Infinite Trees

  2022cites this paper
• Autonomous Mobile Robots: Refining the Computational Landscape

  2021cites this paper
• Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility

  2021cites this paper
• Solving the Pattern Formation by Mobile Robots With Chirality

  2021influential citation
• k-Circle Formation and k-epf by Asynchronous Robots

  2021cites this paper
• “Semi-Asynchronous”: A New Scheduler in Distributed Computing

  2021influential citation
• Min-Max Gathering of Oblivious Robots

  2021cites this paper
• Wait-free approximate agreement on graphs

  2021cites this paper
• MOBLOT: Molecular Oblivious Robots

  2021cites this paper
• Breaking Symmetries on Tessellation Graphs via Asynchronous Robots: The Line Formation Problem as a Case Study

  2021influential citation
• Search by a metamorphic robotic system in a finite 2D square Grid

  2021cites this paper
• Time-Optimal Gathering under Limited Visibility with One-Axis Agreement

  2021cites this paper
• Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots

  2021cites this paper
• Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights

  2021cites this paper
• Gathering robots in graphs: The central role of synchronicity

  2021cites this paper
• Byzantine Dispersion on Graphs

  2021cites this paper
• A structured methodology for designing distributed algorithms for mobile entities

  2021cites this paper
• Conic Formation in Presence of Faulty Robots

  2020cites this paper
• Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots

  2020cites this paper
• Forming Sequences of Patterns With Luminous Robots

  2020cites this paper
• Synchronization by Asynchronous Mobile Robots with Limited Visibility

  2020cites this paper
• A Characterization of Semi-Synchrony for Asynchronous Robots with Limited Visibility, and its Application to Luminous Synchronizer Design.

  2020cites this paper
• Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots

  2020cites this paper
• Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction

  2020cites this paper
• Almost Universal Anonymous Rendezvous in the Plane

  2020cites this paper
• Distributed Algorithms for Swarm Robots

  2020cites this paper
• Distributed Pattern Formation With Faulty Robots

  2020cites this paper
• On Efficient Connectivity-Preserving Transformations in a Grid

  2020cites this paper
• Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots

  2020cites this paper
• Algorithms for Sensor Systems: 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9–10, 2020, Revised Selected Papers

  2020influential citation
• Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs

  2020cites this paper
• On Memory, Communication, and Synchronous Schedulers When Moving and Computing

  2020cites this paper
• A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study

  2020influential citation
• Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots

  2020cites this paper
• Gathering a Euclidean Closed Chain of Robots in Linear Time

  2020cites this paper
• Weak robots performing conflicting tasks without knowing who is in their team

  2020cites this paper
• Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility

  2020cites this paper
• Near-Gathering of Energy-Constrained Mobile Agents

  2019cites this paper
• Want to Gather? No Need to Chatter!

  2019cites this paper
• Explicit Communication Among Stigmergic Robots

  2019cites this paper
• Communication and location discovery in geometric ring networks

  2019cites this paper
• Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies

  2019cites this paper
• Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots

  2019cites this paper
• Asynchronous Robots on Graphs: Gathering

  2019cites this paper
• On asynchronous rendezvous in general graphs

  2019cites this paper
• Gathering of mobile robots with weak multiplicity detection in presence of crash-faults

  2019cites this paper
• Gathering

  2019cites this paper
• Uniform Circle Formation

  2019cites this paper
• Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter

  2019cites this paper
• Coding theory for noiseless channels realized by anonymous oblivious mobile robots

  2019influential citation
• COME TOGETHER: Multi-Agent Geometric Consensus (Gathering, Rendezvous, Clustering, Aggregation)

  2019cites this paper
• Symmetry of Anonymous Robots

  2019cites this paper
• Positional Encoding by Robots with Non-Rigid Movements

  2019cites this paper
• Gathering and Election by Mobile Robots in a Continuous Cycle

  2019cites this paper
• On Gathering of Semi-synchronous Robots in Graphs

  2019cites this paper
• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling

  2019cites this paper
• Embedded pattern formation by asynchronous robots without chirality

  2018cites this paper