Of robot ants and elephants: a computational comparison

DOI10.1016/J.TCS.2011.06.026zbMath1234.68382OpenAlexW627853365MaRDI QIDQ719319

Asaf Shiloni, Gal A. Kaminka, Noa Agmon

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.026

zbMATH Keywords

antscomputational capabilities of robotselephants

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Cites Work

• Multi-robot area patrol under frequency constraints
• Local spreading algorithms for autonomous robot systems
• Remembering without memory: tree exploration by asynchronous oblivious robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Gathering few fat mobile robots in the plane
• From ants to a(ge)nts: a special issue on ant-robotics
• Vertex-ant-walk -- a robust method for efficient exploration of faulty graphs
• Gathering asynchronous oblivious mobile robots in a ring
• Competitive algorithms for server problems
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Unnamed Item

This page was built for publication: Of robot ants and elephants: a computational comparison