Abstract

SummaryOne of the most basic problems in control theory is that of controlling a discrete‐time linear system subject to uncertain noise with the objective of minimizing the expectation of a quadratic cost. If one assumes the noise to be white, then solving this problem is relatively straightforward. However, white noise is arguably unrealistic: noise is not necessarily independent, and one does not always precisely know its expectation. We first recall the optimal control policy without assuming independence and show that, in this case, computing the optimal control inputs becomes infeasible. In the next step, we assume only the knowledge of lower and upper bounds on the conditional expectation of the noise and prove that this approach leads to tight lower and upper bounds on the optimal control inputs. The analytical expressions that determine these bounds are strikingly similar to the usual expressions for the case of white noise.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.