Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hybrid MPC Local Planner

Updated 3 July 2026
  • Hybrid MPC Local Planner is a planning approach that integrates continuous model predictive control with discrete decision elements to handle nonconvex, nonholonomic constraints.
  • It uses a hierarchical framework combining global path planning with local MPC-based tracking to ensure real-time feasibility, safety, and robust mode switching.
  • Applications in autonomous robotics and vehicles demonstrate sub-second planning, precise trajectory tracking, and effective collision avoidance in dynamic environments.

A Hybrid MPC Local Planner combines model predictive control (MPC) with discrete, logical, or combinatorial elements to address local trajectory optimization under non-convex, nonholonomic, and real-time constraints typical of autonomous robotics, advanced manipulation, and intelligent vehicle systems. In contemporary research, this encompasses hierarchical frameworks integrating sampling-based global planners, piecewise or contact-mode hybrid dynamics, mode scheduling via machine learning, as well as mixed-integer or operator-splitting algorithms for nonconvex constrained optimization, ensuring feasibility, robustness, and fast reaction in dynamic, uncertain environments.

1. Problem Definition and Architectures

Hybrid MPC Local Planners are designed for online receding-horizon trajectory optimization of agents in environments characterized by nonconvex constraints (e.g., obstacles), nonholonomic or hybrid vehicle/robot dynamics, and time-varying obstacles. The "hybrid" aspect arises from an overview of:

The overall objective is real-time, robust, and constraint-satisfying execution in cluttered, structured, or shared spaces, including situations demanding highly adaptive or multi-modal behavior.

2. Modeling: System Dynamics and Hybrid Constraints

Hybrid MPC systems require formulated models capturing both the continuous and discrete elements of the local planning problem:

  • Non-holonomic Kinematics: Discrete-time bicycle or unicycle models parameterize vehicle dynamics, with hard bounds on velocity and steering (Bojadžić et al., 2021, Lu et al., 2024, Li et al., 2024).
  • Piecewise-Affine (PWA)/Hybrid Dynamics: For systems with contacts, frictional transitions, or region-dependent physics (e.g., vehicle race car models with multiple tire saturation regimes (Frick et al., 2016, Gharavi et al., 2023)), the state-update equation is piecewise on regions of the state-control space, leading to non-smooth system evolution.
  • Contact Modes and Logical Modes: In manipulation and legged/aerial-ground robots, mode switches (e.g., stick/slip in pushing (Hogan et al., 2017), flight/ground transitions (Mustafa et al., 2024)) introduce discrete variables linked to system evolution or constraint enforcement.
  • Obstacle Constraints: Obstacle spaces are represented as unions of convex (polytope, zonotope) regions or occupancy grids, sometimes encoded using tight hybrid zonotope relaxations for integer selection (Robbins et al., 2024). Dynamic obstacles generally require time-indexed regions or predictions (Bojadžić et al., 2021, Derajić et al., 5 Aug 2025).
  • Hybrid Terminal/Safety Sets: Learning-based terminal constraints derived from reachability or data (e.g., neural approximation to Hamilton–Jacobi value functions (Derajić et al., 5 Aug 2025)) are used to guarantee recursive feasibility in dynamic scenes.

3. Core Hybrid MPC Optimization and Solution Strategies

The structure of the local planning optimization problem is problem-class-dependent but characterized by:

  • Cost Structure: Combined stage and terminal cost penalizing deviation from reference, control effort, proximity to obstacles, map occupancy, and sometimes explicit mode transitions (Bojadžić et al., 2021, Robbins et al., 2024).
  • Constraints: Hard bounds on controls/states, nonholonomic constraints, full-body collision avoidance (linearized over the prediction horizon (Lu et al., 2024)), region or polytope membership (one-hot integer selection (Robbins et al., 2024)), mode-switch logic (binaries for contact/locomotion mode), and recursively feasible terminal sets.
  • Optimization Formulations:
  • Online/Offline Decomposition: For problems with combinatorial complexity (e.g., frictional mode schedules (Hogan et al., 2017)), mode assignment is performed offline via optimal control and classifier learning; the online planner then solves the continuous QP with fixed mode schedule, achieving real-time rates.

4. Hierarchical and Hybrid Integration Schemes

A distinguishing feature of modern Hybrid MPC local planners is hierarchical or meta-level integration of diverse planning components:

  • Hierarchical Planning: A global discrete planner (e.g., nonholonomic RRT, hybrid A*, Informed-TRRT*) computes a curvature- and vehicle-constrained reference path. The path is tracked locally via nonlinear or linearized MPC, which may be further warm-started for computational speed (Lu et al., 2024, Choi et al., 8 Mar 2025).
  • Meta/Fusion Architectures: Approaches fuse or switch between MPC-style and reactive or learning-based controllers -- e.g., DWA and RL policy switching via costmap clearance heuristics (Sharma et al., 2024); mutual information-based blending of MPC and Pure Pursuit for robust, adaptive path following (Choi et al., 8 Mar 2025).
  • Mode-Switching and Multi-modal Integration: For agents with multiple mobility modes (legs/flight (Mustafa et al., 2024)), global planners explicitly search over a mixed-mode graph, triggering local MPC or mode-specific controllers as indicated by the current reference.
  • Learning-Based Guidance and Constraint Satisfaction: Hybrid planners may employ learning-based initializations for sampling-based MPC (Mizuta et al., 2 Aug 2025) or neural value function surrogates as terminal constraints (Derajić et al., 5 Aug 2025), with online adaptation via information exchange between generations.

5. Computational Methods and Real-Time Performance

Ensuring real-time feasibility is a key design constraint for Hybrid MPC local planners in embedded or resource-constrained robotic systems:

  • Operator Splitting/Projection: Fast fixed-point iterations over consensus QPs, exploiting union-of-polytopes structure, enable millisecond solves with only sparse linear algebra and local polytope projections, providing local optimality and convergence guarantees (Frick et al., 2016).
  • Branch-and-Bound MIQP Solvers: Specialized interior point and block-diagonal factorizations exploit hybrid zonotope structures, pruning the branch-and-bound tree with reachability analysis, and warming QP solves, thereby achieving sub-second solve times for moderately complex maps (Robbins et al., 2024).
  • Warm Starting and Linearization: Linearized MPC (warm-starting the nonlinear MPC backend), analytic Jacobians, and receding-horizon shifting of optimal sequences are standard for reducing per-step computation (Bojadžić et al., 2021, Lu et al., 2024).
  • Classifier-guided Convexification: By committing to a mode schedule predicted offline, hybrid planners reduce online optimization to a convex QP (Hogan et al., 2017).
  • Learning-based Surrogates: Online neural inference (hypernetwork plus MLP) for safe terminal sets incurs negligible overhead compared to solving the main MPC NLP (Derajić et al., 5 Aug 2025).

Reported solution times range from 3–5 ms for convex QPs with learned mode schedules (Hogan et al., 2017), 80–150 ms for full nonlinear MPC with analytic Jacobians (Bojadžić et al., 2021), to 0.01–0.15 s for hybrid-zonotope MIQP with warm start (Robbins et al., 2024). Pure learning-based guidance plus sampling-based refinement (CFM+MPPI) achieves 0.08 s per cycle with improved constraint satisfaction (Mizuta et al., 2 Aug 2025).

6. Applications, Performance, and Limitations

Hybrid MPC local planners have demonstrated state-of-the-art performance in a spectrum of real and simulated environments:

  • Shared spaces and dynamic real-world operations: Autonomous three-wheeled rickshaw, tracking a 150 m path while avoiding moving agents, achieves sub-0.3 m RMS tracking error and real-time replanning at 5 Hz (Bojadžić et al., 2021).
  • Agricultural field robots: Hybrid A* with hierarchical MPC ensures curvature, body safety, and minimal reference deviation (<0.2 m), handling real-time online replanning with success rates ≥ 97.4% (Lu et al., 2024).
  • Multi-modal robots: Seamless ground-air mode switching with sub-centimeter tracking error using bi-modal A* and MPC path follower (Mustafa et al., 2024).
  • Planar object manipulation: Convex hybrid MPC with learned mode schedules provides millimeter precision and strong disturbance rejection at 200 Hz in multi-contact manipulation (Hogan et al., 2017).
  • Automotive evasive maneuvers: MILP-based hybrid MPC matches NMPC accuracy (<10% deviation), recovers faster under friction perturbation, and executes in 0.2–0.4 s at 20 Hz, outperforming NLP solvers by over an order of magnitude (Gharavi et al., 2023).
  • Real-time collision avoidance: Learning-based terminal constraints (RNTC-MPC) achieve 100% success and fastest solve time (∼4 ms per iteration) in hardware obstacle avoidance (Derajić et al., 5 Aug 2025).
  • Meta-reasoning in navigation stacks: Clearance-based switching yields a 26% reduction in navigation time versus pure RL or classical local planning, with zero collisions in all tested dynamic scenarios (Sharma et al., 2024).

Common limitations include scalability to high-dimensional or rapidly varying environments (e.g., the curse of dimensionality in reachability computations (Derajić et al., 5 Aug 2025)), static map assumptions in some MIQP approaches (Robbins et al., 2024), and performance degradation with naive linearization under large disturbances (Lu et al., 2024). Challenge remains in robustifying against sensory uncertainty, modeling drift, and extending planning-horizon and map complexity without loss of real-time performance.

7. Research Directions and Comparative Insights

Contemporary research in Hybrid MPC Local Planners exhibits several convergent trends:

  • Integration of learning and optimization: Reward-guided sampling and deep flow models provide diverse candidate solutions, which are then refined and safety-filtered using constrained MPC or MPPI, allowing both multimodality and constraint satisfaction (Mizuta et al., 2 Aug 2025, Derajić et al., 5 Aug 2025).
  • Exploiting problem structure: Hybrid zonotopes, block-diagonalization, and operator-splitting capitalize on geometric and algebraic properties of region unions and PWA dynamics, achieving computational efficiency and tight relaxations (Robbins et al., 2024, Frick et al., 2016).
  • Meta-planning and information fusion: Real-time switching or blending between fast, reactive, and global-constraint-enforcing modules via observed state, mutual information, or learned switching policies (Choi et al., 8 Mar 2025, Sharma et al., 2024).
  • Hybridization for robustness: Approximating nonlinear vehicle or manipulation physics via MMPS or polytopic models delivers robust tracking and fast adaptation under disturbance or model error (Gharavi et al., 2023, Hogan et al., 2017).
  • Safety via conservative learning: Neural value function surrogates preserve the conservatism of analytic signed distance functions, ensuring at least as safe constraint enforcement (Derajić et al., 5 Aug 2025).

Ongoing challenges include tractable real-time planning under moving obstacles with unmodeled dynamics, integration of chance-constrained or robust optimization, scaling to higher-dimensional robotic manipulators, and closing the gap between learning-based multimodal generation and formal constraint satisfaction.

Selected Key References:

Topic to Video (Beta)

No one has generated a video about this topic yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Sign Up to Generate

Follow Topic

Get notified by email when new papers are published related to Hybrid MPC Local Planner.

Sign Up to Follow Topic by Email