Zhenhua Deng

Zhenhua Deng

Auto-generated profile, based on publicly available information

Zhenhua Deng

School of Automation, Central South University, Changsha, China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 October 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZDZhenhua Deng
Zhenhua Deng
SLShu Liang
Shu Liang
YHYiguang Hong
Yiguang Hong
In this paper, a distributed resource allocation problem with nonsmooth local cost functions is considered, where the interaction among agents is depicted by strongly connected and weight-balanced digraphs. Here the decision variable of each agent is within a local feasibility constraint described as a convex set, and all the decision variables have to satisfy a network resource constraint, which is the sum of available resources. To solve the problem, a distributed continuous-time algorithm is developed by virtue of differentiated projection operations and differential inclusions, and its convergence to the optimal solution is proved via the set-valued LaSalle invariance principle. Furthermore, the exponential convergence of the proposed algorithm can be achieved when the local cost functions are differentiable with Lipschitz gradients and there are no local feasibility constraints. Finally, numerical examples are given to verify the effectiveness of the proposed algorithms.

20 March 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
YTYutao Tang
Yutao Tang
ZDZhenhua Deng
Zhenhua Deng
YHYiguang Hong
Yiguang Hong
In this paper, we study an optimal output consensus problem for a multiagent network with agents in the form of multi-input multioutput minimum-phase dynamics. Optimal output consensus can be taken as an extended version of the existing output consensus problem for higher-order agents with an optimization requirement, where the output variables of agents are driven to achieve a consensus on the optimal solution of a global cost function. To solve this problem, we first construct an optimal signal generator, and then propose an embedded control scheme by embedding the generator in the feedback loop. We give two kinds of algorithms based on different available information along with both state feedback and output feedback, and prove that these algorithms with the embedded technique can guarantee the solvability of the problem for high-order multiagent systems under standard assumptions.

24 July 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZDZhenhua Deng
Zhenhua Deng
XNXiaohong Nian
Xiaohong Nian
In this paper, two aggregative games over weight-balanced digraphs are studied, where the cost functions of all players depend on not only their own decisions but also the aggregate of all decisions. In the first problem, the cost functions of players are differentiable with Lipschitz gradients, and the decisions of all players are coupled by linear coupling constraints. In the second problem, the cost functions are nonsmooth, and the decisions of all players are constrained by local feasibility constraints as well as linear coupling constraints. In order to seek the variational generalized Nash equilibrium (GNE) of the differentiable aggregative games, a continuous-time distributed algorithm is developed via gradient descent and dynamic average consensus, and its exponential convergence to the variational GNE is proven with the help of Lyapunov stability theory. Then, another continuous-time distributed projection-based algorithm is proposed for the nonsmooth aggregative games based on differential inclusions and differentiated projection operations. Moreover, the convergence of the algorithm to the variational GNE is analyzed by utilizing singular perturbation analysis. Finally, simulation examples are presented to illustrate the effectiveness of our methods.

2 February 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZDZhenhua Deng
Zhenhua Deng
The aggregative games are addressed in this article, in which there are coupling constraints among decisions and the players have Euler–Lagrange (EL) dynamics. On the strength of gradient descent, state feedback, and dynamic average consensus, two distributed algorithms are developed to seek the variational generalized Nash equilibrium (GNE) of the game. This article analyzes the convergence of two algorithms by utilizing singular perturbation analysis and variational analysis. The two algorithms exponentially and asymptotically converge to the variational GNE of the game, respectively. Moreover, the results are applied to the electricity market games of smart grids. By the algorithms, turbine-generator systems can seek the variational GNE of electricity markets autonomously. Finally, simulation examples verify the methods.

28 June 2021 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
SLShiling Li
Shiling Li
XNXiaohong Nian
Xiaohong Nian
ZDZhenhua Deng
Zhenhua Deng
In this article, we study the event-triggered distributed optimization problem of second-order nonlinear multiagent systems under undirected and connected communication topologies. To reduce the cost of information exchange in an optimization problem, a distributed event-triggered communication-based algorithm is proposed. In an event-triggered mechanism, the information interaction process of the network is controlled by a set of trigger conditions. The trigger condition of each agent only requires its own state information and its neighboring agents’ state information. Each agent updates its own states only at the triggering time. In order to achieve the optimal result of the optimization problem and reduce the cost of communicatio, we propose a distributed event-triggered algorithm based on gradient descent. Moreover, we analyze the convergence of the algorithm by constructing a suitable Lyapunov function. Furthermore, we prove that the Zeno behavior can be avoid. Finally, we provide examples to validate the effectiveness of the obtained result.

19 June 2018 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
ZDZhenhua Deng
Zhenhua Deng
SLShu Liang
Shu Liang
WYWeiyong Yu
Weiyong Yu