Asynchronous approach in the plane: a deterministic polynomial algorithm

DOI10.4230/LIPICS.DISC.2017.8MaRDI QIDQ6487480zbMATH OpenWikidataFDO

Authors Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, Franck Petit

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2017.8

zbMATH Keywords

asynchronous rendezvousdeterministic algorithminfinite gridmobile agentsplanepolynomial cost

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Recommendations

• Asynchronous approach in the plane: a deterministic polynomial algorithm
• Deterministic polynomial approach in the plane
• Deterministic Polynomial Approach in the Plane
• Mathematical Foundations of Computer Science 2005
• Asynchronous deterministic rendezvous in graphs

Cited in

(4)

• Asynchronous approach in the plane: a deterministic polynomial algorithm
• Deterministic polynomial approach in the plane
• Price of asynchrony in mobile agents computing
• Deterministic Polynomial Approach in the Plane

This page was built for publication: Asynchronous approach in the plane: a deterministic polynomial algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487480)