(110d) Advances in Bounding and Comparison Methods for Dynamic Process Models
AIChE Annual Meeting
2019
2019 AIChE Annual Meeting
Computing and Systems Technology Division
Advances in Computational Methods and Numerical Analysis
Monday, November 11, 2019 - 1:18pm to 1:34pm
This presentation describes new sufficient conditions under which one ODE systemâs state variables will never exceed anotherâs; these conditions are significantly less stringent than previously proposed conditions. As an application of these conditions, it is shown that a state-of-the-art method by Scott and Barton [1] for constructing useful convex enclosures of the reachable set of a parametric ODE system has the following property: if tighter enclosures of the ODE right-hand side function are available, then these enclosures will necessarily translate into tighter enclosures of the reachable set. While plausible, this property was previously unknown and surprisingly difficult to prove. This result shows that it is worthwhile from a dynamic optimization standpoint to seek tighter enclosure methods for closed-form functions and models in general, since doing so translates into superior descriptions of reachable sets for dynamic systems, which are in turn useful in robust control and global dynamic optimization. Moreover, this result enables direct comparison of competing methods for dynamic reachable set generation; specific examples of this are presented. Further implications and examples are discussed.
Reference
[1] J.K. Scott and P.I. Barton, Improved relaxations for the parametric solutions of ODEs using differential inequalities, J. Glob. Optim. 57:143-176, 2013.