Miller A., Pelc A. (2014) Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt. In: Aguilera M.K., Querzoni L., Shapiro M. (eds) Principles of Distributed Systems. OPODIS 2014. Lecture Notes in Computer Science, vol 8878. Springer, Cham
Rendezvous and treasure hunt are two basic tasks performed by mobile agents in networks. In rendezvous, two agents, initially located at distinct nodes of the network, traverse edges in synchronous rounds and have to meet at some node. In treasure hunt, a single agent has to find a stationary target (treasure) situated at an unknown node. The network is modeled as an undirected connected graph whose nodes have distinct identities. The cost of a rendezvous algorithm is the worst-case total number of edge traversals performed by both agents until meeting. The cost of a treasure hunt algorithm is the worst-case number of edge traversals performed by the agent until the treasure is found. If the agents have no information about the network, the cost of both rendezvous and treasure hunt can be as large as Θ(e) for networks with e edges.
We study tradeoffs between the amount of information available a priori to the agents and the cost of rendezvous and treasure hunt. Following the paradigm of algorithms with advice, this information is provided to the agents at the start of their navigation by an oracle knowing the network, the starting positions of the agents, and, in the case of treasure hunt, the node where the treasure is hidden. The oracle assists the agents by providing them with a binary string called advice, which can be used by each agent during the algorithm execution. In the case of rendezvous, the advice given to each agent can be different. The length of the string given to the agent in treasure hunt and the sum of the lengths of strings given to the agents in rendezvous is called the size of advice.
Our goal is to find the smallest size of advice which enables the agents to solve rendezvous and treasure hunt at a given cost C in a network with e edges. This size turns out to depend on the initial distance D and on the ratio g = e/C, which is the relative cost gain due to advice. For arbitrary graphs, we give upper and lower bounds of O(Dlog(Dg)) and Ω(Dlogg), respectively, on the optimal size of advice. Hence, our bounds leave only a logarithmic gap in the general case. For the class of trees we give tight upper and lower bounds of Θ(Dlogg).
rendezvous treasure hunt advice deterministic algorithm mobile agent cost