Years and Authors of Summarized Original Work
1952; Shannon
Problem Definition
How can a network be explored efficiently with the help of mobile agents? This is a very broad question and to answer it adequately it will be necessary to understand more precisely what mobile agents are, what kind of networked environment they need to probe, and what complexity measures are interesting to analyze.
Mobile Agents
Mobile agents are autonomous, intelligent computer software that can move within a network. They are modeled as automata with limited memory and computation capability and are usually employed by another entity (to which they must report their findings) for the purpose of collecting information. The actions executed by the mobile agents can be discrete or continuous and transitions from one state to the next can be either deterministic or non-deterministic, thus giving rise to various natural complexity measures depending on the assumptions being considered.
Network Model
The...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Albers S, Henzinger MR (2000) Exploring unknown environments. SIAM J Comput 29:1164–1188
Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer, Norwell
Bar-Eli E, Berman P, Fiat A, Yan R (1994) On-line navigation in a room. J Algorithms 17:319–341
Bender MA, Fernandez A, Ron D, Sahai A, Vadhan S (1998) The power of a pebble: exploring and mapping directed graphs. In: Proceedings of the 30th annual symposium on theory of computing, Dallas, 23–26 May 1998, pp 269–278
Blum A, Raghavan P, Schieber B (1997) Navigating in unfamiliar geometric terrain. SIAM J Comput 26:110–137
De Marco G, Gargano L, Kranakis E, Krizanc D, Pelc A, Vaccaro U (2006) Asynchronous deterministic rendezvous in graphs. Theor Comput Sci 355:315–326
Deng X, Kameda T, Papadimitriou CH (1998) How to learn an unknown environment I: the rectilinear case. J ACM 45:215–245
Deng X, Papadimitriou CH (1999) Exploring an unknown graph. J Graph Theory 32:265–297
Diks K, Fraigniaud P, Kranakis E, Pelc A (2004) Tree exploration with little memory. J Algorithms 51:38–63
Flocchini P, Kranakis E, Krizanc D, Santoro N, Sawchuk C (2004) Multiple mobile agent rendezvous in the ring. In: Proceedings of the LATIN 2004, Bueons Aires, 5–8 Apr 2004. LNCS, vol 2976, pp 599–608
Fraigniaud P, Ilcinkas D, Peer G, Pelc A, Peleg D (2005) Graph exploration by a finite automaton. Theor Comput Sci 345:331–344
Kranakis E, Singh H, Urrutia J (1999) Compass routing in geometric graphs. In: Proceedings of the 11th Canadian conference on computational geometry (CCCG-99), Vancouver, 15–18 Aug 1999, pp 51–54
Kranakis E, Krizanc D, Santoro N, Sawchuk C (2003) Mobile agent rendezvous search problem in the ring. In: Proceedings of the international conference on distributed computing systems (ICDCS), Providence, 19–22 May 2003, pp 592–599
Kranakis E, Krizanc D, Markou E (2006) Mobile agent rendezvous in a synchronous torus. In: Correa J, Hevia A, Kiwi M (eds) Proceedings of LATIN 2006, 7th Latin American symposium, Valdivia, 20–24 March 2006. SVLNCS, vol 3887, pp 653–664
Panaite P, Pelc A (1999) Exploring unknown undirected graphs. J Algorithms 33:281–295
Sawchuk C (2004) Mobile agent rendezvous in the ring. PhD thesis, Carleton University, Ottawa
Shannon C (1951) Presentation of a maze solving machine, in cybernetics, circular, causal and feedback machines in biological and social systems. In: von Feerster H, Mead M, Teuber HL (eds) Trans. 8th Conf, New York, March 15–16, 1951, pp 169–181. Josiah Mary Jr. Foundation, New York (1952)
Weiss G (ed) (1999) Multiagent systems: a modern approach to distributed artificial intelligence. MIT, Cambridge, MA
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Kranakis, E., Krizanc, D. (2016). Mobile Agents and Exploration. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_242
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_242
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering