分布式约束共识的潜在博弈
Potential Games for Distributed Constrained Consensus
摘要:
研究了计算有限个闭凸集的交集中的公共点的问题,每个闭凸集为网络中的一个代理所知。这个问题,被称为分布式凸可行性问题或分布式约束一致性问题,构成了一个重要的研究目标,主要是由于大量的可能的应用。在这项工作中,这个问题是从博弈论的观点。特别是,我们制定的问题作为一个非合作的游戏,存在一个潜在的功能,并证明了这个游戏的所有纳什均衡对应的共识状态。在此基础上,开发了一种基于最佳响应的分布式算法,解决了约束一致性问题。此外,另一种方法来解决凸可行性问题的基础上的投影梯度型算法,寻求所考虑的潜在功能的最大值。导出了该格式收敛的条件,并给出了一个精确的分布式算法。最后,给出了一个源定位问题的仿真结果,验证了理论结果,并证明了衍生算法的适用性和性能。
英文摘要:
The problem of computing a common point that lies in the intersection of a finite number of closed convex sets, each known to one agent in a network, is studied. This issue, known as the distributed convex feasibility problem or the distributed constrained consensus problem, constitutes an important research goal mainly due to the large number of possible applications. In this work, this issue is treated from a game theoretic viewpoint. In particular, we formulate the problem as a non-cooperative game for which a potential function exists and prove that all Nash equilibria of this game correspond to consensus states. Based upon this analysis, a best-response based distributed algorithm that solves the constrained consensus problem is developed. Furthermore, one more approach to solve the convex feasibility problem is studied based upon a projected gradient type algorithm that seeks the maximum of the considered potential function. A condition for the convergence of this scheme is derived and an exact distributed algorithm is given. Finally, simulation results for a source localization problem are given, that validate the theoretical results and demonstrate the applicability and performance of the derived algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。