Article ID: | iaor201526124 |
Volume: | 62 |
Issue: | 3 |
Start Page Number: | 575 |
End Page Number: | 613 |
Publication Date: | Jul 2015 |
Journal: | Journal of Global Optimization |
Authors: | Chachuat Benot, Houska Boris, Villanueva Mario |
Keywords: | programming: nonlinear, differential equations |
This paper presents a framework for constructing and analyzing enclosures of the reachable set of nonlinear ordinary differential equations using continuous‐time set‐propagation methods. The focus is on convex enclosures that can be characterized in terms of their support functions. A generalized differential inequality is introduced, whose solutions describe such support functions for a convex enclosure of the reachable set under mild conditions. It is shown that existing continuous‐time bounding methods that are based on standard differential inequalities or ellipsoidal set propagation techniques can be recovered as special cases of this generalized differential inequality. A way of extending this approach for the construction of nonconvex enclosures is also described, which relies on Taylor models with convex remainder bounds. This unifying framework provides a means for analyzing the convergence properties of continuous‐time enclosure methods. The enclosure techniques and convergence results are illustrated with numerical case studies throughout the paper, including a six‐state dynamic model of anaerobic digestion.