Pith. sign in

REVIEW 1 cited by

CoVO-MPC: Theoretical Analysis of Sampling-based MPC and Optimal Covariance Design

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.07369 v1 pith:XVQRWPWM submitted 2024-01-14 cs.LG cs.RO

classification cs.LGcs.RO
keywords convergencecovo-mpcsampling-basedanalysiscontrolmppitheoreticalcovariance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sampling-based Model Predictive Control (MPC) has been a practical and effective approach in many domains, notably model-based reinforcement learning, thanks to its flexibility and parallelizability. Despite its appealing empirical performance, the theoretical understanding, particularly in terms of convergence analysis and hyperparameter tuning, remains absent. In this paper, we characterize the convergence property of a widely used sampling-based MPC method, Model Predictive Path Integral Control (MPPI). We show that MPPI enjoys at least linear convergence rates when the optimization is quadratic, which covers time-varying LQR systems. We then extend to more general nonlinear systems. Our theoretical analysis directly leads to a novel sampling-based MPC algorithm, CoVariance-Optimal MPC (CoVo-MPC) that optimally schedules the sampling covariance to optimize the convergence rate. Empirically, CoVo-MPC significantly outperforms standard MPPI by 43-54% in both simulations and real-world quadrotor agile control tasks. Videos and Appendices are available at \url{https://lecar-lab.github.io/CoVO-MPC/}.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Continual Learning and Lifting of Koopman Dynamics for Linear Control of Legged Robots

    cs.RO 2024-11 conditional novelty 6.0 of 10

    An incremental Koopman algorithm that grows both dataset and latent dimension enables linear-MPC walking on five simulated legged robots, but its monotonic convergence theorem assumes the learned embedding is already ...

Pith tools