arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.03161eess.SYcs.SY
收藏

求解凸不等式的分布式算法

Distributed algorithms for solving convex inequalities

Xidian University(西安电子科技大学);Peking University(北京大学)

Kaihong Lu, Gangshan Jing, Long Wang

AI总结:

本文提出一种基于子梯度的分布式算法,用于连续时间多智能体系统求解凸不等式的可行解,通过时间变化的有向通信图实现智能体间信息交换,最终达成一致并保证解集内的共识。

摘要:

本文提出了一种用于连续时间多智能体系统求解凸不等式可行解的分布式子梯度算法。该算法中,每个智能体在其自身不等式约束下达到状态,同时在时间变化的有向通信图下与其他智能体交换局部信息。通过验证通信图相关的弱连通性条件的有效性,证明所有智能体最终将达到一致,并且共识状态位于不等式的解集中。此外,该方法还被扩展用于求解分布式优化问题,即在满足凸不等式约束下最小化局部目标函数之和。通过一个仿真示例展示了理论结果的有效性。

英文摘要:

In this paper, a distributed subgradient-based algorithm is proposed for continuous-time multi-agent systems to search a feasible solution to convex inequalities. The algorithm involves each agent achieving a state constrained by its own inequalities while exchanging local information with other agents under a time-varying directed communication graph. With the validity of a mild connectivity condition associated with the communication graph, it is shown that all agents will reach agreement asymptotically and the consensus state is in the solution set of the inequalities. Furthermore, the method is also extended to solving the distributed optimization problem of minimizing the sum of local objective functions subject to convex inequalities. A simulation example is presented to demonstrate the effectiveness of the theoretical results.

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

↑