Using a collective of agents for exploration of undirected graphs

DOI10.1007/S10559-015-9715-ZMaRDI QIDQ2515338zbMATH OpenOpenAlexFDO

Authors A. Stepkin

Publication date 31 July 2015

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-015-9715-z

zbMATH Keywords

collective of agentsgraph explorationgraph traversal

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)

Recommendations

• Exploration of a finite graph by a collective of agents
• Fast collaborative graph exploration
• Structural Information and Communication Complexity
• Fast collaborative graph exploration
• Tight bounds for undirected graph exploration with pebbles and multiple agents

Cites work

• Collectives of automata in labyrinths
• Exploration of a finite graph by a collective of agents
• Exploring Unknown Environments
• Independent systems of automata in labyrinths

Cited in

(7)

• Balanced parallel exploration of orthogonal regions
• Exploration of dynamic networks: tight bounds on the number of agents
• A basic algorithm for graph reconstruction
• Exploration of a finite graph by a collective of agents
• Tight bounds for undirected graph exploration with pebbles and multiple agents
• Structural Information and Communication Complexity
• Spectrum of graph recovery algorithms with a moving agent

This page was built for publication: Using a collective of agents for exploration of undirected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515338)