Navigation

Automatisk styrings- & reguleringsteknik

Foundations of Average-Cost Nonhomogeneous Controlled Markov Chains

Udgivet af Springer Nature Switzerland AG

Bogdetaljer

  • Hæftet
  • 120 sider
  • Engelsk
ISBN 9783030566777
Om denne bog

This Springer brief addresses the challenges encountered in the study of the optimization of time-nonhomogeneous Markov chains. It develops new insights and new methodologies for systems in which concepts such as stationarity, ergodicity, periodicity and connectivity do not apply.This brief introduces the novel concept…

Se alle bogdetaljer →
Prissammenligning

Ingen boghandelspriser listet endnu

Denne titel er i vores bogkatalog. Butikstilbud vises her, når de er tilgængelige.

Betroet sælger:

Ingen boghandelstilbud lige nu.

Søg efter ISBN
Opdateret i dag

Boghandelspriser

Boghandel Titel Format ISBN Pris Lagerstatus Levering

Ingen boghandelstilbud endnu

Vi har titlen i kataloget. Priser vises her, når boghandlere lister den.

0.0
0 anmeldelser
5
0
4
0
3
0
2
0
1
0
0%
Anbefaler
0
Verificeret
Alle anmeldelser (0)

Ingen anmeldelser endnu

Skriv en anmeldelse

Valgfri - Kun brugt til verifikation
0 / 5000 tegn
Bogdetaljer
Forfatter Xi-Ren Cao
Forlag Springer Nature Switzerland AG
Kategori Automatisk styrings- & reguleringsteknik
ISBN-13 9783030566777
EAN 9783030566777
Format Hæftet
Sprog Engelsk
sider 120
Produktbeskrivelse
This Springer brief addresses the challenges encountered in the study of the optimization of time-nonhomogeneous Markov chains. It develops new insights and new methodologies for systems in which concepts such as stationarity, ergodicity, periodicity and connectivity do not apply.This brief introduces the novel concept of confluencity and applies a relative optimization approach. It develops a comprehensive theory for optimization of the long-run average of time-nonhomogeneous Markov chains. The book shows that confluencity is the most fundamental concept in optimization, and that relative optimization is more suitable for treating the systems under consideration than standard ideas of dynamic programming. Using confluencity and relative optimization, the author classifies states as confluent or branching and shows how the under-selectivity issue of the long-run average can be easily addressed, multi-class optimization implemented, and Nth biases and Blackwell optimality conditions derived. These results are presented in a book for the first time and so may enhance the understanding of optimization and motivate new research ideas in the area.

Prishistorik

Indlæser prishistorik...

Få prisalarm

Bliv underrettet, når prisen falder til dit ønskede beløb.