pith. sign in

Title resolution pending

If(x,u)is feasible andx ′ =f(x,u), then(x 0,u)is feasible for allx 0 ∈B x, r(x′) , where: r(x′)≜ R− ∥x ′∥ Lf ≤ dist(x′, ∂X) Lf (16) 14 DATA-DRIVEN ACCELERATION OFMPC Appendix B

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

eess.SY 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Data-driven Acceleration of MPC with Guarantees

eess.SY · 2025-11-17 · conditional · novelty 7.0

A nonparametric policy constructed from offline MPC solutions accelerates control by orders of magnitude while preserving recursive feasibility and bounded optimality gap under sufficient data coverage.

citing papers explorer

Showing 1 of 1 citing paper.

  • Data-driven Acceleration of MPC with Guarantees eess.SY · 2025-11-17 · conditional · none · ref 2

    A nonparametric policy constructed from offline MPC solutions accelerates control by orders of magnitude while preserving recursive feasibility and bounded optimality gap under sufficient data coverage.