A novel trajectory optimization algorithm for continuous-time model predictive control
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916102344278016 |
|---|---|
| author | Das, Souvik Ganguly, Siddhartha Anjali, Muthyala Chatterjee, Debasish |
| author_facet | Das, Souvik Ganguly, Siddhartha Anjali, Muthyala Chatterjee, Debasish |
| contents | This article introduces a numerical algorithm that serves as a preliminary step toward solving continuous-time model predictive control (MPC) problems directly without explicit time-discretization. The chief ingredients of the underlying optimal control problem (OCP) are a linear time-invariant system, quadratic instantaneous and terminal cost functions, and convex path constraints. The thrust of the method involves finitely parameterizing the admissible space of control trajectories and solving the OCP satisfying the given constraints at every time instant in a tractable manner without explicit time-discretization. The ensuing OCP turns out to be a convex semi-infinite program (SIP), and some recently developed results are employed to obtain an optimal solution to this convex SIP. Numerical illustrations on some benchmark models are included to show the efficacy of the algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_07107 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A novel trajectory optimization algorithm for continuous-time model predictive control Das, Souvik Ganguly, Siddhartha Anjali, Muthyala Chatterjee, Debasish Optimization and Control Systems and Control This article introduces a numerical algorithm that serves as a preliminary step toward solving continuous-time model predictive control (MPC) problems directly without explicit time-discretization. The chief ingredients of the underlying optimal control problem (OCP) are a linear time-invariant system, quadratic instantaneous and terminal cost functions, and convex path constraints. The thrust of the method involves finitely parameterizing the admissible space of control trajectories and solving the OCP satisfying the given constraints at every time instant in a tractable manner without explicit time-discretization. The ensuing OCP turns out to be a convex semi-infinite program (SIP), and some recently developed results are employed to obtain an optimal solution to this convex SIP. Numerical illustrations on some benchmark models are included to show the efficacy of the algorithm. |
| title | A novel trajectory optimization algorithm for continuous-time model predictive control |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2306.07107 |