Pith. sign in

REVIEW 1 cited by

AC4MPC: Actor-Critic Reinforcement Learning for Nonlinear Model Predictive Control

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 2406.03995 v1 pith:V3NRYKQP submitted 2024-06-06 eess.SY cs.AIcs.SY

classification eess.SYcs.AIcs.SY
keywords controlactorcriticusedactor-critichorizoninitialinitialization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

\Ac{MPC} and \ac{RL} are two powerful control strategies with, arguably, complementary advantages. In this work, we show how actor-critic \ac{RL} techniques can be leveraged to improve the performance of \ac{MPC}. The \ac{RL} critic is used as an approximation of the optimal value function, and an actor roll-out provides an initial guess for primal variables of the \ac{MPC}. A parallel control architecture is proposed where each \ac{MPC} instance is solved twice for different initial guesses. Besides the actor roll-out initialization, a shifted initialization from the previous solution is used. Thereafter, the actor and the critic are again used to approximately evaluate the infinite horizon cost of these trajectories. The control actions from the lowest-cost trajectory are applied to the system at each time step. We establish that the proposed algorithm is guaranteed to outperform the original \ac{RL} policy plus an error term that depends on the accuracy of the critic and decays with the horizon length of the \ac{MPC} formulation. Moreover, we do not require globally optimal solutions for these guarantees to hold. The approach is demonstrated on an illustrative toy example and an \ac{AD} overtaking scenario.

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. Reference-Free Iterative Learning Model Predictive Control with Neural Certificates

    eess.SY 2025-07 conditional novelty 6.0 of 10

    Reference-free iterative MPC replaces mixed-integer terminal constraints with a learned neural CLBF terminal set and cost, giving conditional recursive feasibility, stability, and non-increasing cost over iterations.

Pith tools