Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/95597
Title: Optimized dynamic policy for receding horizon control of linear time-varying systems with bounded disturbances
Authors: Gautam, A.
Yun-Chung Chu.
Yeng Chai Soh.
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2011
Source: Gautam, A., Chu, Y.-C., & Soh, Y. C. (2012). Optimized Dynamic Policy for Receding Horizon Control of Linear Time-Varying Systems With Bounded Disturbances. IEEE Transactions on Automatic Control, 57(4), 973-988.
Series/Report no.: IEEE transactions on automatic control
Abstract: This paper deals with the problem of reducing the online computational complexity of receding horizon control (RHC) algorithms for a class of linear systems with a polytopic system description and with bounded additive disturbances. We explore a class of admissible polytopic controller dynamics involving a disturbance feedforward term for a dynamic policy which ensures reduced conservativeness and also offers a way to significantly simplify the online computations by allowing the controller dynamics to be optimized offline. Moreover, for a deterministically time-varying system with additive disturbances, we explore the use of the proposed dynamic policy as the terminal control policy appended to a standard finite-horizon disturbance-based RHC policy. We also present results on the stability of the system under the RHC schemes based on the proposed policy, in the context of both the nominal and the (H∞-based) minmax cost minimizations. Results of simulation studies that illustrate the effective performance and the computational efficiency of the proposed control schemes are included.
URI: https://hdl.handle.net/10356/95597
http://hdl.handle.net/10220/11259
DOI: http://dx.doi.org/10.1109/TAC.2011.2170109
Rights: © 2011 IEEE.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.