任意动态危险网络的安全探索
Safe Exploration of Arbitrary Dynamic Dangerous Networks
查看机构详情
- School of Computer Science, Carleton University（卡尔顿大学计算机学院）
- School of Electrical Engineering and Computer Science, University of Ottawa（渥太华大学电气与计算机工程学院）
- Department of Computer Science, Università di Pisa（比萨大学计算机科学系）
机构由 AI 辅助整理，请以论文原文为准。
浏览论文内容
中文总结 AI 辅助
本文研究危险动态网络中的安全探索问题，提出无记忆智能体可永久探索安全节点，并给出带ID和内存的智能体终止算法，同时证明无法仅标记黑洞端口。
中文摘要 AI 辅助
给定一组位于基于图的网络节点上的智能体，探索问题要求每个节点至少被一个智能体访问。在静态网络的经典分布式设置中，智能体不知道网络的拓扑结构；在最近研究的动态网络设置中，智能体可能具有关于图类（例如树、环面、环）或其他参数（例如节点数量）的先验知识。Gotoh等人（2021年）首次研究了任意动态网络的探索问题，在必要的最小假设下，即任意两个节点将通过时间路径无限频繁地连接（时间连通性假设）。在本文中，我们通过考虑危险动态网络（即可能包含一个或多个黑洞）来扩展他们对时间连通性下探索的研究。每当智能体进入黑洞时，它将永远被困住。安全探索问题要求团队探索所有安全节点，确保至少有一个智能体永远不会被困在黑洞中。我们首先证明，在给定必要（且充分）数量的智能体的情况下，一组 oblivious（无记忆）智能体可以在半同步调度器下，无需任何关于网络或团队的先验知识，无需智能体或节点ID，永久地探索安全节点。然后，我们提供了一种算法，使智能体能够安全地探索网络并终止。在这种情况下，智能体配备有唯一ID和持久内存，并且它们知道安全节点的数量。然而，在这两种情况下，我们证明动态网络上的智能体团队不可能仅正确标记通向黑洞的端口。
英文摘要
Given a team of agents on the nodes of a graph-based network, the exploration problem requires each node to be visited by at least one agent. In the classical distributed setting of static networks, agents do not know the topology of the network; in the more recently investigated setting of dynamic networks, they may have prior knowledge about the graph class (e.g., trees, tori, rings) or other parameters (e.g., number of nodes). Gotoh et al. (2021) are the first to study the exploration problem of arbitrary dynamic networks, under the necessary minimal assumption that any two nodes will be connected by a temporal path infinitely often (temporal connectivity assumption). In this paper, we extend their study of exploration under temporal connectivity by considering dangerous dynamic networks, i.e., containing possibly one or more black holes. Whenever an agent enters a black hole, it will be trapped forever. The safe exploration problem requires a team to explore all the safe nodes, ensuring that at least one agent will never be trapped in a black hole. We first prove that, given the necessary (and sufficient) number of agents, a team of oblivious agents can perpetually explore the safe nodes without any prior knowledge of the network or the team, without agent or node IDs, under semi-synchronous schedulers. Then, we provide an algorithm that enables agents to safely explore the network and terminate. In this case, agents are equipped with unique IDs and persistent memory, and they know the number of safe nodes. Yet, in both cases, we prove that it is impossible for a team of agents on dynamic networks to correctly mark only the ports leading to black holes.
