arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.00120math.ATmath.OC
收藏

最优网络控制的层理论框架

Sheaf-theoretic framework for optimal network control

Griffin M. Kearney, Kevin F. Palmowski, Michael Robinson

摘要:

在本文中,我们使用工具,从层理论建模和分析最优网络控制问题及其相关的离散松弛。我们考虑一个一般的问题设置中,设备和它们的因果关系被表示为一个有向网络,该设备的状态随着时间的推移,根据已知的动态和控制动作的存在或不存在。首先,我们简要介绍了偏序层理论中的关键概念。这个基础是用来构建一系列的层,建立在对方的模型的问题,最优控制,最终的结果证明,解决我们的最优控制问题是相当于找到一个分配给一个层,具有最小的一致性半径,并限制在一个特定的子层的整体瓣。因此,建立的框架被应用到一个模型被离散化的状态和控制变量是布尔性质的一个特定的情况下,我们提供了一个一般的边界这样的离散化过程中所产生的错误。最后,我们提出了这些理论工具的应用程序,证明了这一界的改进时,系统动力学仿射。

英文摘要:

In this paper, we use tools from sheaf theory to model and analyze optimal network control problems and their associated discrete relaxations. We consider a general problem setting in which pieces of equipment and their causal relations are represented as a directed network, and the state of this equipment evolves over time according to known dynamics and the presence or absence of control actions. First, we provide a brief introduction to key concepts in the theory of sheaves on partial orders. This foundation is used to construct a series of sheaves that build upon each other to model the problem of optimal control, culminating in a result that proves that solving our optimal control problem is equivalent to finding an assignment to a sheaf that has minimum consistency radius and restricts to a global section on a particular subsheaf. The framework thus built is applied to the specific case where a model is discretized to one in which the state and control variables are Boolean in nature, and we provide a general bound for the error incurred by such a discretization process. We conclude by presenting an application of these theoretical tools that demonstrates that this bound is improved when the system dynamics are affine.

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

↑