An Improved Data Augmentation Scheme for Model Predictive Control Policy Approximation

Dinesh Krishnamoorthy
3/9/2023
eess.SYcs.LGmath.OC

No confident code implementation found for this paper.

Abstract

This paper considers the problem of data generation for MPC policy approximation. Learning an approximate MPC policy from expert demonstrations requires a large data set consisting of optimal state-action pairs, sampled across the feasible state space. Yet, the key challenge of efficiently generating the training samples has not been studied widely. Recently, a sensitivity-based data augmentation framework for MPC policy approximation was proposed, where the parametric sensitivities are exploited to cheaply generate several additional samples from a single offline MPC computation. The error due to augmenting the training data set with inexact samples was shown to increase with the size of the neighborhood around each sample used for data augmentation. Building upon this work, this letter paper presents an improved data augmentation scheme based on predictor-corrector steps that enforces a user-defined level of accuracy, and shows that the error bound of the augmented samples are independent of the size of the neighborhood used for data augmentation.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{krishnamoorthy2023improved,
  title  = {An Improved Data Augmentation Scheme for Model Predictive Control Policy Approximation},
  author = {Dinesh Krishnamoorthy},
  year   = {2023},
  eprint = {2303.05607},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.05607v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.05607.svg)](https://codeofpaper.com/paper/2303.05607)

Discussion