Zhijun Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhijun Guo has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Gang Chen
College of Automation, Chongqing University, Chongqing, China
5 shared publications Xiang-Yu Kang
Vehicle and Transportation Engineering Institute,Henan University of Science and Technology, Luoyang 471003,China a
1 shared publication
Latest Publications
- 16 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (1) , 182-193
Exponential Convergence of Distributed Optimal Coordination for Nonlinear Multiagent Systems Under Directed Graphs
The distributed optimal coordination problem of second-order uncertain nonlinear multi-agent systems, which aims to satisfy a global constrained optimal objective, is formulated and investigated in this paper. To solve this problem, a couple of novel proportional-integral (PI) type control laws are explored. Specifically, a gradient-descent-based PI control law is developed for the weigh-balanced graph. Furthermore, by introducing the estimator of left eigenvector of the Laplacian matrix, the proposed method is extended to the case of unbalanced graph. Compared with the existing optimal coordination algorithms over nonlinear multi-agent systems, our algorithm exhibits the favorable exponential convergence property, albeit employing relaxed balanced/unbalanced directed communication topologies. Two numerical simulations are provided to demonstrate the theoretical results.
- 16 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (1) , 182-193
Exponential Convergence of Distributed Optimal Coordination for Nonlinear Multiagent Systems Under Directed Graphs
The distributed optimal coordination problem of second-order uncertain nonlinear multi-agent systems, which aims to satisfy a global constrained optimal objective, is formulated and investigated in this paper. To solve this problem, a couple of novel proportional-integral (PI) type control laws are explored. Specifically, a gradient-descent-based PI control law is developed for the weigh-balanced graph. Furthermore, by introducing the estimator of left eigenvector of the Laplacian matrix, the proposed method is extended to the case of unbalanced graph. Compared with the existing optimal coordination algorithms over nonlinear multi-agent systems, our algorithm exhibits the favorable exponential convergence property, albeit employing relaxed balanced/unbalanced directed communication topologies. Two numerical simulations are provided to demonstrate the theoretical results.
- 26 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (10) , 10592-10603
Fully Distributed Optimal Position Control of Networked Uncertain Euler–Lagrange Systems Under Unbalanced Digraphs
The distributed optimal position control problem, which aims to cooperatively drive the networked uncertain nonlinear Euler–Lagrange (EL) systems to an optimal position that minimizes a global cost function, is investigated in this article. In the case without constraints for the positions, a fully distributed optimal position control protocol is first presented by applying adaptive parameter estimation and gain tuning techniques. As the environmental constraints for the positions are considered, we further provide an enhanced optimal control scheme by applying the $\epsilon $ -exact penalty function method. Different from the existing optimal control schemes of networked EL systems, the proposed adaptive control schemes have two merits. First, they are fully distributed in the sense without requiring any global information. Second, the control schemes are designed under the general unbalanced directed communication graphs. The simulations are performed to verify the obtained results.
- 26 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (10) , 10592-10603
Fully Distributed Optimal Position Control of Networked Uncertain Euler–Lagrange Systems Under Unbalanced Digraphs
The distributed optimal position control problem, which aims to cooperatively drive the networked uncertain nonlinear Euler–Lagrange (EL) systems to an optimal position that minimizes a global cost function, is investigated in this article. In the case without constraints for the positions, a fully distributed optimal position control protocol is first presented by applying adaptive parameter estimation and gain tuning techniques. As the environmental constraints for the positions are considered, we further provide an enhanced optimal control scheme by applying the $\epsilon $ -exact penalty function method. Different from the existing optimal control schemes of networked EL systems, the proposed adaptive control schemes have two merits. First, they are fully distributed in the sense without requiring any global information. Second, the control schemes are designed under the general unbalanced directed communication graphs. The simulations are performed to verify the obtained results.
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 52 (2) , 845-854
Initialization-Free Distributed Fixed-Time Convergent Algorithms for Optimal Resource Allocation
This article considers the distributed fixed-time resource allocation problem subject to global equality and local inequality constraints. In the case that the optimal solutions are strictly feasible, a projection-gradient-based continuous-time algorithm is first proposed to minimize a team of cost functions in the fixed time. As some optimal solutions locate on the boundary of local constraints, we further provide an alternative suboptimal solution based on the $\epsilon $ -exact penalty function method. Different from the existing distributed optimal allocation results, the (sub)optimal solutions can be obtained in the fixed time and the optimization protocols can be implemented in an initialization-free manner. Thus, the convergence time can be offline preassigned and the initial states can be chosen arbitrarily such that a better robust performance is achieved for the new algorithms. Case studies of the widely discussed economic dispatch problems are performed to validate the effectiveness of the obtained results.
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 52 (2) , 845-854
Initialization-Free Distributed Fixed-Time Convergent Algorithms for Optimal Resource Allocation
This article considers the distributed fixed-time resource allocation problem subject to global equality and local inequality constraints. In the case that the optimal solutions are strictly feasible, a projection-gradient-based continuous-time algorithm is first proposed to minimize a team of cost functions in the fixed time. As some optimal solutions locate on the boundary of local constraints, we further provide an alternative suboptimal solution based on the $\epsilon $ -exact penalty function method. Different from the existing distributed optimal allocation results, the (sub)optimal solutions can be obtained in the fixed time and the optimization protocols can be implemented in an initialization-free manner. Thus, the convergence time can be offline preassigned and the initial states can be chosen arbitrarily such that a better robust performance is achieved for the new algorithms. Case studies of the widely discussed economic dispatch problems are performed to validate the effectiveness of the obtained results.
- 12 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 52 (1) , 438-447
Predefined-Time Distributed Optimal Allocation of Resources: A Time-Base Generator Scheme
In this article, we present a novel predefined-time distributed optimization protocol for the resource allocation problem (RAP). Different from the existing finite/fixed-time distributed optimal algorithms, the proposed protocol is built on the time-varying time-based-generator scheme. The settling time is independent of the initial values of the agents and any designed parameters, which implies that the settling time can be predesigned by the user. To address the inequality constraints, the $\epsilon $ -exact penalty function method is introduced to solve the RAP within a predefined-time. In addition, the designed optimization protocol can be implemented in an initialization-free manner, which makes the algorithms feasible under arbitrary initial states. Finally, several numerical simulation results are provided to demonstrate the effectiveness of the proposed algorithms.
- 12 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 52 (1) , 438-447
Predefined-Time Distributed Optimal Allocation of Resources: A Time-Base Generator Scheme
In this article, we present a novel predefined-time distributed optimization protocol for the resource allocation problem (RAP). Different from the existing finite/fixed-time distributed optimal algorithms, the proposed protocol is built on the time-varying time-based-generator scheme. The settling time is independent of the initial values of the agents and any designed parameters, which implies that the settling time can be predesigned by the user. To address the inequality constraints, the $\epsilon $ -exact penalty function method is introduced to solve the RAP within a predefined-time. In addition, the designed optimization protocol can be implemented in an initialization-free manner, which makes the algorithms feasible under arbitrary initial states. Finally, several numerical simulation results are provided to demonstrate the effectiveness of the proposed algorithms.
- 21 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 10 (2) , 2002-2014
Distributed Secondary and Optimal Active Power Sharing Control for Islanded Microgrids With Communication Delays
As the communication delays in smart grid are considered, the novel secondary voltage and frequency restoration, the optimal active power sharing, and the accurate reactive power sharing protocols are proposed in this paper. The Lyapunov- Krasovskii functions are used to analyze the stability of our proposed distributed secondary control schemes. Sensitivity analysis of time delays is also provided. Whether the communication delays exist or not, the control protocols always guarantee that the output voltage amplitude and frequency of each distributed generator synchronize to the reference values and maintain the optimal active power sharing and the accurate reactive power sharing properties. Moreover, our proposed control protocols are implemented through sparse communication networks and thus meet the plug-and-play feature of the future smart grid. Simulation results are provided to show the effectiveness of the proposed control protocols.
- 21 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 10 (2) , 2002-2014
Distributed Secondary and Optimal Active Power Sharing Control for Islanded Microgrids With Communication Delays
As the communication delays in smart grid are considered, the novel secondary voltage and frequency restoration, the optimal active power sharing, and the accurate reactive power sharing protocols are proposed in this paper. The Lyapunov- Krasovskii functions are used to analyze the stability of our proposed distributed secondary control schemes. Sensitivity analysis of time delays is also provided. Whether the communication delays exist or not, the control protocols always guarantee that the output voltage amplitude and frequency of each distributed generator synchronize to the reference values and maintain the optimal active power sharing and the accurate reactive power sharing properties. Moreover, our proposed control protocols are implemented through sparse communication networks and thus meet the plug-and-play feature of the future smart grid. Simulation results are provided to show the effectiveness of the proposed control protocols.
- Open Access
- 1 January 2016
- Published by Atlantis Press SARL
Modeling and Analysis of Vehicle with Wind-solar Photovoltaic Hybrid Generating System
- 1 January 2016
- Published by Atlantis Press SARL
Open AccessModeling and Analysis of Vehicle with Wind-solar Photovoltaic Hybrid Generating System