摘要
This paper addresses distributed adaptive optimal resource allocation problems over weight-balanced digraphs.By leveraging state-of-the-art adaptive coupling designs for multiagent systems,two adaptive algorithms are proposed,namely a directed-spanning-tree-based algorithm and a node-based algorithm.The benefits of these algorithms are that they require neither sufficiently small or unitary step sizes,nor global knowledge of Laplacian eigenvalues,which are widely required in the literature.It is shown that both algorithms belong to a class of uncertain saddle-point dynamics,which can be tackled by repeatedly adopting the Peter-Paul inequality in the framework of Lyapunov theory.Thanks to this new viewpoint,global asymptotic convergence of both algorithms can be proven in a unified way.The effectiveness of the proposed algorithms is validated through numerical simulations and case studies in IEEE 30-bus and 118-bus power systems.
基金
supported in part by the China Postdoctoral Science Foundation(BX2021064)
the Fundamental Research Funds for the Central Universities(2242022R20030)
the National Key R&D Program of China(2022YFE0198700)
the Natural Science Foundation of China(62150610499,62073074,61833005)。
