Zobrazeno 1 - 10
of 107
pro vyhledávání: '"Dieudonné, Yoann"'
A mobile agent, starting from a node $s$ of a simple undirected connected graph $G=(V,E)$, has to explore all nodes and edges of $G$ using the minimum number of edge traversals. To do so, the agent uses a deterministic algorithm that allows it to gai
Externí odkaz:
http://arxiv.org/abs/2410.13386
A mobile agent navigating along edges of a simple connected graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task is known as treasure hunt. The agent has no a priori knowledge of the
Externí odkaz:
http://arxiv.org/abs/2010.14916
Two mobile agents represented by points freely moving in the plane and starting at two distinct positions, have to meet. The meeting, called rendezvous, occurs when agents are at distance at most $r$ of each other and never move after this time, wher
Externí odkaz:
http://arxiv.org/abs/2005.00880
A mobile agent equipped with a compass and a measure of length has to find an inert treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In the beginning, the agent is at a distance at most $D>0$ from the treasure,
Externí odkaz:
http://arxiv.org/abs/2005.00875
A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of th
Externí odkaz:
http://arxiv.org/abs/1908.11402
We study the task of Byzantine gathering in a network modeled as a graph. Despite the presence of Byzantine agents, all the other (good) agents, starting from possibly different nodes and applying the same deterministic algorithm, have to meet at the
Externí odkaz:
http://arxiv.org/abs/1801.07656
We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to meet. This task has been considered in the literature under two alternati
Externí odkaz:
http://arxiv.org/abs/1710.08291
In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them in finite time within each other's range of vision. The agents execute
Externí odkaz:
http://arxiv.org/abs/1612.02168
Autor:
Dieudonné, Yoann, Pelc, Andrzej
Leader election is one of the basic problems in distributed computing. For anonymous networks, the task of leader election is formulated as follows: every node v of the network must output a simple path, which is coded as a sequence of port numbers,
Externí odkaz:
http://arxiv.org/abs/1604.05023
This paper investigates an open problem introduced in [14]. Two or more mobile agents start from different nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An ad
Externí odkaz:
http://arxiv.org/abs/1504.01623