arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.00148math.OC
收藏

基于局部信息交换的网络控制鲁棒优化方法

A Robust Optimization Approach to Network Control Using Local Information Exchange

Georgios Darivianakis, Angelos Georghiou, Soroosh Shafiee, John Lygeros

AI总结:

本文针对网络智能体策略设计提出一种仅依赖邻居局部信息交换的分散式鲁棒优化框架,将原本难解的非凸问题转化为可高效求解的松耦合凸优化问题,并在能源管理与供应链应用中验证了其以较低计算代价逼近集中式解的效果。

摘要:

为智能体网络设计策略通常通过构造一个优化问题来完成,其中每个智能体都能获取网络中所有其他智能体的状态测量值。这种基于集中式信息交换的策略设计所产生的优化问题通常难以求解,需要建立大量通信链路,并且由于所有信息都在智能体之间共享而不利于隐私保护。基于任意通信结构设计策略可能导致非凸优化问题,这类问题通常是NP难的。在本文中,我们提出了一种用于分散式策略设计的优化框架。与集中式信息交换相比,我们的方法只需要相邻智能体之间进行局部通信交换,并与网络的物理耦合结构相匹配。因此,每个智能体只需要来自其直接邻居的信息,从而最大限度地减少了过度通信的需求,并促进了智能体之间的隐私保护。利用鲁棒优化技术,我们构造了一个具有松耦合结构的凸优化问题,可以高效求解。我们通过数值实验在能源管理和供应链应用中证明了所提方法的有效性。我们表明,所提方法得到的解能够以仅占集中式公式一小部分的计算代价,紧密逼近集中式公式所获得的解。

英文摘要:

Designing policies for a network of agents is typically done by formulating an optimization problem where each agent has access to state measurements of all the other agents in the network. Such policy designs with centralized information exchange result in optimization problems that are typically hard to solve, require establishing substantial communication links, and do not promote privacy since all information is shared among the agents. Designing policies based on arbitrary communication structures can lead to non-convex optimization problems which are typically NP-hard. In this work, we propose an optimization framework for decentralized policy designs. In contrast to the centralized information exchange, our approach requires only local communication exchange among the neighboring agents matching the physical coupling of the network. Thus, each agent only requires information from its direct neighbors, minimizing the need for excessive communication and promoting privacy amongst the agents. Using robust optimization techniques, we formulate a convex optimization problem with a loosely coupled structure that can be solved efficiently. We numerically demonstrate the efficacy of the proposed approach in energy management and supply chain applications. We show that the proposed approach leads to solutions that closely approximate those obtained by the centralized formulation only at a fraction of the computational effort.

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

↑