---
title: 'Observed Control: Integrated Estimation & Synthesis'
url: https://www.emergentmind.com/topics/observed-control
type: topic
---

# Observed Control: Integrated Estimation & Synthesis

Observed control can be understood as a family of control formulations in which observation, estimation, or observer dynamics are integral to policy synthesis rather than merely auxiliary to it. In one explicit usage, “Observed Control” denotes a predictive controller that turns predictive control into a state-estimation problem in reverse, uses Kalman smoothers as the backend optimization framework, and provides linear time-horizon length scalability, adaptive time horizon lengths, and early optimization termination criteria [2508.13339]. Across partially observed stochastic control more broadly, related constructions replace inaccessible state variables by filters, observer states, or history processes, so that control is designed on conditional distributions, estimated states, or information histories instead of the hidden physical state [2602.16392, 2301.11244, 1509.03427].

## 1. Control–estimation duality and observer-centric formulations

The most direct formulation of observed control is the smoother-based predictive-control construction of [2508.13339]. There, the duality between state estimation and MPC is made explicit: the dynamics become the process model, the desired objective or tracking error becomes a measurement residual, and the control inputs are embedded into an augmented “state” that the smoother estimates. For linear systems, the augmented state
\[
\chi_k=\begin{bmatrix} x_k \\ u_k \end{bmatrix},\qquad
\Phi=\begin{bmatrix} A & B \\ 0 & \mathbb{I}_m \end{bmatrix},\qquad
H=\begin{bmatrix} C & D \\ 0 & \mathbb{I}_m \end{bmatrix}
\]
allows the observed-control smoother objective to become equivalent to the LQR objective in the infinite-horizon limit. The paper’s key algorithmic refinement is that MPC applies only the first control, so the backward RTS pass can be eliminated in favor of a forward-only accumulation. This yields adaptive horizon selection through the termination metrics \(\rho_N\) and \(\tau_k\), and a decomposition of linear MPC into purely reactive and anticipatory components that enables any-time any-horizon observed control while ensuring controller stability for short time horizons [2508.13339].

A related observer-centric perspective appears in observer-based realization. For the linear system \(\dot x(t)=Ax(t)+Bu(t)\), \(y(t)=Hx(t)\), the associated state-observer system is \(\dot y(t)=HAx(t)+HBu(t)\). The observer-based realization framework treats this as a dynamical system on observables and uses bridge matrices together with dimension-keeping semi-tensor product machinery to construct approximate or exact observer dynamics. Exact closure exists if and only if the observer subspace \(H_*=\operatorname{Span}(\operatorname{Row}(H))\) is \(A\)-invariant, equivalently \(HA=\Xi H\). When exact closure fails, the framework enlarges the observer set to the smallest \(A\)-invariant or \((A,B)\)-invariant closure containing \(H_*\), producing an extended OR-system or feedback extended OR-system [2404.15688].

## 2. Partial observation, filtering, and separation

The main mathematical substrate for observed control is partially observed stochastic control. In a finite-state continuous-time Markov chain with hidden state \(X_t^\alpha\), control-dependent jump intensities \(q(a,t,i,j)\), and observation process
\[
W_t=\int_0^t h(X_s^\alpha,\alpha_s,s)\,ds+B_t,
\]
admissible controls are \(\mathcal F^W\)-predictable. A Girsanov-type change of measure introduces the unnormalized filter \(\rho_t(\phi)=\mathbb E[\phi(X_t^\alpha)Z_t^\alpha\mid\mathcal F_t^W]\), which satisfies the Wonham/Zakai equation and becomes the fully observed state of a separated control problem. The original weak control problem and the separated problem are equivalent. For the separated problem, the value function is characterized as the unique bounded viscosity solution of the elliptic HJB equation in the infinite-horizon case and the unique viscosity solution of the parabolic HJB equation in the class of functions with linear growth in \(x\), uniformly in \(t\); the same treatment also yields verification theorems and a stochastic maximum principle [2602.16392].

Belief-state reduction is not the only route. A direct history-space formulation replaces the belief-MDP by the infinite-past state
\[
S_k=(Y_{(-\infty,k]},U_{(-\infty,k-1]})
\]
for discounted cost and by
\[
Z_k=(Y_{(-\infty,k]},U_{(-\infty,k-1]},X_k)
\]
for average cost. Under weak continuity of the transition and measurement kernels together with a filter/history continuity condition, optimal discounted-cost and average-cost policies exist. For discounted control, \(N\)-memory policies are asymptotically optimal, and under Wasserstein regularity the finite-window approximation error is explicitly bounded, with quantization diameter upper bounded by \(3\cdot 2^{-N}\) [2301.11244].

Risk-sensitive and jump-driven extensions preserve the same structural pattern. Partially observed forward-backward systems with Brownian motion and Poisson random measures are transformed by likelihood-ratio or Girsanov changes of measure into complete-information recursive control problems, leading to modified Zakai equations and global stochastic maximum principles even when the control domain is not convex and the control enters diffusion and jump coefficients [2504.04649, 2108.10483].

## 3. Scalable computation under partial observation

For large-scale partially observed systems, especially PDE-governed models, observed-control ideas are deployed through separation-based computation. One architecture first solves an offline open-loop deterministic trajectory optimization in belief space using a black-box simulator, then identifies a trajectory-dependent linearized reduced-order model from input-output impulse responses via time-varying Eigensystem Realization Algorithm, and finally designs an online LQG controller on the reduced model. The central justification is nominal-cost dominance: when the cost is linearized around a nominal trajectory, the first-order error satisfies \(\mathbb E(\delta J)=0\), so nominal planning and local feedback may be designed separately. In the nonlinear heat example, the paper reports that the reduced-order design lowers complexity by about \(O(10^5)\) compared with DDP-based RL [1707.03092].

For partially observed SPDEs, a more direct optimization route combines finite-element / implicit-Euler discretization, particle filtering, and stochastic gradient descent. The admissible controls are \(\mathcal F_t^Y\)-progressively measurable, the conditional law \(p(X_h(t_n)\mid\mathcal F_{t_n}^Y)\) is approximated by a particle system, and the FE-PF-SGD algorithm alternates particle propagation, forward SPDE solves, backward adjoint solves, stochastic-gradient control updates, and bootstrap resampling. The paper proves spatial convergence of the finite element approximation of the forward-backward system, while explicitly stating that a full convergence theorem for the SGD/filtering-based control iteration is left to future work [2504.00381].

Online partially observed control with adversarial disturbances has also been studied for linear dynamical systems with hidden state \(x_{t+1}=Ax_t+Bu_t+w_t\), observation \(y_t=Cx_t\), and adaptive adversarial convex costs. Double Spectral Control constructs a natural observation sequence \(y_t^{\mathrm{nat}}=y_t-Cz_t\) with \(z_{t+1}=Az_t+Bu_t\), then applies a two-level spectral approximation based on a universal basis of Hankel eigenvectors. The resulting improper-learning controller attains regret
\[
\mathrm{Regret}_T(\mathrm{DSC},\mathcal S)=\tilde{\mathcal O}\!\left(\frac{\sqrt T}{\gamma^{11}}\right),
\]
while each round can be implemented in \(\mathrm{polylog}(T/\gamma)\) amortized time [2505.20943].

## 4. Observer-based implementation and formal guarantees

Observer-based synthesis gives observed control a formal refinement layer. For the partially observable LTI plant
\[
x(t+1)=Ax(t)+Bu(t),\qquad y(t)=Cx(t),\qquad z(t)=Hx(t),
\]
a Luenberger observer
\[
\hat{x}(t+1)=A\hat{x}(t)+Bu(t)+L\big(y(t)-\hat{y}(t)\big)
\]
is combined with a sensor-based interface
\[
u(t)=\bar u_q(\bar x(t))+K\big(\bar x(t)-\hat x(t)\big).
\]
The mismatch between the ideal state-based controller and the observed implementation is quantified by a second-order bound \(Q\), yielding interface precision
\[
\epsilon=\sqrt{\operatorname{trace}\!\left(\begin{bmatrix}H&H\end{bmatrix}Q\begin{bmatrix}H&H\end{bmatrix}^{T}\right)}.
\]
In the stochastic extension, the same construction yields approximate bisimulation and a quantified robustness bound incorporating both process-noise and measurement-noise terms [1509.03427].

Layered control extends this viewpoint to inter-layer imitation under partial observation. Each layer has its own observer, and the lower-layer controller is built as
\[
\pi^{(2)}(u_t^{(1)},x_t^{(1)},x_t^{(2)}) = Ru_t^{(1)} + Qx_t^{(1)} + K\big(x_t^{(2)} - Px_t^{(1)}\big).
\]
The core notion is a stochastic simulation function \(V\) that must upper-bound the mean-squared output mismatch and contract in expectation. For linear systems with steady-state Kalman estimators, this yields the explicit uniform output-distance guarantee
\[
\varepsilon = \sqrt{ \max\left\{ V(\mu_0^{(1)},\mu_0^{(2)}), \frac{\alpha}{1-\rho} \right\} + \operatorname{trace}\big(\Sigma_v^{(1)}+\Sigma_v^{(2)}\big) }.
\]
The aerial-robotics examples report \(\varepsilon=0.29\) for the UAV case and \(\varepsilon=0.41\) for the hexacopter-with-camera case [2604.11956].

## 5. Informative actions, controlled sensing, and adversarial observation design

Observed control does not only use measurements; it can also shape what becomes measurable. One formulation trains policies whose actions themselves reveal agent state. In an aircraft target-tracking problem, a neural policy is trained with Soft Actor-Critic while an embedded Unscented Kalman Filter uses pseudocontrol actions as measurements. Reward shaping augments the distance-based task objective by an estimator-performance term, with final reported scales \(R_0=121.8\) and \(R_1=31.59\). Over 14,500 Monte Carlo episodes, the embedded-estimator policy has task performance very similar to the task-only policy at the 80th percentile, with reward \(79.1\) versus \(80.1\), but far better state reconstruction: mean end-of-episode position error is \(12.15\) m versus \(274.3\) m, mean velocity error is \(2.94\) m/s versus \(14.2\) m/s, less than \(10\) m position error occurs in about \(90\%\) of cases versus about \(60\%\), and the local linearized observability matrix remains singular at any single point so the improvement arises from the stripped observability matrix over trajectories rather than from pointwise full observability [2606.27609].

A more structural version of observation design appears in path integral control with controlled sensing. For
\[
dx_t = f(x_t)\,dt + B u^a_t\,dt + H\,dw_t,\qquad
dy_t = C(u^s_t)\,x_t\,dt + \sigma_o\,d\nu_t,
\]
the observation matrix itself is treated as a control variable. If sensing is restricted to a measurable selector from the matching set
\[
U(\Sigma)=\left\{u : D(\Sigma,u)=\lambda B R_a^{-1}B^\top\right\},
\qquad
D(\Sigma,u)=\Sigma C(u)^\top R_o^{-1}C(u)\Sigma,
\]
then the belief-space HJB can be transformed by \(V=-\lambda\log\Psi\) into a linear PDE with a Feynman–Kac representation. The paper also emphasizes the main limitations: the matching set may be empty, and the constrained optimum generally differs from the true unconstrained optimum [2604.18941].

The same centrality of observations also appears in adversarial form. In a dynamic game formulation of gaslighting, a manipulator changes the observation density, perturbs the information-state recursion \(\sigma_k\), and is constrained by Expected Stage-wise Stealthiness. The resulting analysis gives explicit bounds on the deviation of the information state and on degradation of the decision-maker’s objective, with cumulative effects over the horizon even when the manipulations remain stealthy [2304.01134].

## 6. Applications, limitations, and conceptual boundaries

Applications are diverse. The named Observed Control method is demonstrated on a mass-spring-damper LQR benchmark, linear drag with obstacle avoidance, and cart-pole swing-up; for the nonlinear benchmark, EKF- and UKF-backed observed control produce effectively indistinguishable trajectories [2508.13339]. Observer-based correct-by-design synthesis is evaluated on a smart-building temperature-control problem with limited sensing due to a sensor fault [1509.03427]. Layered partially observed control is demonstrated on an unmanned aerial vehicle and a hexacopter with a camera payload [2604.11956], and partially observed Stackelberg stochastic differential games are applied to multi-agent formation control with one leader and multiple followers [2412.07159].

Digital twin control offers another application domain. There, a controlled physical twin is only partially observed, while a digital twin combines ensemble Kalman filtering with a forward-in-time McKean–Pontryagin control law so that state assimilation and control computation occur simultaneously. Numerical studies on a controlled Lorenz-63 system and an inverted pendulum show bounded RMSE in the former and stabilization of the upright unstable equilibrium in the latter, even with small ensembles, but the paper explicitly describes the contribution as methodological and numerical and leaves mathematical investigation of stability and convergence to future research [2510.00937].

A plausible implication of these results is that observed control is less a single theorem or algorithm than a recurring design stance: policy synthesis is carried out on filters, observers, history processes, or action-generated measurements rather than on the inaccessible physical state. The same literature also marks its boundaries. Exact observer-based realization may fail unless the observer subspace is invariant [2404.15688]. Trajectory-level observability may improve even when the local observability matrix remains singular [2606.27609]. Some linearly solvable partially observed constructions depend on restrictive matching conditions between observation-driven diffusion and actuation authority [2604.18941]. Observed control is therefore best understood not as a replacement for estimation, but as a class of architectures in which estimation, observation design, and control law computation are structurally inseparable.

Source: https://www.emergentmind.com/topics/observed-control