High-order approximation of the finite horizon control problem via a tree structure algorithm⁎. Issue 2 (2019)

• Record Type: Journal Article
• Authors: Alla, A.; Falcone, M.; Saluzzi, L.
• Is Part Of: IFAC-PapersOnLine. Volume 52:Issue 2(2019)
• Page Start: 19
• Page End: 24
• Publication Date: 2019
• Subjects: dynamic programming -- optimal control -- Hamilton-Jacobi-Bellman equation -- tree structure algorithm -- high-order approximation -- error estimates; Automatic control -- Periodicals; 629.805
• DOI: 10.1016/j.ifacol.2019.08.004
• Languages: English
• ISSNs: 2405-8963

Abstract

Abstract: Solving optimal control problems via Dynamic Programming is a difficult task that suffers for the "curse of dimensionality". This limitation has reduced its practical impact in real world applications since the construction of numerical methods for nonlinear PDEs in very high dimension is practically unfeasible. Recently, we proposed a new numerical method to compute the value function avoiding the construction of a space grid and the need for interpolation techniques. The method is based on a tree structure that mimics the continuous dynamics and allows to solve optimal control problems in high-dimension. This property is particularly useful to attack control problems with PDE constraints. We present a new high-order approximation scheme based on the tree structure and show some numerical results.