Nguyen, M Pascal (2020) Étude comparative de différents algorithmes d’apprentissage par renforcement PRE - Research Project, ENSTA.
In this bibliographic study, we aim to solve finite-horizon optimal control problems with or without constraint using the principles of reinforcement learning for infinite-horizon problems. Optimal control problem is about finding the control to apply to the system to optimize a criterion function (for example, the search for the trajectory of a rocket which will minimize the fuel cost). We compared the performance of three reinforcement learning algorithms OP(Optimistic Planning), SOP(Simultaneous Optimistic Planning) and SOPMS(Simultaneous Optimistic Planning Multiple Step) applied to finite-horizon optimal control problems through numerous numerical simulations (applied to differential equation and partial differential equation). We concluded that the algorithm OP is less efficient (result and CPU time) than the SOP and SOPMS algorithms. keywords : optimal control, optimistic planning, reinforcement learning, tree structure
|Item Type:||Thesis (PRE - Research Project)|
|Subjects:||Mathematics and Applications|
|Deposited By:||Pascal Nguyen|
|Deposited On:||02 juill. 2021 15:02|
|Dernière modification:||02 juill. 2021 15:02|
Repository Staff Only: item control page