Autonomous Mobile Robots: A Distributed Computing Perspective

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Algorithmic Aspects of Wireless Sensor Networks

• Publication date

  2013-09-05

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-642-45346-5_2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sycamore: a 2D-3D simulation environment for autonomous mobile robots algorithms

  2014cited by this paper
• The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits

  2012influential reference
• Distributed Computing by Mobile Robots: Gathering

  2012cited by this paper
• Distributed Computing by Oblivious Mobile Robots

  2012cited by this paper
• Self-stabilizing gathering with strong multiplicity detection

  2012cited by this paper
• Convergence with Limited Visibility by Asynchronous Mobile Robots

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

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

  2011cited by this paper
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots

  2011cited by this paper
• Fault-tolerant flocking for a group of autonomous mobile robots

  2011cited by this paper
• Gathering Asynchronous Transparent Fat Robots

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

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

  2009cited by this paper
• Emergent Approach to Circle Formation by Multiple Autonomous Modular Robots

  2009cited by this paper
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity

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

  2008cited by this paper
• Fault-Tolerant Flocking in a k-Bounded Asynchronous System

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

  2008cited by this paper
• Stabilizing Flocking Via Leader Election in Robot Networks

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

  2007cited by this paper
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result

  2007cited by this paper
• Impossibility of gathering by a set of autonomous mobile robots

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

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

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

  2006cited by this paper
• Circle formation of weak robots and Lyndon words

  2006cited by this paper
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements

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

  2005cited by this paper
• The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots

  2005cited by this paper
• Biangular Circle Formation by Asynchronous Mobile Robots

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

  2004cited by this paper
• Coordination without communication: the case of the flocking problem

  2004cited by this paper
• Convergence Of a Uniform Circle Formation Algorithm for Distributed Autonomous Mobile Robots

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

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

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

  2004cited by this paper
• Robotic cops: the intruder problem

  2003influential reference
• The multi-agent rendezvous problem

  2003cited by this paper
• Circle formation for oblivious anonymous mobile robots with no common sense of orientation

  2002cited by this paper
• From local actions to global tasks: stigmergy and collective robotics

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

  1999cited by this paper
• Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots

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

  1999influential reference
• Experiments in Realising Cooperation between Autonomous Mobile Robots

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

  1996influential reference
• Cooperative Mobile Robotics: Antecedents and Directions

  1995cited by this paper
• Remark About Self-Stabilizing Systems

  1995cited by this paper
• Blissful Ignorance: Knowing Just Enough to Coordinate Well

  1995cited by this paper
• On the design of behavior-based multi-robot teams

  1995cited by this paper
• Information Invariants for Distributed Manipulation

  1995cited by this paper
• Coordination and control of a group of small mobile robots

  1994cited by this paper
• Self-assembling machine

  1994cited by this paper
• Interaction and intelligent behavior

  1994cited by this paper
• Toward a Robot Architecture Integrating Cooperation between Mobile Robots: Application to Indoor Environment

  1993cited by this paper
• A principle of distributed decision making of Cellular Robotic System (CEBOT)

  1993cited by this paper
• Autonomous Mobile Robots: Perception

  1991cited by this paper
• Structure decision method for self organising robots based on cell structures-CEBOT

  1989cited by this paper
• Navigation Strategies For Multiple Autonomous Mobile Robots Moving In Formation

  1989cited by this paper

• Limits of Fault-Tolerant Observation: Impossibility of Gathering in the (4,2)-Defected View Model

  2025cites this paper
• Target Searching and Exploration on Ring by Myopic Robots

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

  2025cites this paper
• Optimal Uniform Circle Formation by Asynchronous Luminous Robots

  2024cites this paper
• Time-Color Tradeoff on Uniform Circle Formation by Asynchronous Robots

  2024cites this paper
• Gathering of Mobile Robots with Defected Views

  2022cites this paper
• Gathering Despite Defected View

  2022cites this paper
• Optimal Convex Hull Formation on a Grid by Asynchronous Robots With Lights

  2022cites this paper
• Partition of a swarm of robots into size-balanced groups in presence of line obstacles

  2022cites this paper
• Assembling of Robots in Presence of Line Obstacles with Direction-only Axes Agreement

  2021cites this paper
• Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case

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

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

  2020cites this paper
• Optimal Convex Hull Formation on a Grid by Asynchronous Robots with Lights

  2020cites this paper
• On the Distance and Spatial Complexity of Complete Visibility Algorithms for Oblivious Mobile Robots

  2019cites this paper
• Parallel Bayesian Search with No Coordination

  2019cites this paper
• The topology of look-compute-move robot wait-free algorithms with hard termination

  2018cites this paper
• Parallel Search with No Coordination

  2017cites this paper
• O(log N)-Time Complete Visibility for Asynchronous Robots with Lights

  2017cites this paper
• Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times

  2017cites this paper
• Universally Optimal Gathering Under Limited Visibility

  2017cites this paper
• ON THE MUTUAL VISIBILITY OF FAT MOBILE ROBOTS

  2016cites this paper
• Complete Visibility for Robots with Lights in O(1) Time

  2016cites this paper
• Uniform dispersal of oblivious mobile robots

  2016cites this paper
• Logarithmic-Time Complete Visibility for Robots with Lights

  2015cites this paper