返回
Distributed Optimization for Second-Order Discrete-Time Multiagent Systems With Set Constraints
DOI:10.1109/TNNLS.2021.3130173.png)
摘要
En 中文
The optimization problem of second-order discrete-time multiagent systems with set constraints is studied in this article. In particular, the involved agents cooperatively search an optimal solution of a global objective function summed by multiple local ones within the intersection of multiple constrained sets. We also consider that each pair of local objective function and constrained set is exclusively accessible to the respective agent, and each agent just interacts with its local neighbors. By borrowing from the consensus idea, a projection-based distributed optimization algorithm resorting to an auxiliary dynamics is first proposed without interacting the gradient information of local objective functions. Next, by considering the local objective functions being strongly convex, selection criteria of step size and algorithm parameter are built such that the unique solution to the concerned optimization problem is obtained. Moreover, by fixing a unit step size, it is also shown that the optimization result can be relaxed to the case with just convex local objective functions given a properly chosen algorithm parameter. Finally, practical and numerical examples are taken to verify the proposed optimization results.
Keyword:
Optimization
Heuristic algorithms
Linear programming
Multi-agent systems
Convergence
Topology
Distributed algorithms
Consensus
convex functions
discrete-time systems
distributed optimization
multiagent systems
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Nonconvex Constrained Consensus of Discrete-Time Heterogeneous Multi-Agent Systems With Arbitrarily Switching Topologies具有任意切换拓扑的离散时间异构多智能体系统的非凸约束一致性
IEEE ACCESS
IF3.6

