Mobile robots gathering algorithm with local weak multiplicity in rings

DOI10.1007/978-3-642-13284-1_9MaRDI QIDQ3569119zbMATH OpenOpenAlexFDO

Authors Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita

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)

Recommendations

• Gathering on rings under the look-compute-move model
• How to gather asynchronous oblivious robots on anonymous rings
• Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering Asynchronous Oblivious Mobile Robots in a Ring

Cited in

(20)

• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• Gathering robots in graphs: the central role of synchronicity
• Gathering on rings under the look-compute-move model
• Universal systems of oblivious mobile robots
• Gathering an even number of robots in an odd ring without global multiplicity detection
• Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
• Squaring the Circle with Weak Mobile Robots
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots
• Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
• Self-stabilizing gathering with strong multiplicity detection
• Computing on rings by oblivious robots: a unified approach for different tasks
• Gathering over Meeting Nodes in Infinite Grid*
• A unified approach for gathering and exclusive searching on rings under weak assumptions
• Memory optimal dispersion by anonymous mobile robots
• Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
• Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings
• An environment for specifying and model checking mobile ring robot algorithms
• Gathering on rings for myopic asynchronous robots with lights
• Memory optimal dispersion by anonymous mobile robots
• Gathering of robots on anonymous grids and trees without multiplicity detection

This page was built for publication: Mobile robots gathering algorithm with local weak multiplicity in rings

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