Abstract
not necessarily linear optimal control problem can be reformulated as an infinite dimensional linear problem where the variables are the moments of the “occupation measures” which encode optimal trajectories and controls. We propose a linear programming hierarchy of problems that allow us to compute the moments of these measures efficiently. Furthermore, we show how to recover trajectories and controls from the moments by using some new polynomial approximations to Dirac deltas. The results are illustrated through computational simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
