Volume 28, 2022
|Number of page(s)
|09 November 2022
Error Estimates for a Tree Structure Algorithm Solving Finite Horizon Control Problems*
Department of Mathematics, Imperial College London, South Kensington Campus, SW7 2AZ London, UK
2 Dipartimento di Scienze Molecolari e Nanosistemi, Università Ca’ Foscari Venezia, Via Torino 155, 30172 Venezia Mestre, Italy
3 Sapienza Università di Roma – Piazzale Aldo Moro 5, 00185 Roma, Italy
** Corresponding author: firstname.lastname@example.org
Accepted: 13 October 2022
In the dynamic programming approach to optimal control problems a crucial role is played by the value function that is characterized as the unique viscosity solution of a Hamilton-Jacobi-Bellman (HJB) equation. It is well known that this approach suffers from the “curse of dimensionality” and this limitation has reduced its use in real world applications. Here, we analyze a dynamic programming algorithm based on a tree structure to mitigate the “curse of dimensionality”. The tree is built by the discrete time dynamics avoiding the use of a fixed space grid which is the bottleneck for highdimensional problems, this also drops the projection on the grid in the approximation of the value function. In this work, we present first order error estimates for the the approximation of the value function based on the tree-structure algorithm. The estimate turns out to have the same order of convergence of the numerical method used for the approximation of the dynamics. Furthermore, we analyze a pruning technique for the tree to reduce the complexity and minimize the computational effort. Finally, we present some numerical tests to show the theoretical results.
Mathematics Subject Classification: 49L20 / 49J15 / 49J20 / 93B52
Key words: Dynamic programming / Hamilton-Jacobi-Bellman equation / optimal control / tree structure / error estimates
© The authors. Published by EDP Sciences, SMAI, 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.