Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots
The Computer Journal(2021)
摘要
We consider swarms of asynchronous oblivious robots evolving into an anonymous grid-shaped network. In this context, we investigate optimal (w.r.t. the number of robots) deterministic solutions for the terminating exploration problem. We first show lower bounds in the semi-synchronous model. Precisely, we show that at least three robots are required to explore any grid of at least three nodes, eve...
更多查看译文
关键词
oblivious robots,terminating exploration,finite discrete space,grid
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络