Duqiao Zhao

Duqiao Zhao

Auto-generated profile, based on publicly available information

Duqiao Zhao

Department of Control Science and Control Engineering, Xian University of Technology, Xian, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
22 February 2023 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
DZDuqiao Zhao
Duqiao Zhao
DLDing Liu
Ding Liu
LLLinxiong Liu
Linxiong Liu
The economic dispatch problem (EDP) is the solid rock to guarantee the stable operation of power systems, which is essentially an optimization problem, i.e., dispatching generators to meet the total demands with the minimum generation cost under the constraint of generation capacity. With the increasing complexity of power systems, higher requirements for the security and robustness of EDP algorithm have been put forward. On the one hand, the explicit information communication between the generators may bring serious security risks; on the other hand, in practical applications, there may be communication delays and communication link failures due to network instability. However, many existing EDP algorithms can hardly meet the requirements of both security and robustness. Thus, this article develops a fully distributed privacy preserving algorithm for EDP with line losses over time-varying and directed communication and extends it to non-ideal communication environments. In particular, the proposed algorithm only relies on the row-stochastic weight matrix, where each generator can allocate the information weight of its neighbor nodes locally, making the approach easier to implement. Moreover, the conditional noise is added to the auxiliary variable to achieve the generator's privacy preservation. The rigorous mathematical analysis reveals that the proposed approach can effectively find the optimal dispatch while achieving privacy preservation of generators under the assumption that the communication delays are arbitrarily significant but bounded. Finally, several cases are presented to testify the convergence and robustness of the proposed approach.

2 September 2022 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
DZDuqiao Zhao
Duqiao Zhao
DLDing Liu
Ding Liu
LLLinxiong Liu
Linxiong Liu
Distributed model predictive control (DMPC) has recently attracted extensive research attention due to its high flexibility and outstanding performance. However, most of those studies focus only on optimizing some subsystems with sets of local constraints, or on designing some schemes over time-invariant communication networks, by ignoring the cooperation of multiple subsystems with global constraints and also the privacy preservation of the subsystems in complex communication networks. Current research on DMPC is incapable to address all these challenges. Therefore, a novel distributed and privacy preserving MPC algorithm with global constraints over time-varying communication networks is proposed in this article. Firstly, we transform the MPC optimization problem that includes all the subsystems into its dual problem. Then, a fully distributed dual gradient algorithm with row-stochastic matrix is developed for solving that problem. For further reduction of the computational cost, an event-triggered communication protocol is designed, which is realized through a distributed trigger criterion. Under reasonable assumptions, we prove that the algorithm can converge to the optimal solution while assuring the recursive feasibility and exponential stability of a closed-loop system. In addition, considering that the sensitive information may be leaked or eavesdropped during the subsystem interaction, a distributed encryption algorithm with privacy preservation is presented in an updated version. We demonstrate that the proposed algorithm is secure and can effectively protect the privacy of the subsystems. Finally, the effectiveness and performance of the proposed approaches are substantiated through numerical simulations.

3 January 2023 in IEEE Sensors Journal
Verified
Journal Article
Closed access
DZDuqiao Zhao
Duqiao Zhao
DLDing Liu
Ding Liu
XCXudong Cao
Xudong Cao
With the rapid development of WSNs, higher requirements are raised for the flexibility and applicability of data collection algorithms. Therefore, a novel distributed algorithm for data collection in adaptive duty cycle WSNs is proposed in this paper. On the one hand, the priority in data transmission is considered, in which the queues are used to realize the data storage and data transmission with different priorities and then a scheme for selecting the optimal transmission path for the sensor nodes is developed to ensure that high-priority data can be transmitted more efficiently. Next, a method that can adaptively adjust the duty cycle of the sensor nodes is designed to reduce the transmission delay, where each sensor can update its own duty cycle according to the amount of data with different priorities. On the other hand, the relation between the objective function and the variables in the data collection problem may be difficult to establish accurately or even unknown due to the complexity of WSNs, while the most existing data collection algorithms require the objective function to be explicitly expressed, making them inapplicable to the above scenarios. Hence, the data collection problem with unknown objective function in adaptive duty cycle WSNs is also investigated in this article. Since the objective function cannot be established, a distributed optimization algorithm with randomized gradient-free is developed to solve that problem. In particular, the proposed algorithm solely relies on the row-stochastic weight matrix, where each sensor needs to communicate only with its neighbors to make decision and locally allocates the information weight of its neighbors, making the algorithm easier to implement. Under some reasonable assumptions, the explicit analysis for the convergence of the proposed algorithm is provided. Finally, the convergence and effectiveness of the proposed algorithm are substantiated through numerical simulations.