不要害怕死亡：用更少智能体在动态图中进行黑洞搜索
Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents
- University of Manitoba（曼尼托巴大学）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
针对动态图中的黑洞搜索问题，我们提出用更少智能体（$2\delta_{BH}+3$个）完成安全定位，几乎匹配已知下界，显著改进了现有结果。
AI中文摘要：
我们考虑一组同步移动智能体在端口标记网络中运行。网络中有一个称为黑洞的节点，该节点会永久摧毁任何访问该节点的智能体。智能体团队必须安全地定位黑洞，即至少一个智能体必须存活，在黑洞相邻的节点终止其算法，并输出从当前位置通向黑洞的端口号。在网络为1-有界1-区间连通动态图的设置中，Kaur等人（SSS 2025）表明，由$2\delta_{BH}+17$个智能体组成的团队足以从分散配置解决该任务，其中$\delta_{BH}$表示黑洞节点的度。我们证明$2\delta_{BH}+3$个智能体就足够了，几乎匹配Kaur等人（ICDCN 2025）提供的$2\delta_{BH}+1$下界。
英文摘要：
We consider a team of synchronous mobile agents operating in a port-labeled network. There is one node in the network, called a black hole, that permanently destroys any agent that visits the node. The team of agents must safely locate the black hole, i.e., at least one agent must survive, terminate its algorithm at a node adjacent to the black hole, and output the port number that leads to the black hole from its current position. In the setting where the network is a 1-bounded 1-interval connected dynamic graph, Kaur et al. (SSS 2025) showed that a team consisting of $2δ_{BH}+17$ agents is sufficient to solve the task from a scattered configuration, where $δ_{BH}$ denotes the degree of the black hole node. We show that $2δ_{BH}+3$ agents are sufficient, nearly matching the $2δ_{BH}+1$ lower bound provided in Kaur et al. (ICDCN 2025).
