Deterministic Polynomial Approach in the Plane
Two mobile agents with range of vision 1 start at arbitrary points in the plane and have to accomplish the task of approach, which consists in getting at distance at most one from each other, i.e., in getting within each other’s range of vision. An adversary chooses the initial positions of the agents, their possibly different starting times, and assigns a different positive integer label and a possibly different speed to each of them. Each agent is equipped with a compass showing the cardinal directions, with a measure of length and a clock. Each agent knows its label and speed but not those of the other agent and it does not know the initial position of the other agent relative to its own. Agents do not have any global system of coordinates and they cannot communicate. Our main result is a deterministic algorithm to accomplish the task of approach, working in time polynomial in the unknown initial distance between the agents, in the length of the smaller label and in the inverse of the larger speed. The distance travelled by each agent until approach is polynomial in the first two parameters and does not depend on the third. The problem of approach in the plane reduces to a network problem: that of rendezvous in an infinite grid.
KeywordsMobile Robot Mobile Agent Basic Time Initial Distance Arbitrary Graph
Unable to display preview. Download preview PDF.
- 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.J. Czyzowicz, A. Labourel, A. Pelc, How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms 8, article 37 (2012)Google Scholar
- 16.Dieudonné, Y., Pelc, A.: Anonymous meeting in networks. In: Proc. 24rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 737–747 (2013)Google Scholar
- 17.Dieudonné, Y., Pelc, A., Peleg, D.: Gathering despite mischief. In: Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 527–540 (2012)Google Scholar
- 18.Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proc. 32nd Annual ACM Symposium on Principles of Distributed Computing, PODC 2013 (to appear, 2013)Google Scholar
- 21.Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. In: Proc. 22nd Ann. ACM Symposium on Parallel Algorithms and Architectures (SPAA 2010), pp. 224–232 (2010)Google Scholar
- 27.Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd Int. Conference on Distributed Computing Systems (ICDCS 2003), pp. 592–599. IEEE (2003)Google Scholar
- 29.Mitzenmacher, M., Upfal, E.: Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press (2005)Google Scholar
- 31.Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA ), pp. 599–608 (2007)Google Scholar