Pith. sign in

REVIEW 2 cited by

Information Theoretic Model Predictive Control: Theory and Applications to Autonomous Driving

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 1707.02342 v1 pith:XSTVF6FI submitted 2017-07-07 cs.RO

Information Theoretic Model Predictive Control: Theory and Applications to Autonomous Driving

classification cs.RO
keywords controlmodelpredictiveinformationtheoreticautonomousdrivingmethod
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present an information theoretic approach to stochastic optimal control problems that can be used to derive general sampling based optimization schemes. This new mathematical method is used to develop a sampling based model predictive control algorithm. We apply this information theoretic model predictive control (IT-MPC) scheme to the task of aggressive autonomous driving around a dirt test track, and compare its performance to a model predictive control version of the cross-entropy method.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Adapting Generalist Vehicle Models for High-Speed MPC Across Terrains

    cs.RO 2026-07 conditional novelty 6.0

    History-conditioned fine-tuning with targeted synthetic rollouts from a per-terrain bicycle model roughly halves 6 m/s trajectory tracking error against a fine-tuned AnyCar baseline.

  2. Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing

    cs.LG 2026-05 unverdicted novelty 6.0

    Recasts sampling-based nonconvex optimization as smoothed gradient descent to obtain non-asymptotic convergence guarantees and introduces the DIDA annealed algorithm that converges to the global optimum.