Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees

Autor: Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra

Publikováno v: Proceedings of the 24th International Conference on Distributed Computing and Networking.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59698d484350c374f78a0699075383b8
https://doi.org/10.1145/3571306.3571401

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots

Autor: Pascal Raymond, Franck Petit, Sébastien Tixeuil, Stéphane Devismes, Anissa Lamani

Publikováno v: The Computer Journal
The Computer Journal, Oxford University Press (UK), 2021, The Computer Journal, 64 (1), pp.132-154. ⟨10.1093/comjnl/bxz166⟩
The Computer Journal, Oxford University Press (UK), 2020, ⟨10.1093/comjnl/bxz166⟩
The Computer Journal, 2021, The Computer Journal, 64 (1), pp.132-154. ⟨10.1093/comjnl/bxz166⟩

We consider swarms of asynchronous oblivious robots evolving into an anonymous grid-shaped network. In this context, we investigate optimal (w.r.t. the number of robots) deterministic solutions for the terminating exploration problem. We first show l

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3c8b9a47b28d842e837f712bb7bc2c6
https://doi.org/10.1093/comjnl/bxz166

MOBLOT: Molecular oblivious robots

Autor: Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e8ce9f3774ad1f00b58383d0f86fedc5
http://hdl.handle.net/11391/1495722