30 May 2018 in IEEE Transactions on Circuits and Systems II: Express Briefs
Lagrange multiplier method is widely used for solving constrained optimization problems. In this paper, the classic Lagrangians are generalized to a wider class of functions that satisfies the strong duality between primal and dual problems. Then the generalized Karush-Kuhn-Tucker (KKT) conditions for this generalized Lagrange multiplier method are derived. This useful method has applications in optimization problems and designs of consensus protocols, which is demonstrated by proposing a new continuous-time algorithm and its distributed version for optimization. The convergence advantages of the distributed algorithm are shown in a simulation example.
5 October 2020 in IEEE Transactions on Automatic Control
In this article, 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 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.
17 January 2019 in IEEE Control Systems Letters
This work is concerned with the problem of output consensus for two classes of heterogeneous nonlinear multi-agent systems which are interconnected via diffusive couplings over directed graphs. Specifically, for agents that are input feedforward passive (IFP), a condition in terms of passivity indices is proposed for asymptotic output consensus. Moreover, it is shown that the proposed condition can be exploited to design the coupling gain that ensures asymptotic consensus via a semidefinite program (SDP), and the existence of such a coupling gain can be guaranteed provided all the agents are IFP. For agents that are input feedforward output feedback passive (IF-OFP), a condition in terms of passivity indices for practical output consensus is provided, in which the relationship between the coupling gain and the consensus error bound is revealed.
21 April 2020 in IEEE Control Systems Letters
This work investigates the distributed constrained optimization problem under inter-agent communication delays from the perspective of passivity. First, we propose a continuous-time algorithm for distributed constrained optimization with general convex objective functions. The asymptotic stability under general convexity is guaranteed by the phase lead compensation. The inequality constraints are handled by adopting a projection-free generalized Lagrangian, whose primal-dual gradient dynamics preserves passivity and smoothness, enabling the application of the LaSalle’s invariance principle in the presence of delays. Then, we incorporate the scattering transformation into the proposed algorithm to enhance the robustness against unknown and heterogeneous communication delays. Finally, a numerical example of a matching problem is provided to illustrate the results.
16 September 2021 in IEEE Transactions on Control of Network Systems
This work is concerned with the problem of distributed resource allocation in continuous-time setting but with discrete-time communication over infinitely jointly connected and balanced digraphs. We provide a passivity-based perspective for the continuous-time algorithm, based on which an intermittent communication scheme is developed. Particularly, a periodic communication scheme is first derived through analyzing the passivity degradation over output sampling of the distributed dynamics at each node. Then, an asynchronous distributed event-triggered scheme is further developed. The sampled-based event-triggered communication scheme is exempt from Zeno behavior as the minimum interevent time is lower bounded by the sampling period. The parameters in the proposed algorithm rely only on local information of each individual node, which can be designed in a truly distributed fashion.
16 November 2023 in IEEE Transactions on Automatic Control
Distributed secondary frequency control for power systems, is a problem that has been extensively studied in the literature, and one of its key features is that an additional communication network is required to achieve optimal power allocation. Therefore, being able to provide stability guarantees in the presence of communication delays is an important requirement. Primal-dual and distributed averaging proportional integral (DAPI) protocols, respectively, are two main control schemes that have been proposed in the literature. Each has its own relative merits, with the former allowing to incorporate general cost functions and additional operational constraints, and the latter being more straightforward in its implementation. Although delays have been addressed in DAPI schemes, there are currently no theoretical guarantees for the stability of primaldual schemes for frequency control, when these are subject to communication delays. In fact, simulations illustrate that even small delays can destabilize such schemes. In this paper, we show how a novel formulation of primal-dual schemes allows to construct a distributed algorithm with delay independent stability guarantees. We also show that this algorithm can incorporate many key features of these schemes such as tie-line power flow requirements, generation constraints, and the relaxation of demand measurements with an observer layer. Finally, we illustrate our results through simulations on a 5-bus example and on the IEEE-39 test system.