<p>Using collective of agents for exploration of graph</p>

Stepkin A.V.

Issue 4, 2013 Vol. 5

All issues

2024 Vol. 16
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1 (special issue)
2023 Vol. 15
- Issue 6
- Issue 5
- Issue 4 (special issue)
- Issue 3
- Issue 2 (special issue)
- Issue 1
2022 Vol. 14
- Issue 6
- Issue 5
- Issue 4 (special issue)
- Issue 3
- Issue 2 (special issue)
- Issue 1
2021 Vol. 13
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2 (special issue)
- Issue 1
2020 Vol. 12
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2019 Vol. 11
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2018 Vol. 10
- Issue 6
- Issue 5 (special issue)
- Issue 4
- Issue 3 (special issue)
- Issue 2
- Issue 1
2017 Vol. 9
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2016 Vol. 8
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2015 Vol. 7
- Issue 6
- Issue 5
- Issue 4
- Issue 3 (special issue)
- Issue 2
- Issue 1
2014 Vol. 6
- Issue 6 (special issue)
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2013 Vol. 5
- Issue 6 (special issue)
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2012 Vol. 4
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2011 Vol. 3
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2010 Vol. 2
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2009 Vol. 1
- Issue 4
- Issue 3
- Issue 2
- Issue 1

Using collective of agents for exploration of graph

Stepkin A.V.

pdf (110K) / Annotation

List of references:

И. С. Грунский, С. В. Сапунов. Контроль графов с отмеченными вершинами // Труды Донецк гос. тех. ун-та, сер.: Выч. Техника и автоматика. — 2002. — № 38. — С. 226–232.
И. С. Грунский, А. В. Ст¨епкин. Распознавание конечного графа коллективом агентов // Труды ИПММ НАН Украины. — 2009. — Т. 19. — С. 43–52.
Г. Килибарда, В. Б. Кудрявцев, Щ. Ушчумлич. Независимые системы автоматов в лабиринтах // Дискретная математика. — 2003. — Т. 15, № 2. — С. 3–39.
Г. Килибарда, В. Б. Кудрявцев, Щ. Ушчумлич. Коллективы автоматов в лабиринтах // Дискретная математика. — 2003. — Т. 15, № 3. — С. 3–40.
Т. Кормен, Ч. Лейзерсон. Алгоритмы: построение и анализ. — М: МЦНМО, 2001. — 960 с.
А. В. Ст¨епкин. Возможность и сложность распознавания графов тремя агентами // Таврический вестник информатики и математики. — 2012. — № 1(20). — С. 88–98.
S. Albers, M. R. Henzinger. Exploring unknown environments // SIAM Journal on Computing. — 2000. — V. 29, no. 4. — P. 1164–1188. — MathSciNet: MR1739718.
X. Deng, C. H. Papadimitriou. Exploring an unknown graph // Journal of Graph Theory. — 1999. — V. 32, no. 3. — P. 265–297. — MathSciNet: MR1716546.
G. Dudek, M. Jenkin, E. Milios, D. Wilkes. Map validation in a graphlike world / Proceedings of the 13th International Joint Conference on Artifical Intelligence. — San Fransisco: Morgan Kaufmann Publishers Inc, 1993. — P. 1648–1653. — Chambery, France, August 1993.

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"