Data-driven optimal control with a relaxed linear program
type: Item
instance of: scholarly article
title: Data-driven optimal control with a relaxed linear program
zbMATH Open document ID: 1483.49018
author: Andrea Martinelli
author: Matilde Gargiani
author: John Lygeros
published in: Automatica
publication date: 2022-01-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/2003.08721
Mathematics Subject Classification ID: 49J45
Mathematics Subject Classification ID: 49L20
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7451660
zbMATH Keywords: approximate dynamic programming
zbMATH Keywords: optimal control
zbMATH Keywords: data-driven control
zbMATH Keywords: linear programming
zbMATH Keywords: stochastic systems
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3216251000
arXiv ID: 2003.08721
cites work: On the Theory of Dynamic Programming
cites work: Q3189557
cites work: Q4257216
cites work: Performance Guarantees for Model-Based Approximate Dynamic Programming in Continuous Spaces
cites work: Q3590801
cites work: Q3801397
cites work: Contraction Mappings in the Theory Underlying Dynamic Programming
cites work: Approximate Dynamic Programming via a Smoothed Linear Program
cites work: The Linear Programming Approach to Approximate Dynamic Programming
cites work: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
cites work: Q4146094
cites work: A Sum of Squares Approximation of Nonnegative Polynomials
cites work: Linear programming and sequential decisions
cites work: From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
cites work: Stability Analysis of Discrete-Time Infinite-Horizon Optimal Control With Discounted Cost
cites work: Approximate Dynamic Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Generalized polynomial approximations in Markovian decision processes
cites work: Approximate dynamic programming via iterated Bellman inequalities
cites work: \({\mathcal Q}\)-learning
DOI: 10.1016/J.AUTOMATICA.2021.110052
description: scientific article