Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 14 tok/s Pro
GPT-5 High 14 tok/s Pro
GPT-4o 90 tok/s Pro
Kimi K2 179 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Mesh Refinement with Early Termination for Dynamic Feasibility Problems (2403.07811v1)

Published 12 Mar 2024 in math.OC, cs.SY, and eess.SY

Abstract: We propose a novel early-terminating mesh refinement strategy using an integrated residual method to solve dynamic feasibility problems. As a generalization of direct collocation, the integrated residual method is used to approximate an infinite-dimensional problem into a sequence of finite-dimensional optimization subproblems. Each subproblem in the sequence is a finer approximation of the previous. It is shown that these subproblems need not be solved to a high precision; instead, an early termination procedure can determine when mesh refinement should be performed. The new refinement strategy, applied to an inverted pendulum swing-up problem, outperforms a conventional refinement method by up to a factor of three in function evaluations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (15)
  1. Barycentric Lagrange Interpolation. SIAM Review, 46(3), 501–517.
  2. Bertsekas, D.P. (1982). Projected Newton Methods for Optimization Problems with Simple Constraints. SIAM Journal on Control and Optimization, 20(2), 221–246. Publisher: Society for Industrial and Applied Mathematics.
  3. Betts, J.T. (2020). Practical methods for optimal control using nonlinear programming. Number 36 in Advances in design and control. Society for Industrial and Applied Mathematics, Philadelphia, third edition edition.
  4. Mesh refinement in direct transcription methods for optimal control. Optimal Control Applications and Methods, 19(1), 1–21.
  5. Projected-Search Methods for Bound-Constrained Optimization. arXiv:2110.08359 [math].
  6. Kelly, M. (2017). An Introduction to Trajectory Optimization: How to Do Your Own Direct Collocation. SIAM Review, 59(4), 849–904.
  7. An Integral Penalty-Barrier Direct Transcription Method for Optimal Control. In 2020 59th IEEE Conference on Decision and Control (CDC), 456–463.
  8. Solving dynamic optimization problems to a specified accuracy: An alternating approach using integrated residuals. IEEE Transactions on Automatic Control, 68(1), 548–555.
  9. Solving optimal control problems with non-smooth solutions using an integrated residual method and flexible mesh. In 2022 IEEE 61st Conference on Decision and Control (CDC), 1211–1216.
  10. A ph mesh refinement method for optimal control. Optimal Control Applications and Methods, 36(4), 398–421.
  11. Polak, E. (1993). On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems. Mathematical Programming, 62(1-3), 385–414.
  12. Polak, E. (1997). Optimization Algorithms and Consistent Approximations, volume 124 of Applied Mathematical Sciences. Springer New York.
  13. Family of Projected Descent Methods for Optimization Problems with Simple Bounds. Journal of Optimization Theory and Applications, 92(1), 1–31.
  14. Trefethen, L.N. (2000). Spectral Methods in MATLAB. Software, Environments, and Tools. Society for Industrial and Applied Mathematics.
  15. Trefethen, L.N. (2008). Is Gauss Quadrature Better than Clenshaw–Curtis? SIAM Review, 50(1), 67–87.
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.