Input-Feedforward-Passivity-Based Distributed Optimization Over Jointly Connected Balanced Digraphs

DOI10.1109/TAC.2020.3028838MaRDI QIDQ4957703zbMATH OpenOpenAlexFDO

Authors Mengmou Li, Yiguang Hong, Graziano Chesi

Publication date 9 September 2021

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.03468

zbMATH Keywords

continuous-time algorithmsderivative feedbackinput feedforward passivityuniformly jointly strongly connected topologiesweight-balanced digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Multi-agent systems (93A16) Feedback control (93B52) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)

Abstract: In this paper, a distributed optimization problem is investigated via input feedforward passivity. First, an input-feedforward-passivity-based continuous-time distributed algorithm is proposed. It is shown that the error system of the proposed algorithm can be decomposed into a group of individual input feedforward passive (IFP) systems that interact with each other using output feedback information. Based on this IFP framework, convergence conditions of a suitable coupling gain are derived over weight-balanced and uniformly jointly strongly connected (UJSC) topologies. It is also shown that the IFP-based algorithm converges exponentially when the topology is strongly connected. Second, a novel distributed derivative feedback algorithm is proposed based on the passivation of IFP systems. While most works on directed topologies require knowledge of eigenvalues of the graph Laplacian, the derivative feedback algorithm is fully distributed, namely, it is robust against randomly changing weight-balanced digraphs with any positive coupling gain and without knowing any global information. Finally, numerical examples are presented to illustrate the proposed distributed algorithms.

Cited in

(9)

• Triggered gradient tracking for asynchronous distributed optimization
• Parallel feedforward compensation for output synchronization: fully distributed control and indefinite Laplacian
• Distributed convex optimization as a tool for solving \(f\)-consensus problems
• Distributed finite‐time optimization algorithms for multi‐agent systems under directed graphs
• A distributed finite‐time optimization algorithm for directed networks of continuous‐time agents
• Distributed primal-dual method on unbalanced digraphs with row stochasticity
• A passivity analysis for nonlinear consensus on balanced digraphs
• Event-triggered distributed optimal coordination of heterogeneous linear MASs over weight-unbalanced digraphs
• Passivity of nabla fractional order systems and its application on distributed optimization

This page was built for publication: Input-Feedforward-Passivity-Based Distributed Optimization Over Jointly Connected Balanced Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957703)