Unverified 2026

Adaptive Constant-Force Trim Channel

Implementation & benchmark of arXiv:2609.03351 — Taylor-Informed Predictive Cost Adaptive Control for Quadrotors with Online Gravity-Trim Adaptation

Usefulness6/10
Difficulty3/10
Novelty5/10

Source paper: Taylor-Informed Predictive Cost Adaptive Control for Quadrotors with Online Gravity-Trim Adaptation arXiv:2609.03351 · analyzed Sep 4, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Add a separately identified constant or slowly varying force channel to a neural dynamics model, analogous to the paper's online gravity-trim and mass adaptation. This isolates persistent low-frequency prediction bias from state-dependent dynamics, reducing repeated corrective action by the planner and avoiding expensive network retraining after a systematic shift.

Formulas

$$m\dot v=-mge_3+fRe_3,$$
$$\hat{x}_{k+1}=\hat{F}_{\theta}(x_k,u_k)+Gb_k,\qquad e_k=x_{k+1}-\hat{F}_{\theta}(x_k,u_k)-Gb_{k-1},$$
$$K_k=\frac{P_{k-1}G}{\lambda+G^{\top}P_{k-1}G},\qquad b_k=b_{k-1}+K_k^{\top}e_k,\qquad P_k=\lambda^{-1}\left(I-K_kG^{\top}\right)P_{k-1}.$$
$$N_{\mathrm{eff}}\approx\frac{1}{1-\lambda},\qquad \mathbb{E}\left[\|b_k-b_{\star}\|^2\right]\text{ decays after a bias step and approaches a noise-dependent floor that increases as }\lambda\text{ decreases}.$$

Mathematical statement

The vertical quadrotor equation contains a persistent acceleration contribution from gravity and thrust: $\dot v=-ge_3+(f/m)Re_3$. Model uncertainty in mass, gravity, or actuator calibration as a low-dimensional bias $b_k$ injected through a known selector matrix $G$. The adaptive predictor is $\hat{x}_{k+1}=\hat{F}_{\theta}(x_k,u_k)+Gb_k$. Given innovation $e_k=x_{k+1}-\hat{F}_{\theta}(x_k,u_k)-Gb_{k-1}$, estimate $b_k$ with RLS using covariance $P_k$ and forgetting factor $\lambda$. The persistent-bias channel is useful because it has a slower and simpler structure than the full nonlinear residual; after a step change in the true bias, the estimator should converge geometrically until it reaches a measurement-noise floor.

Implementation notes

1. Integration point: insert a low-dimensional trim head between a neural dynamics predictor and its MPC or model-based RL interface. Select $G$ from physically plausible persistent channels, such as vertical acceleration, horizontal force, or actuator torque offsets. Initially use a fixed selector and do not backpropagate through the trim estimator. 2. Pseudocode: compute neural prediction $\tilde{x}_{k+1}=\hat{F}_{\theta}(x_k,u_k)$; calculate $e_k=x_{k+1}-\tilde{x}_{k+1}-Gb_{k-1}$; compute $K_k$, $b_k$, and $P_k$ using the displayed equations; return $\tilde{x}_{k+1}+Gb_k$ to the planner; optionally reset or inflate $P_k$ when a regime-change detector fires. Add a penalty $\gamma\|b_k\|^2$ only when large biases are physically implausible. 3. Computed from the mechanism: the force-balance structure, innovation, RLS gain, and covariance. Estimated empirically: $G$, initial $P_0$, forgetting factor $\lambda$, and whether the trim should be constant or input-dependent. 4. First cheap experiment: train a neural Pendulum or CartPole model, inject a constant unknown force, and abruptly change its value halfway through evaluation. Compare neural-only, neural-plus-trained-global-bias, and neural-plus-RLS-trim models on one-step prediction and 20-step open-loop rollout. The predicted signature is geometric post-switch innovation reduction with recovery time proportional to $N_{\mathrm{eff}}\approx1/(1-\lambda)$. Fit the decay curve and require its time constant to agree with the RLS prediction within 20 percent. Lower $\lambda$ should adapt faster but produce a measurable higher stationary variance; accept the method only if it reduces post-switch bias by at least 50 percent without increasing pre-switch prediction variance by more than 20 percent.

Verification

This idea has not been verified yet.

Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.

Artifacts

Artifacts unavailable.