Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Lamani, Anissa"'
We consider a collection of $k \geq 2$ robots that evolve in a ring-shaped network without common orientation, and address a variant of the crash-tolerant gathering problem called the \emph{Stand-Up Indulgent Gathering} (SUIG): given a collection of
Externí odkaz:
http://arxiv.org/abs/2402.14233
Autor:
Bramas, Quentin, Kakugawa, Hirotsugu, Kamei, Sayaka, Lamani, Anissa, Ooshita, Fukuhito, Shibata, Masahiro, Tixeuil, Sébastien
We consider a strong variant of the crash fault-tolerant gathering problem called stand-up indulgent gathering (SUIG), by robots endowed with limited visibility sensors and lights on line-shaped networks. In this problem, a group of mobile robots mus
Externí odkaz:
http://arxiv.org/abs/2312.12698
We consider a variant of the crash-fault gathering problem called stand-up indulgent gathering (SUIG). In this problem, a group of mobile robots must eventually gather at a single location, which is not known in advance. If no robots crash, they must
Externí odkaz:
http://arxiv.org/abs/2304.05722
We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in finite tim
Externí odkaz:
http://arxiv.org/abs/2302.03466
Publikováno v:
In Theoretical Computer Science 12 November 2024 1016
We consider the gathering problem for asynchronous and oblivious robots that cannot communicate explicitly with each other, but are endowed with visibility sensors that allow them to see the positions of the other robots. Most of the investigations o
Externí odkaz:
http://arxiv.org/abs/2101.05421
We consider two mobile oblivious robots that evolve in a continuous Euclidean space. We require the two robots to solve the rendezvous problem (meeting in finite time at the same location, not known beforehand) despite the possibility that one of tho
Externí odkaz:
http://arxiv.org/abs/2010.04400
Autor:
Darwich, Omar, Ulucan, Ahmet-Sefa, Bramas, Quentin, Lamani, Anissa, Durand, Anaïs, Lafourcade, Pascal
Publikováno v:
In Theoretical Computer Science 17 October 2023 976
We investigate gathering algorithms for asynchronous autonomous mobile robots moving in uniform ring-shaped networks. Different from most work using the Look-Compute-Move (LCM) model, we assume that robots have limited visibility and lights. That is,
Externí odkaz:
http://arxiv.org/abs/1911.04757
Publikováno v:
In Theoretical Computer Science 18 April 2023 954