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: | |
|---|---|
| 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 |
| id |
doaj-764e18b9cdec4edca2af8907a9404cea |
|---|---|
| record_format |
Article |
| spelling |
doaj-764e18b9cdec4edca2af8907a9404cea2020-11-25T01:54:35ZrusInstitute of Computer ScienceКомпьютерные исследования и моделирование2076-76332077-68532013-08-015452553210.20537/2076-7633-2013-5-4-525-5322062Using collective of agents for exploration of graphAndrey Viktorovich StepkinProblem 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 was constructed an algorithm linear (from amount of the graphs nodes) time complexity, quadratic space complexity and communication complexity, that is equal to O(n2·log(n)). Two agents (which move on graph) need two different colors (in total three colors) for graph exploration. An algorithm is based on depth-first traversal method.http://crm.ics.org.ru/uploads/crmissues/crm_2013_4/13402.pdfgraph explorationcollective of agents |
| collection |
DOAJ |
| language |
Russian |
| format |
Article |
| sources |
DOAJ |
| author |
Andrey Viktorovich Stepkin |
| spellingShingle |
Andrey Viktorovich Stepkin Using collective of agents for exploration of graph Компьютерные исследования и моделирование graph exploration collective of agents |
| author_facet |
Andrey Viktorovich Stepkin |
| author_sort |
Andrey Viktorovich Stepkin |
| title |
Using collective of agents for exploration of graph |
| title_short |
Using collective of agents for exploration of graph |
| title_full |
Using collective of agents for exploration of graph |
| title_fullStr |
Using collective of agents for exploration of graph |
| title_full_unstemmed |
Using collective of agents for exploration of graph |
| title_sort |
using collective of agents for exploration of graph |
| publisher |
Institute of Computer Science |
| series |
Компьютерные исследования и моделирование |
| issn |
2076-7633 2077-6853 |
| publishDate |
2013-08-01 |
| description |
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 was constructed an algorithm linear (from amount of the graphs nodes) time complexity, quadratic space complexity and communication complexity, that is equal to O(n2·log(n)). Two agents (which move on graph) need two different colors (in total three colors) for graph exploration. An algorithm is based on depth-first traversal method. |
| topic |
graph exploration collective of agents |
| url |
http://crm.ics.org.ru/uploads/crmissues/crm_2013_4/13402.pdf |
| work_keys_str_mv |
AT andreyviktorovichstepkin usingcollectiveofagentsforexplorationofgraph |
| _version_ |
1724986492382609408 |