Stochastic Optimal Control via Measure Relaxations
The optimal control problem of stochastic systems is commonly solved via robust or scenario-based optimization methods, which are both challenging to scale to long optimization horizons. We cast the optimal control problem of a stochastic system as a convex optimization problem over occupation measures. We demonstrate our method on a set of synthetic and real-world scenarios, learning cost functions from data via Christoffel polynomials. The code for our experiments is available at https://github.com/ebuehrle/dpoc.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Non-local Optimization: Imposing Structure on Optimization Problems by Relaxation
In stochastic optimization, particularly in evolutionary computation and reinforcement learning, the optimization of a function $f: \Omega \to \mathbb{R}$ is often addressed through optimizing a so-called relaxation $\th…
reinforcement-learningReinforcement Learning (RL)Stochastic OptimizationIntroduction to Online Control
This text presents an introduction to an emerging paradigm in control of dynamical systems and differentiable reinforcement learning called online nonstochastic control. The new approach applies techniques from online co…
Decision MakingClosing the Gap to Quadratic Invariance: a Regret Minimization Approach to Optimal Distributed Control
In this work, we focus on the design of optimal controllers that must comply with an information structure. State-of-the-art approaches do so based on the H2 or Hinfty norm to minimize the expected or worst-case cost in …
Stochastic Finite State Control of POMDPs with LTL Specifications
Partially observable Markov decision processes (POMDPs) provide a modeling framework for autonomous decision making under uncertainty and imperfect sensing, e.g. robot manipulation and self-driving cars. However, optimal…
Decision MakingDecision Making Under UncertaintyRobot ManipulationRobot Navigation+1A Nonstochastic Control Approach to Optimization
Selecting the best hyperparameters for a particular optimization instance, such as the learning rate and momentum, is an important but nonconvex problem. As a result, iterative optimization methods such as hypergradient …