Evidence map›Paper›PMID 37447869›Full record

ArticleSensors (Basel, Switzerland)2023

Intelligent Modeling for Batch Polymerization Reactors with Unknown Inputs.

Zhuangyu Liu, Xiaoli Luan

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Zhuangyu LiuKey Laboratory of Advanced Process Control for Light Industry (Ministry of Education), Jiangnan University, Wuxi 214122, China.
Xiaoli LuanKey Laboratory of Advanced Process Control for Light Industry (Ministry of Education), Jiangnan University, Wuxi 214122, China.

Funding

National Natural Science Foundation of China 61991402, 61973136, 61833007
6 · The paper itself

Abstract

While system identification methods have developed rapidly, modeling the process of batch polymerization reactors still poses challenges. Therefore, designing an intelligent modeling approach for these reactors is important. This paper focuses on identifying actual models for batch polymerization reactors, proposing a novel recursive approach based on the expectation-maximization algorithm. The proposed method pays special attention to unknown inputs (UIs), which may represent modeling errors or process faults. To estimate the UIs of the model, the recursive expectation-maximization (EM) technique is used. The proposed algorithm consists of two steps: the E-step and the M-step. In the E-step, a Q-function is recursively computed based on the maximum likelihood framework, using the UI estimates from the previous time step. The Kalman filter is utilized to calculate the estimates of the states using the measurements from sensor data. In the M-step, analytical solutions for the UIs are found through local optimization of the recursive Q-function. To demonstrate the effectiveness of the proposed algorithm, a practical application of modeling batch polymerization reactors is presented. The performance of the proposed recursive EM algorithm is compared to that of the augmented state Kalman filter (ASKF) using root mean squared errors (RMSEs). The RMSEs obtained from the proposed method are at least 6.52% lower than those from the ASKF method, indicating superior performance.

Indexed as

AlgorithmsLikelihood FunctionsPolymerizationTimebatch polymerization reactorsintelligent modelingprocess faultrecursive expectation-maximization algorithmsensor datastate estimation

Identifiers

PMID37447869
PMCPMC10346543

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.