Optimal deterministic protocols for mobile robots on a grid

DOI10.1006/INCO.2000.3004MaRDI QIDQ1854509zbMATH OpenOpenAlexFDO

Authors Roberto Grossi, Andrea Pietracaprina, Geppino Pucci

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.2000.3004

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Transportation, logistics and supply chain management (90B06)

Recommendations

• Optimal deterministic protocols for mobile robots on a grid
• A point set connection problem for autonomous mobile robots in a grid
• Optimal deterministic ring exploration with oblivious asynchronous robots
• Uniform scattering of autonomous mobile robots in a grid
• Gathering of oblivious robots on infinite grids with minimum traveled distance

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• On social laws for artificial agent societies: off-line design
• Safe and efficient traffic laws for mobile robots

Cited in

(4)

• Optimal deterministic protocols for mobile robots on a grid
• A point set connection problem for autonomous mobile robots in a grid
• Anonymous graph exploration without collision by mobile robots
• Store-and-forward multicast routing on the mesh

This page was built for publication: Optimal deterministic protocols for mobile robots on a grid

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