Gathering identical autonomous systems on a circle using stigmergy

DOI10.1007/s00446-012-0178-4zbMath1257.68143OpenAlexW2002543755MaRDI QIDQ1938388

Dmitry N. Kozlov

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-012-0178-4

zbMATH Keywords

protocolswarm intelligencedistributed algorithmgeometric algorithmant algorithmgathering problempheromone communication

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Gathering asynchronous oblivious mobile robots in a ring
• The Combinatorial Structure of Wait-Free Solvable Tasks
• The topological structure of asynchronous computability
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• LATIN 2004: Theoretical Informatics
• LATIN 2004: Theoretical Informatics
• Combinatorial algebraic topology

This page was built for publication: Gathering identical autonomous systems on a circle using stigmergy