arXiv subjects

Ruichang Zhang

Publications and source records attributed to Ruichang Zhang.

5 recordsLinked to original sources

arXiv2024

Convergence Analysis of Weighted-Median Opinion Dynamics with Prejudice

The Friedkin-Johnsen (FJ) model introduces prejudice into the opinion evolution and has been successfully validated in many practical scenarios; however, due to its weighted average mechanism, only one prejudiced agent can always guide all unprejudiced agents synchronizing to its prejudice under the connected influence network, which may not be in line with some social realities. To fundamentally address the limitation of the weighted average mechanism, a weighted-median opinion dynamics has been recently proposed; however, its theoretical analysis is challenging due to its nonlinear nature. This paper studies the weighted-median opinion dynamics with prejudice, and obtains the convergence and convergence rate when all agents have prejudice, and a necessary and sufficient condition for asymptotic consensus when a portion of agents have prejudice. These results are the first time to analyze the discrete-time and synchronous opinion dynamics with the weighted median mechanism, and address the phenomenon of the FJ model that connectivity leads to consensus when a few agents with the same prejudice join in an unprejudiced group.

eess.SY↗

arXiv2024

Proactive Load-Shaping Strategies with Privacy-Cost Trade-offs in Residential Households based on Deep Reinforcement Learning

Smart meters play a crucial role in enhancing energy management and efficiency, but they raise significant privacy concerns by potentially revealing detailed user behaviors through energy consumption patterns. Recent scholarly efforts have focused on developing battery-aided load-shaping techniques to protect user privacy while balancing costs. This paper proposes a novel deep reinforcement learning-based load-shaping algorithm (PLS-DQN) designed to protect user privacy by proactively creating artificial load signatures that mislead potential attackers. We evaluate our proposed algorithm against a non-intrusive load monitoring (NILM) adversary. The results demonstrate that our approach not only effectively conceals real energy usage patterns but also outperforms state-of-the-art methods in enhancing user privacy while maintaining cost efficiency.

eess.SY↗

arXiv2024

Deep Reinforcement Learning for Voltage Control and Renewable Accommodation Using Spatial-Temporal Graph Information

Renewable energy resources (RERs) have been increasingly integrated into distribution networks (DNs) for decarbonization. However, the variable nature of RERs introduces uncertainties to DNs, frequently resulting in voltage fluctuations that threaten system security and hamper the further adoption of RERs. To incentivize more RER penetration, we propose a deep reinforcement learning (DRL)-based strategy to dynamically balance the trade-off between voltage fluctuation control and renewable accommodation. To further extract multi-time-scale spatial-temporal (ST) graphical information of a DN, our strategy draws on a multi-grained attention-based spatial-temporal graph convolution network (MG-ASTGCN), consisting of ST attention mechanism and ST convolution to explore the node correlations in the spatial and temporal views. The continuous decision-making process of balancing such a trade-off can be modeled as a Markov decision process optimized by the deep deterministic policy gradient (DDPG) algorithm with the help of the derived ST information. We validate our strategy on the modified IEEE 33, 69, and 118-bus radial distribution systems, with outcomes significantly outperforming the optimization-based benchmarks. Simulations also reveal that our developed MG-ASTGCN can to a great extent accelerate the convergence speed of DDPG and improve its performance in stabilizing node voltage in an RER-rich DN. Moreover, our method improves the DN's robustness in the presence of generator failures.

eess.SY↗

arXiv2023

Controllability of networked multiagent systems based on linearized Turing's model

Turing's model has been widely used to explain how simple, uniform structures can give rise to complex, patterned structures during the development of organisms. However, it is very hard to establish rigorous theoretical results for the dynamic evolution behavior of Turing's model since it is described by nonlinear partial differential equations. We focus on controllability of Turing's model by linearization and spatial discretization. This linearized model is a networked system whose agents are second order linear systems and these agents interact with each other by Laplacian dynamics on a graph. A control signal can be added to agents of choice. Under mild conditions on the parameters of the linearized Turing's model, we prove the equivalence between controllability of the linearized Turing's model and controllability of a Laplace dynamic system with agents of first order dynamics. When the graph is a grid graph or a cylinder grid graph, we then give precisely the minimal number of control nodes and a corresponding control node set such that the Laplace dynamic systems on these graphs with agents of first order dynamics are controllable.

eess.SY↗

arXiv2022

Deep Reinforcement Learning for Optimal Power Flow with Renewables Using Graph Information

Renewable energy resources (RERs) have been increasingly integrated into large-scale distributed power systems. Considering uncertainties and voltage fluctuation issues introduced by RERs, in this paper, we propose a deep reinforcement learning (DRL)-based strategy leveraging spatial-temporal (ST) graphical information of power systems, to dynamically search for the optimal operation, i.e., optimal power flow (OPF), of power systems with a high uptake of RERs. Specifically, we formulate the OPF problem as a multi-objective optimization problem considering generation cost, voltage fluctuation, and transmission loss, and employ deep deterministic policy gradient (DDPG) to learn an optimal allocation strategy for OPF. Moreover, given that the nodes in power systems are self-correlated and interrelated in temporal and spatial views, we develop a multi-grained attention-based spatial-temporal graph convolution network (MG-ASTGCN) for extracting ST graphical correlations and features, aiming to provide prior knowledge of power systems for its sequential DDPG algorithm to more effectively solve OPF. We validate our algorithm on modified IEEE 33, 69, and 118-bus radial distribution systems and demonstrate that our algorithm outperforms other benchmark algorithms. Our experimental results also reveal that our MG-ASTGCN can significantly accelerate DDPG's training process and performance in solving OPF.

cs.LG↗