Approximate dynamic programming based approach to process control and scheduling

Cited 57 time in webofscience Cited 0 time in scopus
  • Hit : 475
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, JayHyungko
dc.contributor.authorLee, Jong Minko
dc.date.accessioned2013-03-06T17:20:28Z-
dc.date.available2013-03-06T17:20:28Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2006-09-
dc.identifier.citationCOMPUTERS CHEMICAL ENGINEERING, v.30, no.10-12, pp.1603 - 1618-
dc.identifier.issn0098-1354-
dc.identifier.urihttp://hdl.handle.net/10203/87757-
dc.description.abstractMulti-stage decision problems under uncertainty are abundant in process industries. Markov decision process (MDP) is a general mathematical formulation of such problems. Whereas stochastic programming and dynamic programming are the standard methods to solve MDPs, their unwieldy computational requirements limit their usefulness in real applications. Approximate dynamic programming (ADP) combines simulation and function approximation to alleviate the 'curse-of-dimensionality' associated with the traditional dynamic programming approach. In this paper, we present the ADP as a viable way to solve MDPs for process control and scheduling problems. We bring forth some key issues for its successful application in these types of problems, including the choice of function approximator and the use of a penalty function to guard against over-extending the value function approximation in the value iteration. Application studies involving a number of well-known control and scheduling problems, including dual control, multiple controller scheduling, and resource constrained project scheduling problems, point to the promising potentials of ADP. (c) 2006 Elsevier Ltd. All rights reserved.-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.subjectMODEL-PREDICTIVE CONTROL-
dc.subjectIMPROVING HEURISTIC SOLUTIONS-
dc.subjectSTOCHASTIC LINEAR-PROGRAMS-
dc.subjectTRAVELING SALESMAN PROBLEM-
dc.subjectDUAL CONTROL-
dc.subjectALGORITHMIC FRAMEWORK-
dc.subjectNONLINEAR PROCESSES-
dc.subjectOPTIMIZATION-
dc.subjectSYSTEMS-
dc.subjectDECOMPOSITION-
dc.titleApproximate dynamic programming based approach to process control and scheduling-
dc.typeArticle-
dc.identifier.wosid000240794000017-
dc.identifier.scopusid2-s2.0-33747872589-
dc.type.rimsART-
dc.citation.volume30-
dc.citation.issue10-12-
dc.citation.beginningpage1603-
dc.citation.endingpage1618-
dc.citation.publicationnameCOMPUTERS CHEMICAL ENGINEERING-
dc.identifier.doi10.1016/j.compchemeng.2006.05.043-
dc.contributor.localauthorLee, JayHyung-
dc.contributor.nonIdAuthorLee, Jong Min-
dc.type.journalArticleArticle; Proceedings Paper-
dc.subject.keywordAuthorMarkov decision process-
dc.subject.keywordAuthorapproximate dynamic programming-
dc.subject.keywordAuthorfunction approximation-
dc.subject.keywordPlusMODEL-PREDICTIVE CONTROL-
dc.subject.keywordPlusIMPROVING HEURISTIC SOLUTIONS-
dc.subject.keywordPlusSTOCHASTIC LINEAR-PROGRAMS-
dc.subject.keywordPlusTRAVELING SALESMAN PROBLEM-
dc.subject.keywordPlusDUAL CONTROL-
dc.subject.keywordPlusALGORITHMIC FRAMEWORK-
dc.subject.keywordPlusNONLINEAR PROCESSES-
dc.subject.keywordPlusOPTIMIZATION-
dc.subject.keywordPlusSYSTEMS-
dc.subject.keywordPlusDECOMPOSITION-
Appears in Collection
CBE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 57 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0