---
title: Receding-Horizon Planner
url: https://www.emergentmind.com/topics/receding-horizon-planner
type: topic
---

# Receding-Horizon Planner

A receding-horizon planner is an optimization-based control or planning strategy in which, at each decision epoch, an optimal plan or action sequence is computed over a finite prediction window into the future. Only the first part of this solution is implemented, after which the process is repeated using updated state estimates and potentially refined predictions. This framework, which underpins Model Predictive Control (MPC) and related online planning methods, is foundational in robotics, autonomous systems, transportation, energy scheduling, and multi-agent domains, providing a principled means to realize robust, adaptive, and constraint-aware behavior.

## 1. Core Principles of Receding-Horizon Planning

At the heart of receding-horizon planning is the repeated solution of an optimal control or planning problem over a finite horizon that "recedes" forward in time as feedback is obtained. At each time $t$, the system state is measured or estimated, and a finite-horizon optimal control problem is solved:
\[
\min_{u_{t:t+H-1}} \sum_{k=0}^{H-1} \ell(x_{t+k}, u_{t+k}) + V_{\text{term}}(x_{t+H})
\]
subject to system dynamics $x_{t+k+1} = f(x_{t+k},u_{t+k})$, and any physical, safety, or task-specific constraints. Only the control $u_t$ (or a short segment) is executed, then the system advances to $x_{t+1}$ and replanning occurs with the new state [1912.05259], [2103.12968], [2108.11170], [2411.15651].

Key structural features are:
- **Rolling window**: Only a short future span is optimized and implemented.
- **Feedback incorporation**: Measurements or predictions update the problem at each receding step.
- **Constraint handling**: Input, state, and task constraints (e.g., safety, logical objectives) can be embedded directly.

## 2. Algorithmic Formulations and Implementation Variants

Receding-horizon planners admit several algorithmic instantiations, varying in their treatment of dynamics, objectives, and constraints:

- **Classical MPC**: Continuous or discrete-time optimal control with quadratic or more general stage/terminal costs; efficient solvers for linear systems, more sophisticated for nonlinear/hybrid cases [1912.05259], [2108.11170].
- **Chance-constrained or stochastic MPC**: Incorporates probabilistic safety, e.g., collision avoidance under motion or sensing uncertainty using velocity obstacle-based chance constraints, which can be reduced to tractable deterministic forms [2103.12968].
- **Trajectorial/graph-based planners**: Discrete graph generation within a rolling local neighborhood, supporting multi-objective (e.g., lexicographic) optimization over risk, comfort, and cost [2007.08362].
- **Sampling/tree-based approaches**: Tree search (e.g., UCT, CEM) within the receding window, with entire tree reuse for efficiency and improved sample complexity [2411.15651].
- **Task and motion planning (TAMP) hybrids**: Receding-horizon decomposition of combinatorial symbolic-geometric problems, yielding tractable subproblems over sliding windows of actions [2009.03139], [2110.03420].
- **Multi-agent distributed algorithms**: Each agent solves its own receding-horizon problem, potentially with fairness- or safety-related consensus constraints solved via distributed optimization methods [2508.14381].

This diversity is reflected in domain-specific instantiations, from manipulation in cluttered environments using learned value heuristics [1803.08100], to fair resource scheduling in transportation systems under stochastic uncertainties [2408.04087].

## 3. Performance Guarantees and Theoretical Properties

Receding-horizon planners can offer strong guarantees when problem structure and constraint formulations are appropriate:

- **Recursive feasibility**: Provided the initial plan is feasible and terminal constraints are properly designed, the rolling process preserves feasibility at each step [1912.05259], [2108.11170], [2007.12123].
- **Stability and convergence**: Terminal cost/constraint design ensures Lyapunov descent or cost monotonicity, establishing convergence to desired equilibria or finite-time termination [1912.05259], [2108.11170].
- **Safety and persistent feasibility**: RTD [1809.06746] guarantees, through offline reachability analysis, that a safe trajectory or braking maneuver is always available under bounded disturbances and sensing limitations.
- **Regret or risk bounds**: Under uncertainty, planner design (e.g., UCB-bandit methods) yields no-regret asymptotics and bounded online performance relative to an oracle [1609.05162].
- **Fairness or multi-objective optimality**: Lexicographic MPC and distributed schemes accommodate strict priority orderings and resource equity, with explicit optimality or group-level variance constraints [2007.08362], [2508.14381], [2212.03323].

However, theoretical guarantees depend sensitively on accurate model knowledge, the choice of horizon length, constraint tightening, and problem regularity.

## 4. Application Domains and Representative Case Studies

Receding-horizon planners are prominent across domains including:

| Application Domain                         | Core References        |  Key Features                      |
|--------------------------------------------|------------------------|-------------------------------------|
| Multi-agent and multi-vehicle planning     | [2103.12968], [2508.14381] | Chance constraints, distributed fairness, collision avoidance            |
| Autonomous ground/aerial robots            | [1912.05259], [2206.01895], [2204.03134], [1809.06746] | Nonlinear dynamics, perception constraints, reachability-based safety     |
| Manipulation in dynamic or cluttered scenes| [1803.08100], [2306.04732], [2009.03139], [2110.03420] | Online reactivity, learned or relaxed value approximations for hybrid tasks|
| Scheduling and resource/energy management  | [2408.04087]           | Hierarchical MILP, stochastic receding-horizon re-planning               |
| Rule/logic-constrained planning            | [2212.03323], [2007.12123] | Rank/differentiable reward preservation, LTL/hard-soft constraint integration|
| Hybrid and self-adaptive systems           | [2108.11170]           | Meta-self-aware hybrid receding-horizon policy switching                 |

For example, in multi-robot systems, distributed receding-horizon fairness planners coordinate energy/resource usage while ensuring safety via barrier function controllers, maintaining real-time feasibility with scaling up to 50 agents [2508.14381]. In manipulation tasks with dynamic uncertainties, receding-horizon planners leveraging learned value functions achieve robust goal accomplishment and adaptivity in both simulation and real-robot settings [1803.08100], [2306.04732].

## 5. Extensions: Stochasticity, Fairness, and Hybrid Constraints

Significant advances expand receding-horizon principles to richer settings:

- **Stochastic uncertainty**: Gaussian process modeling of latent dynamics, chance-constrained RHP, and no-regret UCB strategies provide sample-efficient exploration-exploitation and risk control in highly uncertain environments [1609.05162], [2103.12968].
- **Fairness objectives**: Recent distributed RHPs explicitly optimize energy or resource variance across agents, often via new consensus-type solvers or penalty terms in horizon-based optimization [2508.14381].
- **Multi-objective/lexicographic priorities**: Rule hierarchies [2212.03323] and lex-MPC [2007.08362] systematically prioritize safety, regulatory, comfort, and efficiency goals—moving beyond weighted-sum cost structures.
- **Hybrid symbolic-geometric planning**: TAMP methods recast long-horizon, combinatorially complex problems into sequences of receding-horizon geometric subproblems, sometimes aided by problem-specific geometric heuristics or neural value approximators [2009.03139], [2110.03420], [2306.04732].
- **Perception coupling**: RHP frameworks account for estimation quality in perception-constrained settings, explicitly optimizing for VIO accuracy or safe tracking in unstructured/feature-sparse environments [2204.03134].

These extensions position receding-horizon methods as flexible substrates accommodating real-world complexity, including dynamics, logical tasks, sensor/process noise, and team-level performance trade-offs.

## 6. Computational Considerations and Empirical Performance

Practical deployment of receding-horizon planners leverages methodological innovations for computational tractability and real-time responsiveness:

- **Problem decomposition**: Hierarchical two-stage frameworks (e.g., static reference + rolling local optimization) [2408.04087], system decomposition for reachability [1809.06746], and symbolic-geometry hierarchy [2110.03420] reduce problem size per cycle.
- **Tree/sample reuse**: Model Predictive Trees (MPT) preserve not just the best last plan but entire subtrees for reuse, yielding a 10–20$\times$ reduction in sample complexity relative to parametric hotstarts [2411.15651].
- **Warm-start and parallelism**: Solvers warm-started with previous horizon solutions or nominal plans achieve per-cycle times of 10–300 ms in settings with up to 50 agents or long manipulation sequences [1912.05259], [2508.14381], [2110.03420].
- **Closed-form and learning-based surrogates**: Minimum-jerk or minimum-snap closed-form generation [2206.01895], [2204.03134], and neural oracle value approximators for horizon terminal cost [2306.04732] enable considerable computational gains (up to 98% online horizon-convergence for humanoid RHP).
- **Real-world validation**: Receding-horizon planners achieve robust execution in fielded mobile robots, industrial disassembly/collaboration, and adversarial or unpredictable context, with demonstrations of strict safety, high mission-completion, and improved resource use [2206.01895], [2508.14381], [2007.02981], [1809.06746].

A pervasive theme is the tradeoff between horizon length (and model fidelity) and computational delay: short horizons give fast but potentially myopic plans; longer horizons improve performance but risk solve-time overruns and constraint violation in dynamic settings [1912.05259], [2306.04732], [2007.03139].

## 7. Open Problems and Research Directions

Several research frontiers persist:

- **Unifying multi-scale objectives**: Integrating continuous control, discrete task logic, temporal logic, and resource/fairness constraints into a single receding-horizon optimization remains challenging; recent advances in differentiable/relaxable representations show promise [2212.03323], [2007.12123].
- **Sample efficiency and learning**: Efficient model/data reuse within and across horizon cycles, including contraction-theoretic error accounting and data-driven oracles, can further close the gap to global or long-horizon optimality [2411.15651], [2306.04732].
- **Scalability to large teams or tasks**: Distributed or consensus-based solvers scalable to tens or hundreds of agents with fairness, safety, and dynamic adaptability are an active development [2508.14381].
- **Robustness guarantees under deep uncertainty**: Online adaptation to exogenous disturbances, nonstationary or adversarial environments, and real-time safety are increasingly explored via robust RHP, chance constraints, and reachability-based certificates [2103.12968], [1809.06746], [1609.05162].
- **Perception and task-in-the-loop planning**: Incorporating high-level perception and task planning (including hybrid planning meta-self-awareness) into the receding-horizon loop remains an open and fertile research domain [2204.03134], [2108.11170].

Ongoing work seeks to unify these advances within common computational and theoretical frameworks, supporting rapidly reconfigurable, safe, and mission-optimal behavior in complex, uncertain, and collaborative settings.

Source: https://www.emergentmind.com/topics/receding-horizon-planner