Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 95 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 90 tok/s Pro
GPT OSS 120B 449 tok/s Pro
Kimi K2 192 tok/s Pro
2000 character limit reached

Risk-Sensitive Model Predictive Control (2101.11166v2)

Published 27 Jan 2021 in math.OC

Abstract: We present a heuristic policy and performance bound for risk-sensitive convex stochastic control that generalizes linear-exponential-quadratic regulator (LEQR) theory. Our heuristic policy extends standard, risk-neutral model predictive control (MPC); however, instead of ignoring uncertain noise terms, our policy assumes these noise terms turns out either favorably or unfavorably, depending on a risk aversion parameter. In the risk-seeking case, this modified planning problem is convex. In the risk-averse case, it requires minimizing a difference of convex functions, which is done (approximately) using the convex-concave procedure. In both cases, we obtain a lower bound on the optimal cost as a by-product of solving the planning problem. We give a numerical example of controlling a battery to power an uncertain load, and show that our policy reduces the risk of a very bad outcome (as compared with standard certainty equivalent control) with negligible impact on the the average performance.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)