arXiv subjects

Hongbin Sun

Publications and source records attributed to Hongbin Sun.

At least 73 records · Page 4Linked to original sources

arXiv2022

Flux Linkage Based Evaluation Method for Voltage Inertia and Voltage Recovery Capability Under Large Disturbances

High-voltage direct current (HVDC) transmission applications and the growth of the dynamic load in large-scale receiving-end grids lead to a higher risk of short-term voltage instability. An effective way to address this problem is to improve the system's dynamic voltage support capability by changing the operation status of dynamic var devices, and the dynamic var reserve (DVR) is commonly used. Due to the time delay in synchronous machine excitation systems, the dynamic var reserved at steady state cannot be exploited immediately under large disturbances. In addition, some reactive power is produced immediately through electromagnetic induction. The voltage support effect of the two capabilities is analyzed based on the flux linkage and an approximate simulation of the fault impact. Then two novel indexes for evaluating the voltage inertia and voltage recovery capability are proposed, which are related to the voltage nadir and voltage recovery speed. The indexes' physical meanings are revealed by comparison with the frequency response, and the potential applications in planning and optimal reactive power dispatch (ORPD) are introduced. Numerical simulations based on the IEEE 39-bus system verify that the indexes can quantify the voltage support capabilities, and the minimum voltage support requirements are obtained to maintain systems' security.

eess.SY↗

arXiv2022

An Efficient Optimal Energy Flow Model for Integrated Energy Systems Based on Energy Circuit Modeling in the Frequency Domain

With more energy networks being interconnected to form integrated energy systems (IESs), the optimal energy flow (OEF) problem has drawn increasing attention. Extant studies on OEF models mostly utilize the finite difference method (FDM) to address partial-differential-equation (PDE) constraints related to the dynamics in natural gas networks (NGNs) and district heating networks (DHNs). However, this time-domain approach suffers from a heavy computational burden with regard to achieving high finite-difference accuracy. In this paper, a novel OEF model that formulates NGN and DHN constraints in the frequency domain and corresponding model compaction techniques for efficient solving are contributed. First, an energy circuit method (ECM) that algebraizes the PDEs of NGNs and DHNs in the frequency domain is introduced. Then, an ECM-based OEF model is formulated, which contains fewer variables and constraints than an FDM-based OEF model and thereby yields better solving efficiency. Finally, variable space projection is employed to remove implicit variables, by which another constraint generation algorithm is enabled to remove redundant constraints. These two techniques further compact the OEF model and bring about a second improvement in solving efficiency. Numerical tests on actual systems indicate the final OEF model reduces variables and constraints by more than 95% and improves the solving efficiency by more than 10 times. In conclusion, the proposed OEF model and solving techniques well meet the optimization needs of large-scale IESs.

eess.SY↗

arXiv2022

Energy-Grade Double Pricing Rule in the Heating Market

The problem of heat system pricing is considered. A direct extension of locational marginal prices (LMP) in electricity markets to heat systems may lead to revenue inadequate issues. The underlying reason for such a problem is that, unlike electric power, heat has different grades and cannot be considered as homogenized commodity. Accordingly, an energy-grade double pricing rule is proposed in this paper. Heat energy and grade prices are explained as the shadow prices related to the nodal heat balance constraints and temperature requirements constraints at the optimal solution. The resulting merchandise surplus at each dispatch interval can be decomposed into several explainable parts, namely, congestion rent, impact from the last period, and impact from the upcoming period. And the total merchandise surplus over all dispatch intervals can be decomposed into several non-negative interpretable parts, including congestion rent and impact from the initial state, thus guaranteeing the revenue adequacy for the heat system operator. Simulations verify the effectiveness of the proposed mechanism.

eess.SY↗

arXiv2022

Energy-grade double pricing mechanism for a combined heat and power system using the asynchronous dispatch method

The problem of heat and electricity pricing in combined heat and power systems regarding the time scales of electricity and heat, as well as thermal energy quality, is studied. Based on the asynchronous coordinated dispatch of the combined heat and power system, an energy-grade double pricing mechanism is proposed. Under the pricing mechanism, the resulting merchandise surplus of the heat system operator at each heat dispatch interval can be decomposed into interpretable parts and its revenue adequacy can be guaranteed for all heat dispatch intervals. And the electric power system operator's resulting merchandise surplus is composed of non-negative components at each electricity dispatch interval, also ensuring its revenue adequacy. In addition, the effects of different time scales and cogeneration are analyzed in different kinds of combined heat and power units' pricing.

eess.SY↗

arXiv2022

A Multiple Market Trading Mechanism for Electricity, Renewable Energy Certificate and Carbon Emission Right of Virtual Power Plants

A multiple market trading mechanism for the VPP to participate in electricity, renewable energy certificate (REC) and carbon emission right (CER) markets is proposed. With the introduction of the inventory mechanism of REC and CER, the profit of the VPP increases and better trading decisions with multiple markets are made under the requirements of renewable portfolio standard (RPS) and carbon emission (CE) quota requirements. According to the Karush-Kuhn-Tucker (KKT) conditions of the proposed model, properties of the multiple market trading mechanism are discussed. Results from case studies verify the effectiveness of the proposed model.

eess.SY↗

arXiv2022

MPC-Based Operation Strategy for Electric Vehicle Aggregators Considering Regulation Markets

The optimal operation problem of electric vehicle aggregator (EVA) is considered. An EVA can participate in energy and regulation markets with its current and upcoming EVs, thus reducing its total cost of purchasing energy to fulfill EVs' charging requirements. A model predictive control (MPC) based optimization is developed to consider the future arrival of EVs as well as energy and regulation prices. The index of conditional value-at-risk (CVaR) is used to model the risk-averseness of an EVA. Simulations on a 2000-EV test system validate the effectiveness of our work in achieving a lucrative revenue while satisfying the charging requests from EV owners.

eess.SY↗

arXiv2022

Reducing Learning Difficulties: One-Step Two-Critic Deep Reinforcement Learning for Inverter-based Volt-Var Control

A one-step two-critic deep reinforcement learning (OSTC-DRL) approach for inverter-based volt-var control (IB-VVC) in active distribution networks is proposed in this paper. Firstly, considering IB-VVC can be formulated as a single-period optimization problem, we formulate the IB-VVC as a one-step Markov decision process rather than the standard Markov decision process, which simplifies the DRL learning task. Then we design the one-step actor-critic DRL scheme which is a simplified version of recent DRL algorithms, and it avoids the issue of Q value overestimation successfully. Furthermore, considering two objectives of VVC: minimizing power loss and eliminating voltage violation, we utilize two critics to approximate the rewards of two objectives separately. It simplifies the approximation tasks of each critic, and avoids the interaction effect between two objectives in the learning process of critic. The OSTC-DRL approach integrates the one-step actor-critic DRL scheme and the two-critic technology. Based on the OSTC-DRL, we design two centralized DRL algorithms. Further, we extend the OSTC-DRL to multi-agent OSTC-DRL for decentralized IB-VVC and design two multi-agent DRL algorithms. Simulations demonstrate that the proposed OSTC-DRL has a faster convergence rate and a better control performance, and the multi-agent OSTC-DRL works well for decentralized IB-VVC problems.

cs.AI↗

arXiv2022

S2TNet: Spatio-Temporal Transformer Networks for Trajectory Prediction in Autonomous Driving

To safely and rationally participate in dense and heterogeneous traffic, autonomous vehicles require to sufficiently analyze the motion patterns of surrounding traffic-agents and accurately predict their future trajectories. This is challenging because the trajectories of traffic-agents are not only influenced by the traffic-agents themselves but also by spatial interaction with each other. Previous methods usually rely on the sequential step-by-step processing of Long Short-Term Memory networks (LSTMs) and merely extract the interactions between spatial neighbors for single type traffic-agents. We propose the Spatio-Temporal Transformer Networks (S2TNet), which models the spatio-temporal interactions by spatio-temporal Transformer and deals with the temporel sequences by temporal Transformer. We input additional category, shape and heading information into our networks to handle the heterogeneity of traffic-agents. The proposed methods outperforms state-of-the-art methods on ApolloScape Trajectory dataset by more than 7\% on both the weighted sum of Average and Final Displacement Error. Our code is available at https://github.com/chenghuang66/s2tnet.

cs.CV↗

arXiv2022

RF-LIO: Removal-First Tightly-coupled Lidar Inertial Odometry in High Dynamic Environments

Simultaneous Localization and Mapping (SLAM) is considered to be an essential capability for intelligent vehicles and mobile robots. However, most of the current lidar SLAM approaches are based on the assumption of a static environment. Hence the localization in a dynamic environment with multiple moving objects is actually unreliable. The paper proposes a dynamic SLAM framework RF-LIO, building on LIO-SAM, which adds adaptive multi-resolution range images and uses tightly-coupled lidar inertial odometry to first remove moving objects, and then match lidar scan to the submap. Thus, it can obtain accurate poses even in high dynamic environments. The proposed RF-LIO is evaluated on both self-collected datasets and open Urbanloco datasets. The experimental results in high dynamic environments demonstrate that, compared with LOAM and LIO-SAM, the absolute trajectory accuracy of the proposed RF-LIO can be improved by 90% and 70%, respectively. RF-LIO is one of the state-of-the-art SLAM systems in high dynamic environments.

cs.RO↗

arXiv2022

Distributed Multi-Area Optimal Power Flow via Rotated Coordinate Descent Critical Region Exploration

We consider the problem of distributed optimal power flow (OPF) for multi-area electric power systems. A novel distributed algorithm is proposed, referred to as the rotated coordinate descent critical region exploration (RCDCRE). It allows each entity to independently update its boundary information and optimally solve its local OPF in an asynchronous fashion. RCDCRE method stitches coordinate descent and parametric programming using coordinate system rotation to reduce coordination, keep privacy and ensure convergence. The solution process does not require warm starts and can iterate from infeasible initial points using penalty-based formulations. The effectiveness of RCDCRE is verified based on IEEE 2-area 44-bus and 4-area 472-bus systems.

math.OC↗

arXiv2022

Joint Covering Congestion Rents in Multi-area Power Systems Considering Loop Flow Effects

We consider the problem of how multiple areas should jointly cover congestion rents of internal and tie-lines in an interconnected power system. A key issue of our concern is the loop flow problem, which represents discrepancies between scheduled and actual power flow distributions because electric power does not always flow along the most direct paths of transactions. We employ generalized coordinated transaction scheduling (GCTS) for interchange scheduling, which can eliminate dispatch errors caused by loop flow effects and asymptotically converge to the joint economic dispatch (JED) under ideal assumptions. Subsequently, distributed algorithms are proposed for each area to recover multipliers of the global GCTS model, as well as quantifying and pricing its contribution to line congestions. Thereby, all areas and interface bids can jointly cover congestion rents of internal and tie-lines with their merchandise surpluses and profits. Simulations demonstrate the effectiveness of the proposed approach of LMP recovery and joint covering congestion rents.

eess.SY↗

arXiv2022

A Stochastic Planning Method for Low-carbon Building-level Integrated Energy System Considering Electric-Heat-V2G Coupling

The concept of low-carbon building is proposed to ameliorate the climate change caused by environmental problems and realize carbon neutrality at the building level in urban areas. In addition, renewable energy curtailment in the power distribution system, as well as low efficiency due to independent operation of traditional energy systems, has been addressed by the application of integrated energy system (IES) to some extent. In this paper, we propose a planning method for low-carbon building-level IES, in which electric vehicles (EV) and the mode of Vehicle to Grid (V2G) are considered and further increase the flexibility of low-carbon buildings. The proposed planning model optimize the investment, operation costs and CO2 emission for building-level IES, so as to achieve the maximum benefit of the construction of the low-carbon building and help the realization of carbon neutrality. Moreover, we consider the uncertainty of distributed renewable energy, multi-energy load fluctuation and the random behavior of EV users, then formulating a two-stage stochastic programming model with chance constraints, in which heuristic moment matching scenario generation (HMMSG) and sample average approximation (SAA) method are applied. In case study, a real IES commercial building in Shanghai, where photovoltaic (PV), energy storage system (ESS), fuel cell (FC), EV, etc. are included as planning options, is used as numerical example to verify the effectiveness of the proposed planning method, with functions of ESS and EV in IES are analyzed in detail in different operation scenarios.

eess.SY↗

arXiv2022

On the Evaluation of Neural Code Summarization

Source code summaries are important for program comprehension and maintenance. However, there are plenty of programs with missing, outdated, or mismatched summaries. Recently, deep learning techniques have been exploited to automatically generate summaries for given code snippets. To achieve a profound understanding of how far we are from solving this problem and provide suggestions to future research, in this paper, we conduct a systematic and in-depth analysis of 5 state-of-the-art neural code summarization models on 6 widely used BLEU variants, 4 pre-processing operations and their combinations, and 3 widely used datasets. The evaluation results show that some important factors have a great influence on the model evaluation, especially on the performance of models and the ranking among the models. However, these factors might be easily overlooked. Specifically, (1) the BLEU metric widely used in existing work of evaluating code summarization models has many variants. Ignoring the differences among these variants could greatly affect the validity of the claimed results. Furthermore, we conduct human evaluations and find that the metric BLEU-DC is most correlated to human perception; (2) code pre-processing choices can have a large (from -18\% to +25\%) impact on the summarization performance and should not be neglected. We also explore the aggregation of pre-processing combinations and boost the performance of models; (3) some important characteristics of datasets (corpus sizes, data splitting methods, and duplication ratios) have a significant impact on model evaluation. Based on the experimental results, we give actionable suggestions for evaluating code summarization and choosing the best method in different scenarios. We also build a shared code summarization toolbox to facilitate future research.

cs.SE↗

arXiv2022

A Fair and Efficient Hybrid Federated Learning Framework based on XGBoost for Distributed Power Prediction

In a modern power system, real-time data on power generation/consumption and its relevant features are stored in various distributed parties, including household meters, transformer stations and external organizations. To fully exploit the underlying patterns of these distributed data for accurate power prediction, federated learning is needed as a collaborative but privacy-preserving training scheme. However, current federated learning frameworks are polarized towards addressing either the horizontal or vertical separation of data, and tend to overlook the case where both are present. Furthermore, in mainstream horizontal federated learning frameworks, only artificial neural networks are employed to learn the data patterns, which are considered less accurate and interpretable compared to tree-based models on tabular datasets. To this end, we propose a hybrid federated learning framework based on XGBoost, for distributed power prediction from real-time external features. In addition to introducing boosted trees to improve accuracy and interpretability, we combine horizontal and vertical federated learning, to address the scenario where features are scattered in local heterogeneous parties and samples are scattered in various local districts. Moreover, we design a dynamic task allocation scheme such that each party gets a fair share of information, and the computing power of each party can be fully leveraged to boost training efficiency. A follow-up case study is presented to justify the necessity of adopting the proposed framework. The advantages of the proposed framework in fairness, efficiency and accuracy performance are also confirmed.

cs.LG↗

arXiv2021

Accuracy and Application Scope Analysis for Linearized Branch Flow Model in Radial Distribution Systems

An in-depth analysis of linearized branch flow (LBF) model considering current injection and absolute value of impedance is proposed in this paper. The form of LBF model is based on two equations: the current injection to meet KCL and the voltage drop to meet KVL. By representing the absolute value of complex load power with the current injection, LBF model is much simpler than alternating current power flow (ACPF) model. The results on theoretical analysis and numerical studies show that LBF exhibits the high accuracy in bus voltage magnitude but a poor performance in branch flow. Moreover, LBF is also compared with fast decoupled linearized power flow (FDLPF) model to verify its efficiency, thus proving its superiority for fast evaluation of large-scale distribution systems with high accuracy in voltage magnitude. Finally, this paper analyzes three factors to lower LBF's errors of branch flow, as well as LBF's possible application scope.

eess.SY↗

arXiv2021

CAST: Enhancing Code Summarization with Hierarchical Splitting and Reconstruction of Abstract Syntax Trees

Code summarization aims to generate concise natural language descriptions of source code, which can help improve program comprehension and maintenance. Recent studies show that syntactic and structural information extracted from abstract syntax trees (ASTs) is conducive to summary generation. However, existing approaches fail to fully capture the rich information in ASTs because of the large size/depth of ASTs. In this paper, we propose a novel model CAST that hierarchically splits and reconstructs ASTs. First, we hierarchically split a large AST into a set of subtrees and utilize a recursive neural network to encode the subtrees. Then, we aggregate the embeddings of subtrees by reconstructing the split ASTs to get the representation of the complete AST. Finally, AST representation, together with source code embedding obtained by a vanilla code token encoder, is used for code summarization. Extensive experiments, including the ablation study and the human evaluation, on benchmarks have demonstrated the power of CAST. To facilitate reproducibility, our code and data are available at https://anonymous.4open.science/r/CAST/.

cs.SE↗

arXiv2021

MPC-Based Real-Time Charging Coordination for Electric Vehicle Aggregator to Provide Regulation Service in a Market Environment

The optimal operation problem of electric vehicle aggregator (EVA) is considered. An EVA can participate in energy and regulation markets with its current and upcoming EVs, thus reducing its total cost of purchasing energy to fulfill EVs' charging requirements. An MPC based optimization model is developed to consider future arrival of EVs as well as energy and regulation prices. The index of CVaR is used to model risk-averseness of an EVA. Simulations on the 1000-EV test system validate the effectiveness of our work in achieving a lucrative revenue while satisfying the charging requests from EV owners.

eess.SY↗

arXiv2021

threaTrace: Detecting and Tracing Host-based Threats in Node Level Through Provenance Graph Learning

Host-based threats such as Program Attack, Malware Implantation, and Advanced Persistent Threats (APT), are commonly adopted by modern attackers. Recent studies propose leveraging the rich contextual information in data provenance to detect threats in a host. Data provenance is a directed acyclic graph constructed from system audit data. Nodes in a provenance graph represent system entities (e.g., $processes$ and $files$) and edges represent system calls in the direction of information flow. However, previous studies, which extract features of the whole provenance graph, are not sensitive to the small number of threat-related entities and thus result in low performance when hunting stealthy threats. We present threaTrace, an anomaly-based detector that detects host-based threats at system entity level without prior knowledge of attack patterns. We tailor GraphSAGE, an inductive graph neural network, to learn every benign entity's role in a provenance graph. threaTrace is a real-time system, which is scalable of monitoring a long-term running host and capable of detecting host-based intrusion in their early phase. We evaluate threaTrace on three public datasets. The results show that threaTrace outperforms three state-of-the-art host intrusion detection systems.

cs.CR↗