Memory-Augmented MPPI Control

• Memory-Augmented MPPI is a control framework that integrates persistent memory from past trajectories or features to refine planning under uncertainty.
• It modifies standard MPPI by altering the proposal distribution, cost shaping, and local feedback using explicit mechanisms like topological features and implicit replay-based priors.
• Empirical evaluations demonstrate enhanced sample efficiency, improved escape from local minima, and superior performance in tasks such as UAV obstacle avoidance and humanoid control.

Memory-Augmented Model Predictive Path Integral (MPPI) denotes a family of MPPI-based control and planning methods in which the optimization at a given control step is influenced by persistent information carried across prior planning cycles, prior trajectories, or prior learning updates. In recent literature, that persistent information takes several distinct forms: explicit topological memories that reshape the value landscape, replayed open-loop action sequences, planner-induced priors distilled from replay, transformer-predicted warm starts from historical trajectory data, and retained local feedback gains derived from previous MPPI solves. The resulting methods differ sharply in what they store, how they reuse it, and whether the “memory” is explicit and addressable or merely implicit and parametric (Zheng et al., 24 Sep 2025, Serra-Gomez et al., 5 Oct 2025, Banker et al., 1 Apr 2026, Zinage et al., 2024).

1. Foundations in standard MPPI

Standard MPPI is most cleanly understood through the probabilistic-inference formulation of optimal control. For a control sequence $\mathbf{u}_{0:T-1}$, trajectory cost $J_\tau(\mathbf{u}_{0:T-1})$, prior control distribution $p(\mathbf{u}_{0:T-1})$, and temperature $\lambda>0$, the optimal control distribution has Boltzmann form

$$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$

with

$$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$

MPPI then approximates this optimal distribution by projecting it onto a fixed-covariance Gaussian family and updating the mean of the control sequence by a Softmax-weighted average of sampled trajectories (Honda, 11 Nov 2025).

In the basic Gaussian formulation, one samples

$$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$

computes trajectory costs $J_\tau^k$, forms normalized weights

$$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$

and updates the mean sequence by

$$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$

A separate optimization-theoretic analysis shows that, for a fixed-covariance Gaussian family, classical MPPI is exactly a preconditioned gradient descent step with unit step size on a negative log-partition objective, with preconditioner $J_\tau(\mathbf{u}_{0:T-1})$0 in the paper’s notation (Fazlyab et al., 25 Mar 2026).

This interpretation matters for memory augmentation because the prior $J_\tau(\mathbf{u}_{0:T-1})$1, the proposal family, the covariance, and the update geometry are all first-class objects. A memory mechanism can therefore alter MPPI by changing the prior, the sampling family, the effective energy landscape, or the optimizer state rather than only by storing trajectories informally. A complementary unification with reinforcement learning and diffusion models frames MPPI as score ascent on a smoothed Gibbs distribution, which suggests that memory can be inserted through the trajectory distribution being optimized, the smoothing kernel, the score estimator, or a data-driven prior (Li et al., 27 Feb 2025).

2. Principal forms of memory augmentation

Across current MPPI literature, “memory augmentation” does not refer to a single architecture. It refers to several non-equivalent mechanisms for carrying information across time.

Representative method	Memory object	Operational role
MA-MPPI (Zheng et al., 24 Sep 2025)	Feature set $J_\tau(\mathbf{u}_{0:T-1})$2	Reshapes value and exploration near memorized difficult regions
Soft MPCritic (Banker et al., 1 Apr 2026)	Stored open-loop sequence $J_\tau(\mathbf{u}_{0:T-1})$3 in replay	Warm-starts online control and batched MPPI target generation
PO-MPC (Serra-Gomez et al., 5 Oct 2025)	Planner-induced prior $J_\tau(\mathbf{u}_{0:T-1})$4 or distilled prior $J_\tau(\mathbf{u}_{0:T-1})$5	KL-regularizes policy toward past planning behavior
TransformerMPPI (Zinage et al., 2024)	Transformer weights plus recent state/context window	Predicts an informed initial mean control sequence
Feedback-MPPI (Belvedere et al., 17 Jun 2025)	Local gain $J_\tau(\mathbf{u}_{0:T-1})$6 and nominal setpoint $J_\tau(\mathbf{u}_{0:T-1})$7	Reuses local sensitivities between full MPPI optimizations

The strongest distinction is between explicit and implicit memory. MA-MPPI stores an explicit set of localized features describing trap states, low-gradient regions, and high-curvature regions. By contrast, PO-MPC explicitly states that it does not introduce a memory module in the sense of recurrent state, episodic retrieval, trajectory-attention, or a nonparametric memory bank; its “memory” is an implicit, parametric memory encoded in learned policy weights, the learned prior, and replay-buffer statistics. TransformerMPPI likewise uses offline historical control data and a short runtime context window, but not an external memory store. Feedback-MPPI reuses local rollout sensitivities and gains rather than a trajectory archive. Soft MPCritic uses replay-buffer-based retrieval of stored open-loop plans, which is closer to episodic memory than the others but is still not a differentiable external memory architecture (Serra-Gomez et al., 5 Oct 2025, Zinage et al., 2024, Belvedere et al., 17 Jun 2025, Banker et al., 1 Apr 2026).

Adjacent MPPI variants clarify the boundary of the term. BR-MPPI augments the state with barrier-rate variables $J_\tau(\mathbf{u}_{0:T-1})$8 and samples pseudo-controls that are projected onto equality-constrained manifolds. The paper explicitly does not describe this as memory, although it does note that the extra variables resemble a controller-side auxiliary state or latent safety state rather than memory of past trajectories (Parwana et al., 8 Jun 2025). Biased-MPPI, meanwhile, does not store memory either, but it derives a biased objective under which arbitrary proposal distributions can be used with simplified weights $J_\tau(\mathbf{u}_{0:T-1})$9; this is a natural substrate for memory-driven proposal mechanisms because it makes complex proposal generation easier to incorporate (Trevisan et al., 2024).

3. Explicit topological memory: MA-MPPI

The clearest explicit formulation of memory-augmented MPPI is the MA-MPPI controller introduced within Memory-Augmented Potential Field Theory. The setting is a discrete-time stochastic system

$p(\mathbf{u}_{0:T-1})$0

with finite-horizon objective

$p(\mathbf{u}_{0:T-1})$1

The paper defines an explicit memory

$p(\mathbf{u}_{0:T-1})$2

where $p(\mathbf{u}_{0:T-1})$3 is a feature position, $p(\mathbf{u}_{0:T-1})$4 an influence radius, $p(\mathbf{u}_{0:T-1})$5 a feature strength, $p(\mathbf{u}_{0:T-1})$6 a feature type, and $p(\mathbf{u}_{0:T-1})$7 a direction vector. The three feature types are local minima, low-gradient regions, and high-curvature regions. Memory is updated online by

$p(\mathbf{u}_{0:T-1})$8

with feature detection based on state stagnation, low-gradient detection, and curvature detection (Zheng et al., 24 Sep 2025).

The augmented value function is

$p(\mathbf{u}_{0:T-1})$9

with memory-derived potential

$\lambda>0$0

For type-1 features, the local-minimum basis is

$\lambda>0$1

The same memory also modulates exploration: $\lambda>0$2 and the appendix further gives covariance inflation as

$\lambda>0$3

Thus memory enters both cost shaping and the proposal distribution. The control update remains MPPI-style,

$\lambda>0$4

but the value landscape, temperature, and covariance are now memory dependent (Zheng et al., 24 Sep 2025).

The paper presents three headline theoretical properties. First, a non-convex escape theorem states that if the feature strength around a memorized local minimum is sufficiently large relative to the local base-gradient magnitude, then there exists a finite $\lambda>0$5 such that the controller exits the memorized basin with probability at least $\lambda>0$6. Second, an asymptotic convergence theorem states that, under coercivity assumptions on $\lambda>0$7, the controller reaches an $\lambda>0$8-neighborhood of the global optimum with probability at least $\lambda>0$9 after finite time. Third, an adaptive learning efficiency theorem states that if there are $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$0 independent local minimum regions, then the expected time of standard MPPI is lower bounded by $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$1 (Zheng et al., 24 Sep 2025).

Empirically, the paper reports MA-MPPI on Pendulum-v1, BipedalWalker-v3, HalfCheetah-v4, and Humanoid-v4, as well as power-system control and UAV obstacle avoidance. On Humanoid-v4, it reports asymptotic reward $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$2 for MA-MPPI, compared with $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$3 for MPPI and $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$4 for SAC; local optima escape $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$5 versus $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$6 for MPPI; trap frequency $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$7 versus $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$8; and sample efficiency $$\pi^*(\mathbf{u}_{0:T-1}) = Z^{-1}\exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1}),$$9 versus $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$0. In UAV obstacle avoidance, it reports success rate $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$1 versus $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$2 for MPPI and local minima escape $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$3 versus $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$4. Reported computational overhead is roughly $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$5, $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$6, $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$7, and $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$8 on Pendulum, BipedalWalker, HalfCheetah, and Humanoid, with a UAV-specific appendix reporting $$Z=\int \exp\!\left(-\lambda^{-1}J_\tau(\mathbf{u}_{0:T-1})\right)p(\mathbf{u}_{0:T-1})\,d\mathbf{u}_{0:T-1}.$$9 in one setting (Zheng et al., 24 Sep 2025).

4. Implicit, replay-based, and parametric memory variants

A large portion of recent work uses “memory” in an implicit or operational sense rather than through an explicit addressable memory structure. PO-MPC is exemplary. It interprets MPPI-based reinforcement learning as KL-regularized RL toward an adaptive planner-induced prior $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$0, which may be either the raw planner distribution $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$1 saved in replay or a learned intermediate prior $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$2. Its core objective is

$$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$3

The paper is explicit that this is not a memory module in the architectural sense, but it is an implicit parametric memory of prior planner behavior encoded in learned policy weights, the learned prior, and replay-buffer statistics. It unifies TD-MPC2 as the $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$4 limit, BMPC as the $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$5 planner-cloning limit, and intermediate variants with finite $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$6. Experiments on 7 DeepMind Control Suite tasks and 14 HumanoidBench locomotion tasks report that finite regularization strengths $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$7 often outperform both extremes, that the learned intermediate prior reduces the mean and standard deviation of the KL term during policy updates, and that forward versus reverse KL for fitting $$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$8 changes the exploration–concentration tradeoff (Serra-Gomez et al., 5 Oct 2025).

Soft MPCritic introduces a more literal replay-based memory. It stores replay tuples of the form

$$\mathbf{u}_{0:T-1}^{k} \sim \mathcal{N}(\mu_{0:T-1}^{\rm prev}, \Sigma), \qquad k=1,\dots,K,$$9

where $J_\tau^k$0 is the planned open-loop action sequence produced by online MPPI at that state. During training, the stored $J_\tau^k$1 is retrieved, used to initialize MPPI at the next state $J_\tau^k$2, refined to $J_\tau^k$3, and written back to replay. This amortized warm-start strategy means the replay buffer acts as a distributed memory of partially optimized plans associated with previously visited transitions. The same short-horizon MPPI planner is used both for online control and for generating fitted soft value-iteration targets with terminal critic augmentation. The paper reports that warm-started target generation can be effective with only about $J_\tau^k$4 of the samples used online, that matching warm-start quality with cold starting can amount to at least a $J_\tau^k$5 slowdown in wall time, and that removing the terminal $J_\tau^k$6-function collapses Hopper performance because planning is then restricted to $J_\tau^k$7 (Banker et al., 1 Apr 2026).

TransformerMPPI uses offline historical MPPI trajectories to train a transformer that predicts an informed initial mean control sequence from a short history of past states and environment context. At runtime, the transformer outputs

$J_\tau^k$8

and MPPI samples around that predicted mean. The paper explicitly states that this is not an explicit memory bank or retrieval mechanism; the memory resides in transformer parameters and the short historical context window. In a representative Navigation 2D example with 50 samples, the plotted trajectory costs are $J_\tau^k$9 for MPPI and $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$0 for TransformerMPPI. The paper further reports lower median cost across all tested sample sizes in Navigation 2D and autonomous racing, lower average cost across all sample counts, and convergence of MPPI and TransformerMPPI performance as the racing sample count approaches 10,000 (Zinage et al., 2024).

Feedback-MPPI reuses information of a different kind. Instead of storing past trajectories or priors, it differentiates the MPPI update to obtain a local linear feedback gain

$$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$1

then applies high-frequency corrections

$$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$2

between full MPPI optimizations. The method retains $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$3, $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$4, and a nominal local setpoint $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$5, so its memory is a short-lived local surrogate of the MPPI controller rather than a trajectory archive. On a real quadrotor, the paper reports RMSE reductions of $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$6 in $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$7 and $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$8 in $$w_k=\frac{\exp(-\lambda^{-1}J_\tau^k)}{\sum_{j=1}^{K}\exp(-\lambda^{-1}J_\tau^j)},$$9 relative to standard MPPI, with F-MPPI achieving RMSE $$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$0 m in $$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$1 and $$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$2 m in $$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$3, versus $$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$4 m and $$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$5 m for standard MPPI. The added gain computation increases runtime by roughly $$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$6 (Belvedere et al., 17 Jun 2025).

5. Mathematical context and adjacent augmentations

Recent theory clarifies where memory can enter MPPI without changing its basic control-as-inference identity. One line of work interprets MPPI, policy-gradient RL, and diffusion sampling as gradient-based optimization on a Gibbs measure

$$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$7

and shows that MPPI can be viewed as gradient ascent on a Gaussian-smoothed energy function. In that view, the update

$$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$8

is approximated by weighted perturbation averages. The paper explicitly notes that memory can be inserted through the trajectory/control distribution being optimized, the proposal or smoothing kernel, the score estimator, or a data-driven prior. This provides a mathematical rationale for history-conditioned priors, replay-informed score fields, and diffusion-style planning with memory-conditioned proposals (Li et al., 27 Feb 2025).

Biased-MPPI contributes a different structural insight. By redefining the cost as

$$\mu_{0:T-1}^*=\sum_{k=1}^{K} w_k\, \mathbf{u}_{0:T-1}^{k}.$$9

it obtains a biased free-energy inequality regularized toward an arbitrary sampling distribution $J_\tau(\mathbf{u}_{0:T-1})$00, while the importance weights simplify to

$J_\tau(\mathbf{u}_{0:T-1})$01

The paper uses this to fuse ancillary controllers into MPPI by injecting controller-generated trajectories directly into the sample set. For memory augmentation, the significance is straightforward: the same derivation makes it technically easy to replace ancillary controllers by memory-derived proposals, retrieved plans, or learned history-conditioned candidates without requiring tractable density evaluation for the proposal (Trevisan et al., 2024).

BR-MPPI shows that not every persistent internal variable should be called memory. It augments the predictive state to

$J_\tau(\mathbf{u}_{0:T-1})$02

introduces equality-constrained barrier-rate dynamics, samples pseudo-controls, and projects them onto a constraint manifold. The resulting $J_\tau(\mathbf{u}_{0:T-1})$03 variables persist over the horizon and shape future rollout feasibility, so they resemble an internal latent safety state. The paper nonetheless treats them as auxiliary controller-side variables rather than memory of past experience. This distinction is conceptually important: memory augmentation and state augmentation are related but not identical categories (Parwana et al., 8 Jun 2025).

A further optimization-theoretic analysis of MPPI as preconditioned gradient descent strengthens this picture. Because classical MPPI is a unit-step preconditioned gradient method on a free-energy objective, a plausible implication is that future memory-augmented variants can be formalized as changes to the proposal parameter $J_\tau(\mathbf{u}_{0:T-1})$04, the preconditioner $J_\tau(\mathbf{u}_{0:T-1})$05, the step size $J_\tau(\mathbf{u}_{0:T-1})$06, or the sampling covariance $J_\tau(\mathbf{u}_{0:T-1})$07, rather than as ad hoc additions to a rollout loop (Fazlyab et al., 25 Mar 2026).

6. Misconceptions, limitations, and open directions

A common misconception is that “memory-augmented MPPI” necessarily implies an external differentiable memory, retrieval-augmented transformer, or explicit episodic store. The literature does not support such a narrow usage. Standard MPPI already contains a minimal memory through reuse of the previous solution as the current proposal mean. Recent extensions then add explicit topological feature memory, replay-based plan memory, planner-prior memory, transformer-encoded historical regularities, or local sensitivity memory. The concept is therefore best treated as a family resemblance rather than a single architectural template (Honda, 11 Nov 2025, Zheng et al., 24 Sep 2025, Serra-Gomez et al., 5 Oct 2025, Zinage et al., 2024).

Several limitations recur across this family. Gaussian assumptions remain restrictive: PO-MPC explicitly notes that the true MPPI posterior—Gaussian proposal reweighted by exponentiated trajectory returns—is not generally Gaussian. The probabilistic-inference tutorial notes that finite-sample convergence is not guaranteed even for quadratic costs, and that sample complexity worsens as the optimal distribution sharpens. TransformerMPPI depends on training coverage and shows diminishing advantage as the sample count becomes very large. MA-MPPI itself notes limited generalization across similar-but-not-identical features, fairly local Euclidean memory, no advanced long-horizon memory management, and no multi-agent memory sharing (Serra-Gomez et al., 5 Oct 2025, Honda, 11 Nov 2025, Zinage et al., 2024, Zheng et al., 24 Sep 2025).

The distinction between persistent useful bias and stale misleading bias is another central issue. PO-MPC introduces a learned intermediate prior partly because planner distributions stored in replay become stale and induce high-variance updates if cloned directly. Soft MPCritic makes replayed action sequences useful by repeatedly refining and rewriting them under the current model and critic. Feedback-MPPI, by contrast, reuses only short-lived local gains, and its authors note that when hard constraints are implemented as indicator penalties the feedback law is effectively constraint unaware because the derivative is locally zero almost everywhere (Serra-Gomez et al., 5 Oct 2025, Banker et al., 1 Apr 2026, Belvedere et al., 17 Jun 2025).

Reasonable extrapolations in current papers point toward a richer future design space. PO-MPC explicitly proposes replacing a Gaussian adaptive prior with a richer memory-conditioned prior such as a mixture model or diffusion policy conditioned on retrieved past plans, using episodic retrieval from replay to form a state-conditional planner prior at test time, maintaining multiple planner memories to better represent a multimodal MPPI posterior, adapting $J_\tau(\mathbf{u}_{0:T-1})$08 based on uncertainty or memory confidence, and using planning trajectories themselves—not only first-step Gaussian summaries—as structured memory. From the optimization and inference perspectives, a plausible implication is that the most principled future memory-augmented MPPI systems will modify the prior $J_\tau(\mathbf{u}_{0:T-1})$09, the variational family $J_\tau(\mathbf{u}_{0:T-1})$10, the sampling covariance, or the free-energy geometry rather than merely attaching an unrelated memory module to an otherwise unchanged controller (Serra-Gomez et al., 5 Oct 2025, Fazlyab et al., 25 Mar 2026).

In this broader sense, memory-augmented MPPI is less a single algorithm than a technical program: turning MPPI from a short-horizon sampler driven only by its current proposal into a controller that reuses accumulated structure from prior optimization, prior failures, prior successes, or prior learning updates. The literature now contains both explicit formulations of that program and several neighboring methods that realize it only partially.