Using collective of agents for exploration of graph
Problem of exploration finite undirected graphs by a collective of agents is considered in this work. Two agents-researchers simultaneously move on graph, they read and change marks of graph elements, transfer the information to the agent-experimenter (it builds explored graph representation). It wa...
Main Author: | Andrey Viktorovich Stepkin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Institute of Computer Science
2013-08-01
|
Series: | Компьютерные исследования и моделирование |
Subjects: | |
Online Access: | http://crm.ics.org.ru/uploads/crmissues/crm_2013_4/13402.pdf |
Similar Items
-
Complexité de l'exploration par agent mobile des graphes dynamiques
by: Wade, Ahmed mouhamadou
Published: (2014) -
Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication
by: Balamohan, Balasingham
Published: (2013) -
Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication
by: Balamohan, Balasingham
Published: (2013) -
Algorithms for deterministic parallel graph exploration
by: Pajak, Dominik
Published: (2014) -
Using Knowledge Anchors to Facilitate User Exploration of Data Graphs
by: Al-Tawil, M., et al.
Published: (2019)