Skip to main content
SpringerLink
Log in

Using a Collective of Agents for Exploration of Undirected Graphs

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper considers the problem of exploration of finite undirected graphs by a collective of agents. Two agents-researchers simultaneously traverse a graph, read and change labels of graph elements, and send necessary information to the agent-experimenter constructing a representation of the graph being explored. An exploration algorithm is proposed with a linear (with respect to the number of vertices) time complexity and a quadratic space complexity. An optimization procedure is developed that partitions a graph with a view to exploring its parts by different agents. Each of the agents traversing a graph needs two different colors (three colors are used in the aggregate) for exploring a graph. The algorithm is based on the depth-first traversal method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Albers and M. R. Henzinger, “Exploring unknown environments,” SIAM J. on Comput., 29, No. 4, 1164–1188 (2000).

    Article  MATH  MathSciNet  Google Scholar 

  2. G. Kilibarda, V. B. Kudryavtsev, and Š. M. Ušćumlić, “Independent systems of automata in labyrinths,” Discrete Mathematics, 15, No. 2, 3–39 (2003).

    Google Scholar 

  3. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, “Map validation in a graphlike world,” in: Proc. 13th Intern. Joint Conf. on Artificial Intelligence (Chambery, France, August 1993); Morgan Kaufmann Publishers Inc., San Francisco (1993), pp. 1648–1653.

  4. G. Kilibarda, V. B. Kudryavtsev, and Š. M. Ušćumlić, “Collectives of automata in labyrinths,” Discrete Mathematics, 15, No. 3, 3–40 (2003).

    Google Scholar 

  5. I. S. Grunsky and S. V. Sapunov, “Monitoring graphs with labeled vertices,” in: Proc. Donetsk State Techn. Un-ty, Ser. Computer Engineering and Automatics, No. 38 (2002), pp. 226–232.

  6. I. S. Grunsky and A. V. Stepkin, “Exploration of a finite graph by a collective of agents,” in: Proc. IAMM of NAS of Ukraine, 19, 43–52 (2009).

  7. A. V. Stepkin, “Possibility and complexity of exploring graphs by three agents,” Taurida Journal of Computer Science Theory and Mathematics, No. 1 (20), 88–98 (2012).

  8. T. H. Cormen and C. E. Leiserson, Algorithms: Design and Analysis [Russian translation], MCCME, Moscow (2001).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Donbass State Pedagogical University, Slovyansk, Ukraine

    A. V. Stepkin

Authors
  1. A. V. Stepkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Stepkin.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 75–88, March–April, 2015

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Stepkin, A.V. Using a Collective of Agents for Exploration of Undirected Graphs. Cybern Syst Anal 51, 223–233 (2015). https://doi.org/10.1007/s10559-015-9715-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-015-9715-z

Keywords

Search

Navigation