关于整数格上确定性、常量内存的三角搜索
On deterministic, constant memory triangular searches on the integer lattice
AI总结:
本文研究整数格上常量内存确定性智能体的搜索能力,证明三个确定性智能体无法发现整数格,并初步刻画了一个探索者加三个信标的探索算法。
摘要:
最近的研究表明,如果只允许局部、常量大小的通信,四个具有常量内存的确定性智能体能够发现整数格。此外,如果智能体的选择借助公平硬币来确定,已有结果证明三个智能体是发现整数格的必要且充分条件。在本文中,我们证明三个确定性智能体无法找到整数格,并概述了一种针对一个探索者、三个信标类型探索算法的可能刻画。
英文摘要:
Recently it has been shown that four constant memory, deterministic agents are able to discover the integer lattice if only local, constant-size communication is allowed. Moreover, if the agents' choices are determined with the help of a fair coin, it has been shown that three are necessary and sufficient to discover the integer lattice. In this paper, we show that three deterministic agents cannot find the integer lattice and sketch a possible characterization for one explorer, three beacons type of exploration algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。