Optimal Tracking in Switched Systems With Free Final Time and Fixed Mode Sequence Using Approximate Dynamic Programming

Authors

Tohid Sardarmehni, The University of Texas Rio Grande Valley
Xingyong Song, Texas A&M University

Document Type

Article

Publication Date

10-4-2021

Abstract

Optimal tracking in switched systems with fixed mode sequence and free final time is studied in this article. In the optimal control problem formulation, the switching times and the final time are treated as parameters. For solving the optimal control problem, approximate dynamic programming (ADP) is used. The ADP solution uses an inner loop to converge to the optimal policy at each time step. In order to decrease the computational burden of the solution, a new method is introduced, which uses evolving suboptimal policies (not the optimal policies), to learn the optimal solution. The effectiveness of the proposed solutions is evaluated through numerical simulations.

Comments

Copyright IEEE. Original published version available at doi.org/10.1109/TNNLS.2021.3113801

https://par.nsf.gov/biblio/10311845-optimal-tracking-switched-systems-free-final-time-fixed-mode-sequence-using-approximate-dynamic-programming

Recommended Citation

T. Sardarmehni and X. Song, "Optimal Tracking in Switched Systems With Free Final Time and Fixed Mode Sequence Using Approximate Dynamic Programming," in IEEE Transactions on Neural Networks and Learning Systems, doi: 10.1109/TNNLS.2021.3113801.

Publication Title

IEEE Transactions on Neural Networks and Learning Systems

DOI

10.1109/TNNLS.2021.3113801