Non-recursive Haar Connection Coefficients Based Approach for Linear Optimal Control
- 188 Downloads
In the present paper, two-fold contributions are made. First, non-recursive formulations of various Haar operational matrices, such as Haar connection coefficients matrix, backward integral matrix, and product matrix are developed. These non-recursive formulations result in computationally efficient algorithms, with respect to execution time and stack-and-memory overflows in computer implementations, as compared to corresponding recursive formulations. This is demonstrated with the help of MATLAB PROFILER. Later, a unified method is proposed, based on these non-recursive connection coefficients, for solving linear optimal control problems of all types, irrespective of order and nature of the system. This means that the single method is capable of optimizing both time-invariant and time-varying linear systems of any order efficiently; it has not been reported in the literature so far. The proposed method is applied to solve finite horizon LQR problems with final state control. Computational efficiency of the proposed method is established with the help of comparison on computation-time at different resolutions by taking several illustrative examples.
KeywordsConnection coefficients Haar wavelet Linear time-invariant systems Linear time-variant systems LQR Optimal control
Unable to display preview. Download preview PDF.
- 1.Paraskevopoulos, P.N.: Modern Control Engineering. Dekker, New York (2002) Google Scholar
- 14.Garg, M., Dewan, L.: A novel method of computing Haar connection coefficients for analysis of HCI systems. In: Proc. Second Int. Conf. Intelligent Human Computer Interaction, IHCI 2010. Lecture Notes in Control and Information Sciences (LNCS), pp. 360–365. Springer, Berlin (2010). ISBN 978-81-8489-540-7 Google Scholar
- 16.Wu, J.L., Chen, C.H., Chen, C.F.: A unified derivation of operational matrices for integration in systems analysis. In: Proc. IEEE Comp. Society Int. Conf. Infor. Tech., ITCC’00, Coding and Computing, USA, March 27–29, pp. 436–442 (2000) Google Scholar