arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.02568cs.MAeess.SPmath.AT
收藏

多智能体系统中的格论

Lattice Theory in Multi-Agent Systems

Hans Riess

AI总结:

本文提出将基于格的多智能体信息系统建模为格值层,构建了带有 Tarski 拉普拉斯算子的离散 Hodge 理论,并通过 Hodge-Tarski 定理揭示了算子不动点与层全局截面间的联系,为信号处理和多智能体语义学提供了新应用。

摘要:

在本论文中,我们论证了(序)基于格的多智能体信息系统构成了一大类网络化多智能体系统,其中节点间传递关系数据。在数学上将其建模为格值层,我们提出了一种离散 Hodge 理论,其带有一个类似于图拉普拉斯算子和图连接拉普拉斯算子的拉普拉斯算子,作用于数据对 Tarski 层节点的指派。Hodge-Tarski 定理(主定理)将此算子(为致敬 Tarski 不动点定理而称为 Tarski 拉普拉斯算子)的不动点理论与该层的全局截面(一致全局状态)联系起来。我们展示了在信号处理和多智能体语义学中的新应用,并在全文提供了大量示例。

英文摘要:

In this thesis, we argue that (order-) lattice-based multi-agent information systems constitute a broad class of networked multi-agent systems in which relational data is passed between nodes. Mathematically modeled as lattice-valued sheaves, we initiate a discrete Hodge theory with a Laplace operator, analogous to the graph Laplacian and the graph connection Laplacian, acting on assignments of data to the nodes of a Tarski sheaf. The Hodge-Tarski theorem (the main theorem) relates the fixed point theory of this operator, called the Tarski Laplacian in deference to the Tarski Fixed Point Theorem, to the global sections (consistent global states) of the sheaf. We present novel applications to signal processing and multi-agent semantics and supply a plethora of examples throughout.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑