存在拜占庭黑洞的环的永久探索
Perpetual Exploration of a Ring in Presence of Byzantine Black Hole
AI总结：
本文研究了同步智能体在存在拜占庭黑洞（可擦除节点信息）的环拓扑中的永久探索问题，探讨了多种初始位置与通信模型，并证明了在同址且带白板条件下仅需3个智能体即可实现目标。
摘要：
永久探索是移动智能体领域的一个基本问题，要求智能体必须无限次地访问每个节点。该问题受到了广泛关注，主要集中在环拓扑结构上，而黑洞的存在增加了其复杂性。黑洞可以在没有任何可观察痕迹的情况下摧毁任何进入的智能体。在\cite{BampasImprovedPeriodicDataRetrieval,KralovivcPeriodicDataRetrievalFirst}中，作者在“周期性数据检索”的背景下考虑了这一问题。他们引入了一种名为灰洞的黑洞变体（对手可以选择是摧毁智能体还是让其通过），并证明了如果环的每个节点都有白板，那么4个异步且同址的智能体对于解决此类灰洞存在下的该问题（进而包括永久探索）是必不可少的。本文研究了在“拜占庭黑洞”存在下环的探索问题。除了具备灰洞的能力外，在这种变体中，对手还可以选择是否擦除该节点上任何先前存储的信息。先前的研究仅探讨了特定的初始场景（即智能体同址）和特定的通信模型（即白板）。现在，可能存在所有智能体并非同址的其他初始场景。此外，还有许多更弱的通信模型（如面对面、Pebble）有待研究。本文中的智能体是同步的。主要结果致力于在各种通信模型和起始位置下，通过最小化智能体数量来确保即使存在此类节点也能实现永久探索。进一步地，通过权衡调度器的能力，我们在同址且存在白板的情况下，针对该问题（其中恶意节点是灰洞的广义版本）取得了更优的上下界结果（即3个智能体）。
英文摘要：
Perpetual exploration is a fundamental problem in the domain of mobile agents, where an agent needs to visit each node infinitely often. This issue has received lot of attention, mainly for ring topologies, presence of black holes adds more complexity. A black hole can destroy any incoming agent without any observable trace. In \cite{BampasImprovedPeriodicDataRetrieval,KralovivcPeriodicDataRetrievalFirst}, the authors considered this problem in the context of \textit{ Periodic data retrieval}. They introduced a variant of black hole called gray hole (where the adversary chooses whether to destroy an agent or let it pass) among others and showed that 4 asynchronous and co-located agents are essential to solve this problem (hence perpetual exploration) in presence of such a gray hole if each node of the ring has a whiteboard. This paper investigates the exploration of a ring in presence of a ``byzantine black hole''. In addition to the capabilities of a gray hole, in this variant, the adversary chooses whether to erase any previously stored information on that node. Previously, one particular initial scenario (i.e., agents are co-located) and one particular communication model (i.e., whiteboard) are investigated. Now, there can be other initial scenarios where all agents may not be co-located. Also, there are many weaker models of communications (i.e., Face-to-Face, Pebble) where this problem is yet to be investigated. The agents are synchronous. The main results focus on minimizing the agent number while ensuring that perpetual exploration is achieved even in presence of such a node under various communication models and starting positions. Further, we achieved a better upper and lower bound result (i.e., 3 agents) for this problem (where the malicious node is a generalized version of a gray hole), by trading-off scheduler capability, for co-located and in presence of a whiteboard.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
