Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots

DOI10.1007/978-3-540-69355-0_5zbMath1143.68337OpenAlexW2086960916MaRDI QIDQ3511387

David Ilcinkas, Andrzej Pelc, Paola Flocchini, Nicola Santoro

Publication date: 10 July 2008

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69355-0_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14)

Related Items (2)

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Optimal graph exploration without good maps
• Impossibility of gathering by a set of autonomous mobile robots
• Gathering asynchronous oblivious mobile robots in a ring
• Local Algorithms for Autonomous Robot Systems
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Exploring Unknown Undirected Graphs
• Exploring Unknown Environments
• Algorithms – ESA 2005

This page was built for publication: Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots