Distributed Optimization Algorithm for Discrete-Time Heterogeneous Multi-Agent Systems with Nonuniform Stepsizes

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper is devoted to the distributed optimization problem of heterogeneous multi-Agent systems, where the communication topology is jointly strongly connected and the dynamics of each agent is the first-order or second-order integrator. A new distributed algorithm is first designed for each agent based on the local objective function and the local neighbors' information that each agent can access. By a model transformation, the original closed-loop system is converted into a time-varying system and the system matrix of which is a stochastic matrix at any time. Then, by the properties of the stochastic matrix, it is proven that all agents' position states can converge to the optimal solution of a team objective function provided the union communication topology is strongly connected. Finally, the simulation results are provided to verify the effectiveness of the distributed algorithm proposed in this paper.

Cite

CITATION STYLE

APA

Mo, L., Li, J., & Huang, J. (2019). Distributed Optimization Algorithm for Discrete-Time Heterogeneous Multi-Agent Systems with Nonuniform Stepsizes. IEEE Access, 7, 87303–87312. https://doi.org/10.1109/ACCESS.2019.2925414

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free