Static and expanding grid coverage with ant robots: complexity results

DOI10.1016/j.tcs.2011.05.001zbMath1221.68245arXiv1011.5914OpenAlexW2069083556MaRDI QIDQ638536

Yaniv Altshuler, Alfred Marcel Bruckstein

Publication date: 12 September 2011

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

Full work available at URL: https://arxiv.org/abs/1011.5914

zbMATH Keywords

decentralized systemsgrid searchcollaborative cleaningcollaborative searchexpanding domains

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Related Items (4)

TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks ⋮ A local strategy for cleaning expanding cellular domains by simple robots ⋮ Markov chain analysis of self-organizing mobile nodes self-organizing mobile nodes ⋮ Position discovery for a system of bouncing robots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of pursuit on a graph
• Efficiently searching a graph by a smell-oriented vertex process
• On the cover time of planar graphs
• From ants to a(ge)nts: a special issue on ant-robotics
• Real-time heuristic search
• Trading Space for Time in Undirected s-t Connectivity
• Coordination in multi-agent RoboCup teams
• Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
• Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
• Randomized Pursuit-Evasion with Local Visibility
• Lion and Man: The General Case

This page was built for publication: Static and expanding grid coverage with ant robots: complexity results