Problem
Research questions and friction points this paper is trying to address.
Generalized Nash Equilibrium
distributed algorithm
multi-robot placement
shared constraints
communication overhead
Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers
🤖 AI Summary
本文提出了一种无需交换拉格朗日乘子的全分布式算法，解决了多机器人放置任务中的广义纳什均衡问题，降低了通信开销并提高了隐私性。
📝 Abstract
Recent machine learning research has increasingly focused on equilibrium analysis in non-cooperative games rather than solely on optimal solutions. Many such problems involve shared constraints and can be formulated as Generalized Nash Equilibrium Problems (GNEPs). For strongly monotone games, existing methods compute consensus-based variational GNEs (v-GNEs) by exchanging Lagrange multipliers. We propose a fully distributed continuous-time algorithm for shared linear equality constraints that converges without multiplier exchange and reaches any GNE, reducing communication overhead and improving privacy. Discrete-time schemes are also provided, and the method is validated on a multi-robot placement task.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Fully Distributed
Generalized Nash Equilibrium
Shared Linear Equality Constraints
No Multiplier Exchange
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
