Show simple item record

dc.contributor.authorAndreas A. Malikopoulos
dc.date.accessioned2017-05-09T00:32:10Z
dc.date.available2017-05-09T00:32:10Z
dc.date.copyrightJuly, 2009
dc.date.issued2009
dc.identifier.issn0022-0434
dc.identifier.otherJDSMAA-26497#041011_1.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/140201
dc.description.abstractThe increasing complexity of engineering systems has motivated continuing research on computational learning methods toward making autonomous intelligent systems that can learn how to improve their performance over time while interacting with their environment. These systems need not only to sense their environment, but also to integrate information from the environment into all decision-makings. The evolution of such systems is modeled as an unknown controlled Markov chain. In a previous research, the predictive optimal decision-making (POD) model was developed, aiming to learn in real time the unknown transition probabilities and associated costs over a varying finite time horizon. In this paper, the convergence of the POD to the stationary distribution of a Markov chain is proven, thus establishing the POD as a robust model for making autonomous intelligent systems. This paper provides the conditions that the POD can be valid, and be an interpretation of its underlying structure.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleConvergence Properties of a Computational Learning Model for Unknown Markov Chains
dc.typeJournal Paper
dc.journal.volume131
dc.journal.issue4
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.3117202
dc.journal.fristpage41011
dc.identifier.eissn1528-9028
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2009:;volume( 131 ):;issue: 004
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record