Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Mobile Agents and Exploration

  • Evangelos Kranakis
  • Danny Krizanc
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_242

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



Distributed algorithms Graph exploration Mobile agent Navigation Rendezvous Routing Time/Memory tradeoffs 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Albers S, Henzinger MR (2000) Exploring unknown environments. SIAM J Comput 29:1164–1188MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer, NorwellzbMATHGoogle Scholar
  3. 3.
    Bar-Eli E, Berman P, Fiat A, Yan R (1994) On-line navigation in a room. J Algorithms 17:319–341MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    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–278Google Scholar
  5. 5.
    Blum A, Raghavan P, Schieber B (1997) Navigating in unfamiliar geometric terrain. SIAM J Comput 26:110–137MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    De Marco G, Gargano L, Kranakis E, Krizanc D, Pelc A, Vaccaro U (2006) Asynchronous deterministic rendezvous in graphs. Theor Comput Sci 355:315–326MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Deng X, Kameda T, Papadimitriou CH (1998) How to learn an unknown environment I: the rectilinear case. J ACM 45:215–245MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Deng X, Papadimitriou CH (1999) Exploring an unknown graph. J Graph Theory 32:265–297MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Diks K, Fraigniaud P, Kranakis E, Pelc A (2004) Tree exploration with little memory. J Algorithms 51:38–63MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    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–608Google Scholar
  11. 11.
    Fraigniaud P, Ilcinkas D, Peer G, Pelc A, Peleg D (2005) Graph exploration by a finite automaton. Theor Comput Sci 345:331–344MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    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–54Google Scholar
  13. 13.
    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–599Google Scholar
  14. 14.
    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–664Google Scholar
  15. 15.
    Panaite P, Pelc A (1999) Exploring unknown undirected graphs. J Algorithms 33:281–295MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Sawchuk C (2004) Mobile agent rendezvous in the ring. PhD thesis, Carleton University, OttawaGoogle Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    Weiss G (ed) (1999) Multiagent systems: a modern approach to distributed artificial intelligence. MIT, Cambridge, MAGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Evangelos Kranakis
    • 1
  • Danny Krizanc
    • 2
  1. 1.Department of Computer ScienceCarletonOttawaCanada
  2. 2.Department of Computer ScienceWesleyan UniversityMiddletownUSA