Abstract
In this paper, we investigate the following problem: k mobile agents are placed on a graph G. Each agent performs a random walk, and when two or more agents meet at a node, they merge into a single agent. We present a Markov chain modeling the agents behaviour and show how this can be used to upper bound the expected time for all the k agents to merge into a single agent.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abbas S, Mosbah M, Zemmari A (2006) Distributed computation of a spanning tree in a dynamic graph by mobile agents. In: Proceedings of IEEE 1st International Conference on Engineering of Intelligent Systems, pp 425–430
Abbas S, Mosbah M, Zemmari A (2007) Collecte d’informations par des agents mobiles. In: Proceedings of New Technologies for Distributed Systems (NOTERE’2007), HERMES
Alpern J, Baston V, Essegaier S (1999) Rendezvous search on a graph. Journal of Applied Probablity 3(1):223–231
Alpern S (1995) The rendezvous search problem. SIAM J on Control and Optimization 33(3):673–683
Alpern S (2002) Rendezvous search on labelled networks. Naval Research Logistics 49:256–274
Alpern S, Gal S (2002) The thoery of search games and rendezvous. International Series in Operations Research and Management Science, number 55. Kluwer Academic Publishers
Anderson E, Weber R (1990) The rendezvous problem on discrete locations. Journal of Applied Probablity 28:839–851
Bar-Ilan J, Zernick D (1989) Random leaders and random spanning trees. In: Proceedings of the 3rd IWDAG
Baston V, Gal S (1998) Rendezvous on the line when the players’ initial distance is given by an unkown probability distribution. SIAM J on Control and Optimization 36:1880–1889
Bshouty NH, Higham L, Warpechowska-Gruca J (1999) Meeting times of random walks on graphs. Information Processing Letters 69(5):259–265
Flocchini P, Prencipe G, Santoro N, Widmayer P (2001) Gathering of asynchronous oblivious robots with limited visbility. In: Proc. 18th Annual Symposium on Theoratical Aspects of Computer Science, LNCS 2010, pp 247–258
Kemeny, Snell (1960) Finite Markov Chains. D. Van Nostrand
Kranakis E, Krizanc D, Rajsbaum S (2006) Mobile agent rendezvous: A survey. In: SIROCCO, LNCS 4056, pp 1–9
Lim W, Alpern S (1996) Minimax rendezvous on the line. SIAM J on Control and Optimization 34(5):1650–1665
Thomas L (1992) Finding your kids when they are lost. Journal on Operational Reseach 43(5):637–639
Yu X, Yung M (1996) Agent rendezvous: A dyanmic symmetry-breaking problem. In: 23rd International Colloquium on Automata, Languages and Programming (ICALP), LNCS 1099, pp 610–621
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abbas, S., Mosbah, M., Zemmari, A. (2008). Merging Time of Random Mobile Agents. In: Kreowski, HJ., Scholz-Reiter, B., Haasis, HD. (eds) Dynamics in Logistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76862-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-76862-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76861-6
Online ISBN: 978-3-540-76862-3
eBook Packages: EngineeringEngineering (R0)