Searcharxiv⌕ Search

arXiv subjects

Jinfeng Liu

Publications and source records attributed to Jinfeng Liu.

At least 55 records · Page 3Linked to original sources

Distributed economic predictive control of integrated energy systems for enhanced synergy and grid response: A decomposition and cooperation strategy

The close integration of increasing operating units into an integrated energy system (IES) results in complex interconnections between these units. The strong dynamic interactions create barriers to designing a successful distributed coordinated controller to achieve synergy between all the units and unlock the potential for grid response. To address these challenges, we introduce a directed graph representation of IESs using an augmented Jacobian matrix to depict their underlying dynamics topology. By utilizing this representation, a generic subsystem decomposition method is proposed to partition the entire IES vertically based on the dynamic time scale and horizontally based on the closeness of interconnections between the operating units. Exploiting the decomposed subsystems, we develop a cooperative distributed economic model predictive control (DEMPC) with multiple global objectives that regulate the generated power at the grid's requests and satisfy the customers cooling and system economic requirements. In the DEMPC, multiple local decision-making agents cooperate sequentially and iteratively to leverage the potential across all the units for system-wide dynamic synergy. Furthermore, we discuss how subsystem decomposition impacts the design of distributed cooperation schemes for IESs and provide a control-oriented basic guideline on the optimal decomposition of complex energy systems. Extensive simulations demonstrate that the control strategies with different levels of decomposition and collaboration will lead to marked differences in the overall performance of IES. The standard control scheme based on the proposed subsystem configuration outperforms the empirical decomposition-based control benchmark by about 20%. The DEMPC architecture further improves the overall performance of the IES by about 55% compared to the benchmark.

eess.SY↗

Control invariant set enhanced reinforcement learning for process control: improved sampling efficiency and guaranteed stability

Reinforcement learning (RL) is an area of significant research interest, and safe RL in particular is attracting attention due to its ability to handle safety-driven constraints that are crucial for real-world applications of RL algorithms. This work proposes a novel approach to RL training, called control invariant set (CIS) enhanced RL, which leverages the benefits of CIS to improve stability guarantees and sampling efficiency. The approach consists of two learning stages: offline and online. In the offline stage, CIS is incorporated into the reward design, initial state sampling, and state reset procedures. In the online stage, RL is retrained whenever the state is outside of CIS, which serves as a stability criterion. A backup table that utilizes the explicit form of CIS is obtained to ensure the online stability. To evaluate the proposed approach, we apply it to a simulated chemical reactor. The results show a significant improvement in sampling efficiency during offline training and closed-loop stability in the online implementation.

eess.SY↗

State estimation of a carbon capture process through POD model reduction and neural network approximation

This paper presents an efficient approach for state estimation of post-combustion CO2 capture plants (PCCPs) by using reduced-order neural network models. The method involves extracting lower-dimensional feature vectors from high-dimensional operational data of the PCCP and constructing a reduced-order process model using proper orthogonal decomposition (POD). Multi-layer perceptron (MLP) neural networks capture the dominant dynamics of the process and train the network parameters with low-dimensional data obtained from open-loop simulations. The proposed POD-MLP model can be used as the basis for estimating the states of PCCPs at a significantly decreased computational cost. For state estimation, a reduced-order extended Kalman filtering (EKF) scheme based on the POD-MLP model is developed. Our simulations demonstrate that the proposed POD-MLP modeling approach reduces computational complexity compared to the POD-only model for nonlinear systems. Additionally, the POD-MLP-EKF algorithm can accurately reconstruct the full state information of PCCPs while significantly improving computational efficiency compared to the EKF based on the original PCCP model.

eess.SY↗

Sensor network design for post-combustion CO2 capture plants: economy, complexity and robustness

State estimation is crucial for the monitoring and control of post-combustion CO2 capture plants (PCCPs). The performance of state estimation is highly reliant on the configuration of sensors. In this work, we consider the problem of sensor selection for PCCPs and propose a computationally efficient method to determine an appropriate number of sensors and the corresponding placement of the sensors. The objective is to find the (near-)optimal set of sensors that provides the maximum degree of observability for state estimation while satisfying the budget constraint. Specifically, we resort to the information contained in the sensitivity matrix calculated around the operating region of a PCCP to quantify the degree of observability of the entire system corresponding to the placed sensors. The sensor selection problem is converted to an optimization problem, and is efficiently solved by a one-by-one removal approach through sensitivity analysis. Next, we extend our approach to study fault tolerance (resilience) of the selected sensors to sensor malfunction. The resilient sensor selection problem is to find a sensor network that gives good estimation performance even when some of the sensors fail, thereby improving the overall system robustness. The resilient sensor selection problem is formulated as a max-min optimization problem. We show how the proposed approach can be adapted to solve the sensor selection max-min optimization problem. By implementing the proposed approaches, the sensor network is configured for the PCCP efficiently.

eess.SY↗

SMPL: Simulated Industrial Manufacturing and Process Control Learning Environments

Traditional biological and pharmaceutical manufacturing plants are controlled by human workers or pre-defined thresholds. Modernized factories have advanced process control algorithms such as model predictive control (MPC). However, there is little exploration of applying deep reinforcement learning to control manufacturing plants. One of the reasons is the lack of high fidelity simulations and standard APIs for benchmarking. To bridge this gap, we develop an easy-to-use library that includes five high-fidelity simulation environments: BeerFMTEnv, ReactorEnv, AtropineEnv, PenSimEnv and mAbEnv, which cover a wide range of manufacturing processes. We build these environments on published dynamics models. Furthermore, we benchmark online and offline, model-based and model-free reinforcement learning algorithms for comparisons of follow-up research.

cs.LG↗

Progressive Motion Context Refine Network for Efficient Video Frame Interpolation

Recently, flow-based frame interpolation methods have achieved great success by first modeling optical flow between target and input frames, and then building synthesis network for target frame generation. However, above cascaded architecture can lead to large model size and inference delay, hindering them from mobile and real-time applications. To solve this problem, we propose a novel Progressive Motion Context Refine Network (PMCRNet) to predict motion fields and image context jointly for higher efficiency. Different from others that directly synthesize target frame from deep feature, we explore to simplify frame interpolation task by borrowing existing texture from adjacent input frames, which means that decoder in each pyramid level of our PMCRNet only needs to update easier intermediate optical flow, occlusion merge mask and image residual. Moreover, we introduce a new annealed multi-scale reconstruction loss to better guide the learning process of this efficient PMCRNet. Experiments on multiple benchmarks show that proposed approaches not only achieve favorable quantitative and qualitative results but also reduces current model size and running time significantly.

cs.CV↗

A sensitivity-based approach to optimal sensor selection for process networks

Sensor selection is critical for state estimation, control and monitoring of nonlinear processes. However, evaluating the performance of each possible combination of $m$ out of $n$ sensors is impractical unless $m$ and $n$ are small. In this paper, we propose a sensitivity-based approach to determine the minimum number of sensors and their optimal locations for state estimation. The local sensitivity matrix of the measured outputs to initial states is used as a measure of the observability. The minimum number of sensors is determined in a way such that the local sensitivity matrix is full column rank. The subset of sensors that satisfies the full-rank condition and provides the maximum degree of observability is considered as the optimal sensor placement. Successive orthogonalization of the sensitivity matrix is conducted in the proposed approach to significantly reduce the computational complexity in selecting the sensors. To validate the effectiveness of the proposed method, it is applied to two processes including a chemical process consisting of four continuous stirred-tank reactors and a wastewater treatment plant. In both cases, the proposed approach can obtain the optimal sensor subsets.

eess.SY↗

ATCA: an Arc Trajectory Based Model with Curvature Attention for Video Frame Interpolation

Video frame interpolation is a classic and challenging low-level computer vision task. Recently, deep learning based methods have achieved impressive results, and it has been proven that optical flow based methods can synthesize frames with higher quality. However, most flow-based methods assume a line trajectory with a constant velocity between two input frames. Only a little work enforces predictions with curvilinear trajectory, but this requires more than two frames as input to estimate the acceleration, which takes more time and memory to execute. To address this problem, we propose an arc trajectory based model (ATCA), which learns motion prior from only two consecutive frames and also is lightweight. Experiments show that our approach performs better than many SOTA methods with fewer parameters and faster inference speed.

cs.CV↗

The FASER Detector

FASER, the ForwArd Search ExpeRiment, is an experiment dedicated to searching for light, extremely weakly-interacting particles at CERN's Large Hadron Collider (LHC). Such particles may be produced in the very forward direction of the LHC's high-energy collisions and then decay to visible particles inside the FASER detector, which is placed 480 m downstream of the ATLAS interaction point, aligned with the beam collisions axis. FASER also includes a sub-detector, FASER$ν$, designed to detect neutrinos produced in the LHC collisions and to study their properties. In this paper, each component of the FASER detector is described in detail, as well as the installation of the experiment system and its commissioning using cosmic-rays collected in September 2021 and during the LHC pilot beam test carried out in October 2021. FASER will start taking LHC collision data in 2022, and will run throughout LHC Run 3.

physics.ins-det↗

The tracking detector of the FASER experiment

FASER is a new experiment designed to search for new light weakly-interacting long-lived particles (LLPs) and study high-energy neutrino interactions in the very forward region of the LHC collisions at CERN. The experimental apparatus is situated 480 m downstream of the ATLAS interaction-point aligned with the beam collision axis. The FASER detector includes four identical tracker stations constructed from silicon microstrip detectors. Three of the tracker stations form a tracking spectrometer, and enable FASER to detect the decay products of LLPs decaying inside the apparatus, whereas the fourth station is used for the neutrino analysis. The spectrometer has been installed in the LHC complex since March 2021, while the fourth station is not yet installed. FASER will start physics data taking when the LHC resumes operation in early 2022. This paper describes the design, construction and testing of the tracking spectrometer, including the associated components such as the mechanics, readout electronics, power supplies and cooling system.

physics.ins-det↗

PyramidCLIP: Hierarchical Feature Alignment for Vision-language Model Pretraining

Large-scale vision-language pre-training has achieved promising results on downstream tasks. Existing methods highly rely on the assumption that the image-text pairs crawled from the Internet are in perfect one-to-one correspondence. However, in real scenarios, this assumption can be difficult to hold: the text description, obtained by crawling the affiliated metadata of the image, often suffers from the semantic mismatch and the mutual compatibility. To address these issues, we introduce PyramidCLIP, which constructs an input pyramid with different semantic levels for each modality, and aligns visual elements and linguistic elements in the form of hierarchy via peer-level semantics alignment and cross-level relation alignment. Furthermore, we soften the loss of negative samples (unpaired samples) so as to weaken the strict constraint during the pre-training stage, thus mitigating the risk of forcing the model to distinguish compatible negative pairs. Experiments on five downstream tasks demonstrate the effectiveness of the proposed PyramidCLIP. In particular, with the same amount of 15 million pre-training image-text pairs, PyramidCLIP exceeds CLIP on ImageNet zero-shot classification top-1 accuracy by 10.6%/13.2%/10.0% with ResNet50/ViT-B32/ViT-B16 based image encoder respectively. When scaling to larger datasets, PyramidCLIP achieves the state-of-the-art results on several downstream tasks. In particular, the results of PyramidCLIP-ResNet50 trained on 143M image-text pairs surpass that of CLIP using 400M data on ImageNet zero-shot classification task, significantly improving the data efficiency of CLIP.

cs.CV↗

Economic model predictive control of integrated energy systems: A multi-time-scale framework

In this work, a composite economic model predictive control (CEMPC) is proposed for the optimal operation of a stand-alone integrated energy system (IES). Time-scale multiplicity exists in IESs dynamics is taken into account and addressed using multi-time-scale decomposition. The entire IES is decomposed into three reduced-order subsystems with slow, medium, and fast dynamics. Subsequently, the CEMPC, which includes slow economic model predictive control (EMPC), medium EMPC and fast EMPC, is developed. The EMPCs communicate with each other to ensure consistency in decision-making. In the slow EMPC, the global control objectives are optimized, and the manipulated inputs explicitly affecting the slow dynamics are applied. The medium EMPC optimizes the control objectives correlated with the medium dynamics and applies the corresponding optimal medium inputs to the IES, while the fast EMPC optimizes the fast dynamics relevant objectives and makes a decision on the manipulated inputs directly associated with the fast dynamics. Meanwhile, thermal comfort is integrated into the CEMPC in the form of zone tracking of the building temperature for achieving more control degrees of freedom to prioritize satisfying the electric demand and reducing operating costs of the IES. Moreover, a long-term EMPC based on a simplified slow subsystem model is developed and incorporated into the CEMPC to ensure that the operating state accommodates long-term forecasts for external conditions. Finally, the effectiveness and superiority of the proposed method are demonstrated via simulations and a comparison with a hierarchical real-time optimization mechanism.

eess.SY↗

Computing control invariant sets of nonlinear systems: decomposition and distributed computing

In this work, we present a distributed framework based on the graph algorithm for computing control invariant set for nonlinear cascade systems. The proposed algorithm exploits the structure of the interconnections within a process network. First, the overall system is decomposed into several subsystems with overlapping states. Second, the control invariant set for the subsystems are computed in a distributed manner. Finally, an approximation of the control invariant set for the overall system is reconstructed from the subsystem solutions and validated. We demonstrate the efficacy and convergence of the proposed method to the centralized graph-based algorithm using several numerical examples including a six dimensional continuous stirred tank reactor system.

eess.SY↗

Model predictive control of agro-hydrological systems based on a two-layer neural network modeling framework

Water scarcity is an urgent issue to be resolved and improving irrigation water-use efficiency through closed-loop control is essential. The complex agro-hydrological system dynamics, however, often pose challenges in closed-loop control applications. In this work, we propose a two-layer neural network (NN) framework to approximate the dynamics of the agro-hydrological system. To minimize the prediction error, a linear bias correction is added to the proposed model. The model is employed by a model predictive controller with zone tracking (ZMPC), which aims to keep the root zone soil moisture in the target zone while minimizing the total amount of irrigation. The performance of the proposed approximation model framework is shown to be better compared to a benchmark long-short-term-memory (LSTM) model for both open-loop and closed-loop applications. Significant computational cost reduction of the ZMPC is achieved with the proposed framework. To handle the tracking offset caused by the plant-model-mismatch of the proposed NN framework, a shrinking target zone is proposed for the ZMPC. Different hyper-parameters of the shrinking zone in the presence of noise and weather disturbances are investigated, of which the control performance is compared to a ZMPC with a time-invariant target zone.

eess.SY↗

Impact of sensor placement in soil water estimation: A real-case study

One of the essential elements in implementing a closed-loop irrigation system is soil moisture estimation based on a limited number of available sensors. One associated problem is the determination of the optimal locations to install the sensors such that good soil moisture estimation can be obtained. In our previous work, the modal degree of observability was employed to address the problem of optimal sensor placement for soil moisture estimation of agro-hydrological systems. It was demonstrated that the optimally placed sensors can improve the soil moisture estimation performance. However, it is unclear whether the optimal sensor placement can significantly improve the soil moisture estimation performance in actual applications. In this work, we investigate the impact of sensor placement in soil moisture estimation for an actual agricultural field in Lethbridge, Alberta, Canada. In an experiment on the studied field, 42 soil moisture sensors were installed at different depths to collect the soil moisture measurements for one growing season. A three-dimensional agro-hydrological model with heterogeneous soil parameters of the studied field is developed. The modal degree of observability is applied to the three-dimensional system to determine the optimal sensor locations. The extended Kalman filter (EKF) is chosen as the data assimilation tool to estimate the soil moisture content of the studied field. Soil moisture estimation results for different scenarios are obtained and analyzed to investigate the effects of sensor placement on the performance of soil moisture estimation in the actual applications.

stat.AP↗

An efficient implementation of graph-based invariant set algorithm for constrained nonlinear dynamical systems

The graph-based invariant set (GIS) algorithm is a promising set-based technique for computing the largest (with respect to inclusion) control invariant set of general discrete-time nonlinear dynamical systems. However, like other invariant set algorithms for nonlinear systems, the GIS algorithm may require a lot of resources when computing the control invariant set. This limits its applicability to higher dimensional systems. In this work, we present an improved and efficient implementation of the GIS algorithm for general discrete-time controlled nonlinear systems. We first identify the bottlenecks through extensive analysis, and then provide remedial procedures to improve the implementation of the GIS algorithm. Specifically, we developed an adaptive subdivision scheme using a supervised machine learning-based algorithm to reduce the cell growth rate and parallelize the graph construction step. We extensively demonstrate the performance of the improved GIS algorithm using a numerical example and compare the result to that of the standard GIS algorithm. The results show that the adaptive subdivision and the parallelization improved the speed of the algorithm by about 8x and 3x respectively, that of the standard GIS algorithm.

eess.SY↗

Distributed simultaneous state and parameter estimation of nonlinear systems

In this paper, we consider distributed simultaneous state and parameter estimation for a class of nonlinear systems, for which the augmented model comprising both the states and the parameters is only partially observable. Specifically, we first illustrate how the sensitivity analysis (SA) can select variables for simultaneous state and parameter estimation. Then, a community structure detection (CSD) based process decomposition method is proposed for dividing the entire system into interconnected subsystems as the basis of distributed estimation. Next, we develop local moving horizon estimators based on the configured subsystem models, and the local estimators communicate with each other to exchange their estimates. Finally, an SA and CSD based distributed moving horizon estimation (DMHE) mechanism is proposed. The effectiveness of the proposed approach is illustrated using a chemical process consisting of four connected reactors.

eess.SY↗

The trigger and data acquisition system of the FASER experiment

The FASER experiment is a new small and inexpensive experiment that is placed 480 meters downstream of the ATLAS experiment at the CERN LHC. FASER is designed to capture decays of new long-lived particles, produced outside of the ATLAS detector acceptance. These rare particles can decay in the FASER detector together with about 500-1000 Hz of other particles originating from the ATLAS interaction point. A very high efficiency trigger and data acquisition system is required to ensure that the physics events of interest will be recorded. This paper describes the trigger and data acquisition system of the FASER experiment and presents performance results of the system acquired during initial commissioning.

physics.ins-det↗