概率通信下分散式子模最大化的最优性间隙
Optimality Gap of Decentralized Submodular Maximization under Probabilistic Communication
AI总结:
本文针对划分拟阵约束下的分散式子模最大化问题,提出考虑连通设备通信成功率的感知通信框架,引入概率最优性间隙概念,为不确定通信环境下的分散系统设计提供理论支撑与实践指导,数值算例验证了结果的有效性。
摘要:
本文研究了划分拟阵约束下的分散式子模最大化问题,采用带智能体间概率消息传递的序列贪心算法求解。我们提出了一个感知通信的框架,该框架考虑了连通设备之间通信成功的概率。我们的分析引入了概率最优性间隙的概念,凸显了它在基于智能体广播可靠性确定消息传递序列、以及在资源受限环境中针对可多次广播消息的智能体制定策略决策方面的潜在影响。本工作不仅提供了理论见解,还对不确定通信环境中分散系统的设计与分析具有实际意义,一个数值算例验证了我们结果的影响。
英文摘要:
This paper considers the problem of decentralized submodular maximization subject to partition matroid constraint using a sequential greedy algorithm with probabilistic inter-agent message-passing. We propose a communication-aware framework where the probability of successful communication between connected devices is considered. Our analysis introduces the notion of the probabilistic optimality gap, highlighting its potential influence on determining the message-passing sequence based on the agent's broadcast reliability and strategic decisions regarding agents that can broadcast their messages multiple times in a resource-limited environment. This work not only contributes theoretical insights but also has practical implications for designing and analyzing decentralized systems in uncertain communication environments. A numerical example demonstrates the impact of our results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。