Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt
- 748 Downloads
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).
Keywordsrendezvous treasure hunt advice deterministic algorithm mobile agent cost
Unable to display preview. Download preview PDF.
- 1.Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA ), pp. 547–556 (2001)Google Scholar
- 4.Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science. Kluwer Academic Publisher (2002)Google Scholar
- 13.Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4 (2008)Google Scholar
- 15.Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms 8, article 37 (2012)Google Scholar
- 17.Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proc. 32nd ACM Symp. on Principles of Distributed Comp. (PODC), pp. 92–99 (2013)Google Scholar
- 25.Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms 53, 85–112 (2004)Google Scholar
- 32.Miller, A., Pelc, A.: Fast rendezvous with advice. In: Proc. 10th Int. Symp. on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2014) (2014), Full version at arxiv:1407.1428v1 [cs.DS]Google Scholar
- 33.Miller, A., Pelc, A.: Time versus cost tradeoffs for deterministic rendezvous in networks. In: Proc. 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2014 ), pp. 282–290 (2014)Google Scholar
- 37.Reingold, O.: Undirected connectivity in log-space. Journal of the ACM 55 (2008)Google Scholar
- 38.Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599–608 (2007)Google Scholar