Referenced Items are not available for this document.
We formulate the Lebesgue-sampling-based optimal control problem. We show that the problem can be solved by the time aggregation approach in Markov decision processes (MDP) theory. Policy-iteration-based and reinforcement-learning-based methods are developed for the optimal policies. Both analytical solutions and sample-path-based algorithms are given. Compared to the periodic-sampling scheme, the Lebesgue sampling scheme improves system performance.
Published in:
Automatic Control, IEEE Transactions on
(Volume:56
,
Issue:
5
)
Date of Publication: May 2011
- Page(s):
- 1097 - 1109
- ISSN :
- 0018-9286
- INSPEC Accession Number:
- 11988359
- Digital Object Identifier :
- 10.1109/TAC.2010.2073610
- Product Type:
- Journals & Magazines
- Date of Publication :
- 07 September 2010
- Date of Current Version :
- 10 May 2011
- Issue Date :
- May 2011
- Sponsored by :
- IEEE Control Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
