Network Exploration by Silent and Oblivious Robots

DOI10.1007/978-3-642-16926-7_20zbMath1309.68148OpenAlexW1528015603MaRDI QIDQ3057626

Jérémie Chalopin, Bernard Mans, Paola Flocchini, Nicola Santoro

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_20

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (16)

Ring exploration with myopic luminous robots ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Optimal probabilistic ring exploration by semi-synchronous oblivious robots ⋮ Ring exploration of myopic luminous robots with visibility more than one ⋮ The beachcombers' problem: walking and searching with mobile robots ⋮ How many oblivious robots can explore a line ⋮ Optimal torus exploration by oblivious robots ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Communication and location discovery in geometric ring networks ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Gathering of oblivious robots on infinite grids with minimum traveled distance ⋮ Beachcombing on strips and islands ⋮ Self-stabilizing robots in highly dynamic environments ⋮ Universal Systems of Oblivious Mobile Robots ⋮ Exploring sparse graphs with advice

Cites Work

• Unnamed Item
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Remembering without memory: tree exploration by asynchronous oblivious robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Gathering asynchronous oblivious mobile robots in a ring
• Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems

This page was built for publication: Network Exploration by Silent and Oblivious Robots