Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings

DOI10.1007/978-3-642-13284-1_9zbMath1284.68562OpenAlexW1547405448MaRDI QIDQ3569119

Taisuke Izumi, Tomoko Izumi, Fukuhito Ooshita, Sayaka Kamei

Publication date: 17 June 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13284-1_9

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (15)

Memory optimal dispersion by anonymous mobile robots ⋮ Gathering over Meeting Nodes in Infinite Grid* ⋮ Optimal probabilistic ring exploration by semi-synchronous oblivious robots ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Gathering on rings under the look-compute-move model ⋮ Universal Systems of Oblivious Mobile Robots

This page was built for publication: Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings