Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 73 tok/s
Gemini 2.5 Pro 57 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 94 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4.5 33 tok/s Pro
2000 character limit reached

Solve the General Constrained Optimal Control Problem with Common Integration Method (1802.02140v3)

Published 6 Feb 2018 in cs.SY, math.OC, and eess.SY

Abstract: Computation of general state- and/or control-constrained Optimal Control Problems (OCPs) is difficult for various constraints, especially the intractable path constraint. For such problems, the theoretical convergence of numerical algorithms is usually not guaranteed, and the right solution may not be successfully obtained. With the recently proposed Variation Evolving Method (VEM), the evolution equations, which guarantee the convergence towards the optimal solution in theory even for the general constrained OCPs, are derived. In particular, the costate-free optimality conditions are established. Besides the analytic expressions of the costates and the Lagrange multipliers adjoining the terminal constraint, the integral equation that determines the Karush-Kuhn-Tucker (KKT) multiplier variable is also derived. Upon the work in this paper, the general constrained OCPs may be transformed to the Initial-value Problems (IVPs) to be solved, with common Ordinary Differential Equation (ODE) numerical integration methods.

Citations (3)

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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