Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2403.07707 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911570264588288 |
|---|---|
| author | Vila, Eduardo M. G. Kerrigan, Eric C. Bruce, Paul |
| author_facet | Vila, Eduardo M. G. Kerrigan, Eric C. Bruce, Paul |
| contents | This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality constraints, but also allows for a lower cost in comparison with non-flexible discretizations. Two examples are provided to demonstrate the feasibility of the proposed method to solve optimal control problems. Solutions to the example problems exhibited up to a tenfold reduction in relative cost. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_07707 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems Vila, Eduardo M. G. Kerrigan, Eric C. Bruce, Paul Optimization and Control Systems and Control This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality constraints, but also allows for a lower cost in comparison with non-flexible discretizations. Two examples are provided to demonstrate the feasibility of the proposed method to solve optimal control problems. Solutions to the example problems exhibited up to a tenfold reduction in relative cost. |
| title | Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2403.07707 |