Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations

DOI10.1002/nav.20329zbMath1158.90419OpenAlexW2005483729MaRDI QIDQ3621914

Thom J. Hodgson, Russell E. King, Lauren B. Davis, Wenbin Wei

Publication date: 22 April 2009

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20329

zbMATH Keywords

optimal controlheuristicsMarkov decision process

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items (1)

Heuristic algorithm for nested Markov decision process: solution quality and computational complexity

Cites Work

• Unnamed Item
• Markov decision processes under observability constraints
• Supply Chain Inventory Management and the Value of Shared Information
• Information Flows in Capacitated Supply Chains with Fixed Ordering Costs
• Value of Information in Capacitated Supply Chains
• Linear Programming in a Markov Chain

This page was built for publication: Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations