Hwei-Ming Chung

MA
7papers
220citations
Novelty43%
AI Score24

7 Papers

ITSep 27, 2017
State Estimation in Smart Distribution System With Low-Precision Measurements

Jung-Chieh Chen, Hwei-Ming Chung, Chao-Kai Wen et al.

Efficient and accurate state estimation is essential for the optimal management of the future smart grid. However, to meet the requirements of deploying the future grid at a large scale, the state estimation algorithm must be able to accomplish two major tasks: (1) combining measurement data with different qualities to attain an optimal state estimate and (2) dealing with the large number of measurement data rendered by meter devices. To address these two tasks, we first propose a practical solution using a very short word length to represent a partial measurement of the system state in the meter device to reduce the amount of data. We then develop a unified probabilistic framework based on a Bayesian belief inference to incorporate measurements of different qualities to obtain an optimal state estimate. Simulation results demonstrate that the proposed scheme significantly outperforms other linear estimators in different test scenarios. These findings indicate that the proposed scheme not only has the ability to integrate data with different qualities but can also decrease the amount of data that needs to be transmitted and processed.

SYJun 6, 2016
An EV Charging Scheduling Mechanism to Maximize User Convenience and Cost Efficiency

Hwei-Ming Chung, Bahram Alinia, Noel Crespi et al.

This paper studies charging scheduling problem of electric vehicles (EVs) in the scale of a microgrid (e.g., a university or town) where a set of charging stations are controlled by a central aggregator. A bi-objective optimization problem is formulated to jointly optimize total charging cost and user convenience. Then, a close-to-optimal online scheduling algorithm is proposed as solution. The algorithm achieves optimal charging cost and is near optimal in terms of user convenience. Moreover, the proposed method applies an efficient load forecasting technique to obtain future load information. The algorithm is assessed through simulation and compared to the previous studies. The results reveal that our method not only improves previous alternative methods in terms of Pareto-optimal solution of the bi-objective optimization problem, but also provides a close approximation for the load forecasting.

MADec 3, 2022
DACOM: Learning Delay-Aware Communication for Multi-Agent Reinforcement Learning

Tingting Yuan, Hwei-Ming Chung, Jie Yuan et al.

Communication is supposed to improve multi-agent collaboration and overall performance in cooperative Multi-agent reinforcement learning (MARL). However, such improvements are prevalently limited in practice since most existing communication schemes ignore communication overheads (e.g., communication delays). In this paper, we demonstrate that ignoring communication delays has detrimental effects on collaborations, especially in delay-sensitive tasks such as autonomous driving. To mitigate this impact, we design a delay-aware multi-agent communication model (DACOM) to adapt communication to delays. Specifically, DACOM introduces a component, TimeNet, that is responsible for adjusting the waiting time of an agent to receive messages from other agents such that the uncertainty associated with delay can be addressed. Our experiments reveal that DACOM has a non-negligible performance improvement over other mechanisms by making a better trade-off between the benefits of communication and the costs of waiting for messages.

MAApr 26, 2022
PP-MARL: Efficient Privacy-Preserving Multi-Agent Reinforcement Learning for Cooperative Intelligence in Communications

Tingting Yuan, Hwei-Ming Chung, Xiaoming Fu

Cooperative intelligence (CI) is expected to become an integral element in next-generation networks because it can aggregate the capabilities and intelligence of multiple devices. Multi-agent reinforcement learning (MARL) is a popular approach for achieving CI in communication problems by enabling effective collaboration among agents to address sequential problems. However, ensuring privacy protection for MARL is a challenging task because of the presence of heterogeneous agents that learn interdependently via sharing information. Implementing privacy protection techniques such as data encryption and federated learning to MARL introduces the notable overheads (e.g., computation and bandwidth). To overcome these challenges, we propose PP-MARL, an efficient privacy-preserving learning scheme for MARL. PP-MARL leverages homomorphic encryption (HE) and differential privacy (DP) to protect privacy, while introducing split learning to decrease overheads via reducing the volume of shared messages, and then improve efficiency. We apply and evaluate PP-MARL in two communication-related use cases. Simulation results reveal that PP-MARL can achieve efficient and reliable collaboration with 1.1-6 times better privacy protection and lower overheads (e.g., 84-91% reduction in bandwidth) than state-of-the-art approaches.

OCJun 29, 2020
Distributed Deep Reinforcement Learning for Intelligent Load Scheduling in Residential Smart Grids

Hwei-Ming Chung, Sabita Maharjan, Yan Zhang et al.

The power consumption of households has been constantly growing over the years. To cope with this growth, intelligent management of the consumption profile of the households is necessary, such that the households can save the electricity bills, and the stress to the power grid during peak hours can be reduced. However, implementing such a method is challenging due to the existence of randomness in the electricity price and the consumption of the appliances. To address this challenge, we employ a model-free method for the households which works with limited information about the uncertain factors. More specifically, the interactions between households and the power grid can be modeled as a non-cooperative stochastic game, where the electricity price is viewed as a stochastic variable. To search for the Nash equilibrium (NE) of the game, we adopt a method based on distributed deep reinforcement learning. Also, the proposed method can preserve the privacy of the households. We then utilize real-world data from Pecan Street Inc., which contains the power consumption profile of more than 1; 000 households, to evaluate the performance of the proposed method. In average, the results reveal that we can achieve around 12% reduction on peak-to-average ratio (PAR) and 11% reduction on load variance. With this approach, the operation cost of the power grid and the electricity cost of the households can be reduced.

MMMar 29, 2019
A Study on the Characteristics of Douyin Short Videos and Implications for Edge Caching

Zhuang Chen, Qian He, Zhifei Mao et al.

Douyin, internationally known as TikTok, has become one of the most successful short-video platforms. To maintain its popularity, Douyin has to provide better Quality of Experience (QoE) to its growing user base. Understanding the characteristics of Douyin videos is thus critical to its service improvement and system design. In this paper, we present an initial study on the fundamental characteristics of Douyin videos based on a dataset of over 260 thousand short videos collected across three months. The characteristics of Douyin videos are found to be significantly different from traditional online videos, ranging from video bitrate, size, to popularity. In particular, the distributions of the bitrate and size of videos follow Weibull distribution. We further observe that the most popular Douyin videos follow Zifp's law on video popularity, but the rest of the videos do not. We also investigate the correlation between popularity metrics used for Douyin videos. It is found that the correlation between the number of views and the number of likes are strong, while other correlations are relatively low. Finally, by using a case study, we demonstrate that the above findings can provide important guidance on designing an efficient edge caching system.

SYAug 10, 2017
Local Cyber-physical Attack with Leveraging Detection in Smart Grid

Hwei-Ming Chung, Wen-Tai Li, Chau Yuen et al.

A well-designed attack in the power system can cause an initial failure and then results in large-scale cascade failure. Several works have discussed power system attack through false data injection, line-maintaining attack, and line-removing attack. However, the existing methods need to continuously attack the system for a long time, and, unfortunately, the performance cannot be guaranteed if the system states vary. To overcome this issue, we consider a new type of attack strategy called combinational attack which masks a line-outage at one position but misleads the control center on line outage at another position. Therefore, the topology information in the control center is interfered by our attack. We also offer a procedure of selecting the vulnerable lines of its kind. The proposed method can effectively and continuously deceive the control center in identifying the actual position of line-outage. The system under attack will be exposed to increasing risks as the attack continuously. Simulation results validate the efficiency of the proposed attack strategy.