Meeting in a polygon by anonymous oblivious robots
From MaRDI portal
Publication:2204780
DOI10.1007/s00446-019-00362-2zbMath1460.68122arXiv1705.00324OpenAlexW2972852770WikidataQ127253286 ScholiaQ127253286MaRDI QIDQ2204780
Giovanni Viglietta, Paola Flocchini, Masafumi Yamashita, Nicola Santoro, Giuseppe Antonio Di Luna
Publication date: 16 October 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.00324
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Self-stabilizing gathering with strong multiplicity detection
- Mutual visibility by luminous robots without collisions
- Gathering of asynchronous robots with limited visibility
- Asynchronous deterministic rendezvous in bounded terrains
- Getting close without touching: near-gathering for autonomous mobile robots
- Hiding people in polygons
- The theory of search games and rendezvous.
- Distributed computing by mobile robots: uniform circle formation
- Mapping simple polygons: how robots benefit from looking back
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Deterministic polynomial approach in the plane
- Distributed Computing by Mobile Robots: Gathering
- How to meet asynchronously (almost) everywhere
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Searching for a Mobile Intruder in a Polygonal Region
- A Short Elementary Proof of the Mohr-Mascheroni Theorem
- Mapping Simple Polygons
- How to meet asynchronously at polynomial cost
- A Note on Trigonometric Algebraic Numbers
- Searching for mobile intruders in a polygonal region by a group of mobile searchers
- Rendezvous with constant memory
This page was built for publication: Meeting in a polygon by anonymous oblivious robots
