The paper introduces SD‑DPC, a method that learns sparse, interpretable feedback policies for nonlinear systems using data. It first identifies a prediction model via rollout‑based sparse identification of nonlinear dynamics (SINDy), then parameterizes the policy as a sparse combination of dictionary functions and trains it by differentiating a constrained finite‑horizon predictive‑control objective. The resulting explicit feedback law contains only a few terms, satisfies constraints across three benchmark problems, outperforms a distilled policy by up to an order of magnitude, and requires far less memory and online computation than an optimization benchmark while providing explicit sensitivity bounds.
arXiv:2607. 15077v1 Announce Type: new Abstract: Many engineering problems involve phenomena whose governing equations are poorly characterized or only partially known.
arXiv:2606. 23827v1 Announce Type: cross Abstract: A data-driven method is developed for approximating value functions in deterministic optimal control problems with nonlinear control-affine dynamics.
The paper presents a scalable learned iterative solver for nonlinear model predictive control (NMPC) that removes dependence on the prediction horizon by exploiting temporal decomposition in the network architecture. It introduces a closed‑loop resampling strategy to align training with deployment, achieving up to four‑fold speedups over IPOPT while maintaining comparable control performance and avoiding constraint violations. The method outperforms the previous monolithic LISCO approach on a CSTR cascade benchmark, scaling to larger problems without increasing network size.
arXiv:2605. 04568v3 Announce Type: replace-cross Abstract: State-of-the-art model-based Reinforcement Learning (RL) approaches either use gradient-free, population-based methods for planning, learned policy networks, or a combination of policy networks and planning.
arXiv:2607. 16177v1 Announce Type: new Abstract: Reinforcement learning (RL) has recently emerged as a promising feedback control strategy for nonlinear and complex dynamical systems.
Scenario-based model predictive control (SBMPC) is a variant of model predictive control (MPC) that explicitly accounts for uncertainty by optimizing control actions over multiple predicted scenarios. However, its computational complexity increases rapidly with the number of scenarios and prediction horizon, limiting is applicability to real-time planning and control.
arXiv:2607. 12775v1 Announce Type: cross Abstract: Scenario-based model predictive control (SBMPC) is a variant of model predictive control (MPC) that explicitly accounts for uncertainty by optimizing control actions over multiple predicted scenarios.
arXiv:2507.06625v4 Announce Type: replace-cross Abstract: Model Predictive Control (MPC) enables reliable trajectory optimization under dynamics constraints, but often depends on accurate dynamics mo...
arXiv:2606. 24039v1 Announce Type: cross Abstract: Robotics increasingly relies on GPUs for parallel simulation, large-scale learning, and neural-network inference.
arXiv:2608. 12063v1 Announce Type: cross Abstract: Integrating locomotion and manipulation is essential for robot autonomy, but scaling standard Reinforcement Learning (RL) to complex tasks is severely bottlenecked by the slow, manual process of dense reward shaping.
arXiv:2608.22595v1 Announce Type: new Abstract: We develop a new framework for flexible, nonlinear, and interpretable off-policy evaluation for infinite-horizon reinforcement learning. To handle larg...
Integrating locomotion and manipulation is essential for robot autonomy, but scaling standard Reinforcement Learning (RL) to complex tasks is severely bottlenecked by the slow, manual process of dense reward shaping. To bypass this limitation, we leverage Sample-based Model Predictive Control (SMPC) entirely in simulation as an automated, rapidly tunable expert to generate massive offline datasets.