A distributed algorithm for gathering many fat mobile robots in the plane
From MaRDI portal
(Redirected from Publication:5176102)
Abstract: In this work we consider the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting. Vision is the only mean of coordination. Using a state-machine representation we formulate the gathering problem and develop a distributed algorithm that solves the problem for any number of robots. The main idea behind our algorithm is for the robots to reach a configuration in which all the following hold: (a) The robots' centers form a convex hull in which all robots are on the convex, (b) Each robot can see all other robots, and (c) The configuration is connected, that is, every robot touches another robot and all robots together form a connected formation. We show that starting from any initial configuration, the robots, making only local decisions and coordinate by vision, eventually reach such a configuration and terminate, yielding a solution to the gathering problem.
Recommendations
Cited in
(32)- Gathering few fat mobile robots in the plane
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Team assembling problem for asynchronous heterogeneous mobile robots
- Use of information, memory and randomization in asynchronous gathering
- The topology of look-compute-move robot wait-free algorithms with hard termination
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- On fast pattern formation by autonomous robots
- A continuous strategy for collisionless gathering
- Deterministic rendezvous with different maps
- On the self-stabilization of mobile oblivious robots in uniform rings
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Mutual visibility on grid by asynchronous luminous robots
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- Leader election and shape formation with self-organizing programmable matter
- Optimum Gathering of Asynchronous Robots
- Gathering asynchronous robots in the presence of obstacles
- Gathering fat mobile robots with slim omnidirectional cameras
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- Leader election and gathering for asynchronous fat robots without common chirality
- A Continuous Strategy for Collisionless Gathering
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Pattern formation by oblivious asynchronous mobile robots
- Mutual visibility by luminous robots without collisions
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- The mutual visibility problem for fat robots
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- The mutual visibility problem for fat robots with lights
- Pattern formation for fat robots with memory
- The min-move mutual visibility problem for disoriented asynchronous robots
- Pattern formation for fat robots with lights
- Getting close without touching: near-gathering for autonomous mobile robots
This page was built for publication: A distributed algorithm for gathering many fat mobile robots in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176102)
