.png){kind=icon}
.png){kind=icon}
Return
Distributed Algorithm for Solving Convex Inequalities
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2017.2771140.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this note, 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. Simulation examples are presented to demonstrate the effectiveness of the theoretical results.
Keywords:
Consensus
convex inequalities
distributed optimization
multi-agent system (MAS)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W