arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.3223cs.MAcs.CGcs.DC
收藏

多智能体系统的随机最优一致性

Randomized Optimal Consensus of Multi-agent Systems

Guodong Shi, Karl Henrik Johansson

摘要:

在本文中,我们制定和解决多智能体系统的随机最优一致性问题的随机时变互连拓扑结构。所考虑的多智能体系统采用简单的随机化迭代规则,在求解目标函数$f_i$的最优解集只能由智能体$i$自身观测的优化问题$\min_{z\in \mathds{R}^d}\ \sum_{i=1}^n f_i(z),$的同时,达到了几乎必然的一致性.在每个时间步,简单地由伯努利试验确定,每个代理独立地和随机地选择在其邻居集合中取平均值,或者投影到其自己的优化组件的最优解集合上。研究了有向通信图和双向通信图。在适当的凸性和相交假设下,给出了保证最优一致性的连通性条件。利用凸分析进行了收敛性分析。通过一个数值例子比较了随机算法和确定性算法。结果表明,一组自主智能体可以达到一个最佳的意见,每个节点简单地使一个随机的权衡之间遵循其邻居或坚持自己的意见,在每个时间步。

英文摘要:

In this paper, we formulate and solve a randomized optimal consensus problem for multi-agent systems with stochastically time-varying interconnection topology. The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem $\min_{z\in \mathds{R}^d}\ \sum_{i=1}^n f_i(z),$ in which the optimal solution set of objective function $f_i$ can only be observed by agent $i$ itself. At each time step, simply determined by a Bernoulli trial, each agent independently and randomly chooses either taking an average among its neighbor set, or projecting onto the optimal solution set of its own optimization component. Both directed and bidirectional communication graphs are studied. Connectivity conditions are proposed to guarantee an optimal consensus almost surely with proper convexity and intersection assumptions. The convergence analysis is carried out using convex analysis. We compare the randomized algorithm with the deterministic one via a numerical example. The results illustrate that a group of autonomous agents can reach an optimal opinion by each node simply making a randomized trade-off between following its neighbors or sticking to its own opinion at each time step.

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

↑