1,428 research outputs found

    Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks

    Full text link
    Two mobile agents, starting from different nodes of a network at possibly different times, have to meet at the same node. This problem is known as rendezvous\mathit{rendezvous}. Agents move in synchronous rounds. Each agent has a distinct integer label from the set {1,,L}\{1,\dots,L\}. Two main efficiency measures of rendezvous are its time\mathit{time} (the number of rounds until the meeting) and its cost\mathit{cost} (the total number of edge traversals). We investigate tradeoffs between these two measures. A natural benchmark for both time and cost of rendezvous in a network is the number of edge traversals needed for visiting all nodes of the network, called the exploration time. Hence we express the time and cost of rendezvous as functions of an upper bound EE on the time of exploration (where EE and a corresponding exploration procedure are known to both agents) and of the size LL of the label space. We present two natural rendezvous algorithms. Algorithm Cheap\mathtt{Cheap} has cost O(E)O(E) (and, in fact, a version of this algorithm for the model where the agents start simultaneously has cost exactly EE) and time O(EL)O(EL). Algorithm Fast\mathtt{Fast} has both time and cost O(ElogL)O(E\log L). Our main contributions are lower bounds showing that, perhaps surprisingly, these two algorithms capture the tradeoffs between time and cost of rendezvous almost tightly. We show that any deterministic rendezvous algorithm of cost asymptotically EE (i.e., of cost E+o(E)E+o(E)) must have time Ω(EL)\Omega(EL). On the other hand, we show that any deterministic rendezvous algorithm with time complexity O(ElogL)O(E\log L) must have cost Ω(ElogL)\Omega (E\log L)

    Rendezvous of Distance-aware Mobile Agents in Unknown Graphs

    Get PDF
    We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size and to depend only on the initial distance between the agents and some local parameters such as the degree of the vertices, and the size of the agent's label. It is well known that even for simple graphs of degree Δ\Delta, the rendezvous time can be exponential in Δ\Delta in the worst case. In this paper, we introduce a new version of the rendezvous problem where the agents are equipped with a device that measures its distance to the other agent after every step. We show that these \emph{distance-aware} agents are able to rendezvous in any unknown graph, in time polynomial in all the local parameters such the degree of the nodes, the initial distance DD and the size of the smaller of the two agent labels l=min(l1,l2)l = \min(l_1, l_2). Our algorithm has a time complexity of O(Δ(D+logl))O(\Delta(D+\log{l})) and we show an almost matching lower bound of Ω(Δ(D+logl/logΔ))\Omega(\Delta(D+\log{l}/\log{\Delta})) on the time complexity of any rendezvous algorithm in our scenario. Further, this lower bound extends existing lower bounds for the general rendezvous problem without distance awareness

    Meeting in a Polygon by Anonymous Oblivious Robots

    Full text link
    The Meeting problem for k2k\geq 2 searchers in a polygon PP (possibly with holes) consists in making the searchers move within PP, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the shape of PP, we minimize the number of searchers kk for which the Meeting problem is solvable. Specifically, if PP has a rotational symmetry of order σ\sigma (where σ=1\sigma=1 corresponds to no rotational symmetry), we prove that k=σ+1k=\sigma+1 searchers are sufficient, and the bound is tight. Furthermore, we give an improved algorithm that optimally solves the Meeting problem with k=2k=2 searchers in all polygons whose barycenter is not in a hole (which includes the polygons with no holes). Our algorithms can be implemented in a variety of standard models of mobile robots operating in Look-Compute-Move cycles. For instance, if the searchers have memory but are anonymous, asynchronous, and have no agreement on a coordinate system or a notion of clockwise direction, then our algorithms work even if the initial memory contents of the searchers are arbitrary and possibly misleading. Moreover, oblivious searchers can execute our algorithms as well, encoding information by carefully positioning themselves within the polygon. This code is computable with basic arithmetic operations, and each searcher can geometrically construct its own destination point at each cycle using only a compass. We stress that such memoryless searchers may be located anywhere in the polygon when the execution begins, and hence the information they initially encode is arbitrary. Our algorithms use a self-stabilizing map construction subroutine which is of independent interest.Comment: 37 pages, 9 figure
    corecore