Abstract

The problem of optimal control of time-varying linear singular systems with quadratic performance index has been studied using the Runge–Kutta–Butcher algorithm. The results obtained using the Runge–Kutta (RK) method based on the arithmetic mean (RKAM) and the RK–Butcher algorithms are compared with the exact solutions of the time-varying optimal control of linear singular systems. It is observed that the result obtained using the RK–Butcher algorithm is closer to the true solution of the problem. Stability regions for the RKAM algorithm, the single-term Walsh series method and the RK–Butcher algorithms are presented. Error graphs for the simulated results and exact solutions are presented in graphical form to highlight the efficiency of the RK–Butcher algorithm. This algorithm can easily be implemented using a digital computer. An additional advantage of this method is that the solution can be obtained for any length of time for this type of optimal control of time-varying linear singular systems.

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 call

Disclaimer: 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.