Control of pH neutralization process using simulation based dynamic programming

Dong Kyu Kim, Kwang Soon Lee, Dae Ryook Yang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach suffers from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis [1996]. The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks, etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the approximator, the neural network which requires training and the k-nearest neighbor method which requires querying instead of training are investigated. The approximator has to use data from the optimal control strategy. If the optimal control strategy is not readily available, a suboptimal control strategy can be used instead. However, the laborious Bellman iterations are necessary in this case. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.

Original languageEnglish
Pages (from-to)942-949
Number of pages8
JournalKorean Journal of Chemical Engineering
Volume21
Issue number5
Publication statusPublished - 2004 Sep 1

Fingerprint

Dynamic programming
Neural networks
Control nonlinearities
Three term control systems
Real time control
Process control
Polynomials

Keywords

  • Constraint on Input Movement
  • k-Nearest Neighbor Method
  • Neural Network
  • pH Neutralization Process
  • The NDP (Neuro-Dynamic Programming)

ASJC Scopus subject areas

  • Chemistry(all)
  • Chemical Engineering(all)

Cite this

Control of pH neutralization process using simulation based dynamic programming. / Kim, Dong Kyu; Lee, Kwang Soon; Yang, Dae Ryook.

In: Korean Journal of Chemical Engineering, Vol. 21, No. 5, 01.09.2004, p. 942-949.

Research output: Contribution to journalArticle

@article{ec5461c27f7348b7805631ac4cbd1d44,
title = "Control of pH neutralization process using simulation based dynamic programming",
abstract = "The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach suffers from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis [1996]. The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks, etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the approximator, the neural network which requires training and the k-nearest neighbor method which requires querying instead of training are investigated. The approximator has to use data from the optimal control strategy. If the optimal control strategy is not readily available, a suboptimal control strategy can be used instead. However, the laborious Bellman iterations are necessary in this case. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.",
keywords = "Constraint on Input Movement, k-Nearest Neighbor Method, Neural Network, pH Neutralization Process, The NDP (Neuro-Dynamic Programming)",
author = "Kim, {Dong Kyu} and Lee, {Kwang Soon} and Yang, {Dae Ryook}",
year = "2004",
month = "9",
day = "1",
language = "English",
volume = "21",
pages = "942--949",
journal = "Korean Journal of Chemical Engineering",
issn = "0256-1115",
publisher = "Springer New York",
number = "5",

}

TY - JOUR

T1 - Control of pH neutralization process using simulation based dynamic programming

AU - Kim, Dong Kyu

AU - Lee, Kwang Soon

AU - Yang, Dae Ryook

PY - 2004/9/1

Y1 - 2004/9/1

N2 - The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach suffers from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis [1996]. The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks, etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the approximator, the neural network which requires training and the k-nearest neighbor method which requires querying instead of training are investigated. The approximator has to use data from the optimal control strategy. If the optimal control strategy is not readily available, a suboptimal control strategy can be used instead. However, the laborious Bellman iterations are necessary in this case. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.

AB - The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach suffers from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis [1996]. The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks, etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the approximator, the neural network which requires training and the k-nearest neighbor method which requires querying instead of training are investigated. The approximator has to use data from the optimal control strategy. If the optimal control strategy is not readily available, a suboptimal control strategy can be used instead. However, the laborious Bellman iterations are necessary in this case. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.

KW - Constraint on Input Movement

KW - k-Nearest Neighbor Method

KW - Neural Network

KW - pH Neutralization Process

KW - The NDP (Neuro-Dynamic Programming)

UR - http://www.scopus.com/inward/record.url?scp=10044286133&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10044286133&partnerID=8YFLogxK

M3 - Article

VL - 21

SP - 942

EP - 949

JO - Korean Journal of Chemical Engineering

JF - Korean Journal of Chemical Engineering

SN - 0256-1115

IS - 5

ER -