Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Markov decision processes under observability constraints

From MaRDI portal
Publication:1781146
Jump to:navigation, search

DOI10.1007/S001860400402zbMath1125.90421OpenAlexW2086085758MaRDI QIDQ1781146

Yasemin Serin, Vidyadhar G. Kulkarni

Publication date: 16 June 2005

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860400402


zbMATH Keywords

Markov decision processNonlinear programmingObservation constraints


Mathematics Subject Classification ID

Nonlinear programming (90C30) Markov and semi-Markov decision processes (90C40)


Related Items (4)

Total reward criteria for unconstrained/constrained continuous-time Markov decision processes ⋮ Constrained continuous-time Markov decision processes with average criteria ⋮ Comments on: ``A policy improvement method for constrained average Markov decision processes [Oper. Res. Lett. 35 (2007) 434-438] ⋮ Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations







This page was built for publication: Markov decision processes under observability constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1781146&oldid=14134874"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 08:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki