We propose an efficient technique for performing data-driven optimal control of discrete-time systems. In particular, we show that log-sum-exp (LSE) neural networks, which are smooth and convex universal approximators of convex functions, can be efficiently used to approximate Q-factors arising from finite-horizon optimal control problems with continuous state space. The key advantage of these networks over classical approximation techniques is that they are convex and hence readily amenable to efficient optimization.
Efficient model-free Q-faetor approximation in value space via log-sum-exp neural networks
Possieri Corrado
2020
Abstract
We propose an efficient technique for performing data-driven optimal control of discrete-time systems. In particular, we show that log-sum-exp (LSE) neural networks, which are smooth and convex universal approximators of convex functions, can be efficiently used to approximate Q-factors arising from finite-horizon optimal control problems with continuous state space. The key advantage of these networks over classical approximation techniques is that they are convex and hence readily amenable to efficient optimization.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


