This article is concerned with the problem of output feedback Model
Predictive Control for stochastic linear systems, with hard and soft
constraints on the control inputs as well as soft constraints on the state. We
use the so-called purified outputs along with a nonlinear second-order control
policy and show that the resulting optimization program is convex. We
demonstrate how the proposed method can be applied in a receding horizon
fashion.
We present a dynamic programming-based solution to the problem of maximizing
the probability of attaining a target set before hitting a cemetery set for a
discrete-time Markov control process. Under mild hypotheses we establish that
there exists a deterministic stationary policy that achieves the maximum value
of this probability. We demonstrate how the maximization of this probability
can be computed through the maximization of an expected total reward until the
first hitting time to either the target or the cemetery set.