Gathering asynchronous robots in the presence of obstacles
From MaRDI portal
Publication:2980916
DOI10.1007/978-3-319-53925-6_22zbMATH Open1485.68261OpenAlexW2588177768MaRDI QIDQ2980916FDOQ2980916
Authors: Subhash Bhagat, Krishnendu Mukhopadhyaya
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_22
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Cites Work
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Distributed computing by mobile robots: gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- Gathering few fat mobile robots in the plane
- Impossibility of gathering by a set of autonomous mobile robots
- Leader election and gathering for asynchronous fat robots without common chirality
- Title not available (Why is that?)
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- A distributed algorithm for gathering many fat mobile robots in the plane
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
Cited In (7)
- Synchronous gathering without multiplicity detection: a certified algorithm
- Optimum Gathering of Asynchronous Robots
- Synchronous gathering without multiplicity detection: a certified algorithm
- Gathering fat mobile robots with slim omnidirectional cameras
- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
- Gathering asynchronous oblivious mobile robots in a ring
- Title not available (Why is that?)
This page was built for publication: Gathering asynchronous robots in the presence of obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980916)