Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots

DOI10.1007/978-3-662-53426-7_14zbMath1393.68163arXiv1602.08361OpenAlexW2284162315MaRDI QIDQ1660934

Sébastien Tixeuil, Pierre Courtieu, Xavier Urbain, Lionel Rieg

Publication date: 16 August 2018

Full work available at URL: https://arxiv.org/abs/1602.08361

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (11)

TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ On asynchronous rendezvous in general graphs ⋮ Verification of agent navigation in partially-known environments ⋮ Model Checking of Robot Gathering ⋮ Squeezing streams and composition of self-stabilizing algorithms ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Parameterized verification of algorithms for oblivious robots on a ring ⋮ Unnamed Item ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Synchronous gathering without multiplicity detection: a certified algorithm ⋮ Embedded pattern formation by asynchronous robots without chirality

Uses Software

• Coq

This page was built for publication: Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots