SCI和EI收录∣中国化工学会会刊

›› 2014, Vol. 22 ›› Issue (10): 1122-1130.DOI: 10.1016/j.cjche.2014.09.002

• 过程系统工程与过程安全 • 上一篇    下一篇

A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems

Yujie Wei, Yongheng Jiang, Dexian Huang   

  1. National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing 100084, China
  • 收稿日期:2013-01-29 修回日期:2013-06-30 出版日期:2014-10-28 发布日期:2014-12-01
  • 通讯作者: Dexian Huang
  • 基金资助:
    Supported by the National Basic Research Program of China (2012CB720500) and the NationalHigh Technology Research andDevelopment Programof China (2013AA040702).

A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems

Yujie Wei, Yongheng Jiang, Dexian Huang   

  1. National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing 100084, China
  • Received:2013-01-29 Revised:2013-06-30 Online:2014-10-28 Published:2014-12-01
  • Supported by:
    Supported by the National Basic Research Program of China (2012CB720500) and the NationalHigh Technology Research andDevelopment Programof China (2013AA040702).

摘要: This paper introduces a practical solving scheme of gradetransition trajectory optimization (GTTO) problems under typical certificate-checking-updating framework. Due to complicated kinetics of polymerization, differential/algebraic equations (DAEs) always cause great computational burden and system non-linearity usually makes GTTO non-convex bearing multiple optima. Therefore, coupled with the three-stage decomposition model, a three-section algorithm of dynamic programming (TSDP) is proposed based on the general iteration mechanism of iterative programming (IDP) and incorporated with adaptivegrid allocation scheme and heuristic modifications. The algorithm iteratively performs dynamic programming with heuristic modifications under constant calculation loads and adaptively allocates the valued computational resources to the regions that can further improve the optimality under the guidance of local error estimates. TSDP is finally compared with IDP and interior point method (IP) to verify its efficiency of computation.

关键词: Gradetransition trajectory optimization, Adaptivegrid allocation, Heuristic modifications, Three-section dynamic programming, Three-stage decomposition model

Abstract: This paper introduces a practical solving scheme of gradetransition trajectory optimization (GTTO) problems under typical certificate-checking-updating framework. Due to complicated kinetics of polymerization, differential/algebraic equations (DAEs) always cause great computational burden and system non-linearity usually makes GTTO non-convex bearing multiple optima. Therefore, coupled with the three-stage decomposition model, a three-section algorithm of dynamic programming (TSDP) is proposed based on the general iteration mechanism of iterative programming (IDP) and incorporated with adaptivegrid allocation scheme and heuristic modifications. The algorithm iteratively performs dynamic programming with heuristic modifications under constant calculation loads and adaptively allocates the valued computational resources to the regions that can further improve the optimality under the guidance of local error estimates. TSDP is finally compared with IDP and interior point method (IP) to verify its efficiency of computation.

Key words: Gradetransition trajectory optimization, Adaptivegrid allocation, Heuristic modifications, Three-section dynamic programming, Three-stage decomposition model