Simulation-based Algorithms for Markov Decision Processes [electronic resource] / by Hyeong Soo Chang, Jiaqiao Hu, Michael C. Fu, Steven I. Marcus.

By: Chang, Hyeong Soo [author.]Contributor(s): Hu, Jiaqiao [author.] | Fu, Michael C [author.] | Marcus, Steven I [author.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Communications and Control Engineering: Publisher: London : Springer London, 2007Description: XVIII, 189 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9781846286902Subject(s): Engineering | Computer software | Systems theory | Operations research | Distribution (Probability theory) | Engineering | Control Engineering | Systems Theory, Control | Operations Research, Mathematical Programming | Probability Theory and Stochastic Processes | Algorithm Analysis and Problem Complexity | Operations Research/Decision TheoryAdditional physical formats: Printed edition:: No titleOnline resources: Click here to access online
Contents:
Markov Decision Processes -- Multi-stage Adaptive Sampling Algorithms -- Population-based Evolutionary Approaches -- Model Reference Adaptive Search -- On-line Control Methods via Simulation.
In: Springer eBooksSummary: Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences. It is well-known that many real-world problems modeled by MDPs have huge state and/or action spaces, leading to the notorious curse of dimensionality that makes practical solution of the resulting models intractable. In other cases, the system of interest is complex enough that it is not feasible to specify some of the MDP model parameters explicitly, but simulation samples are readily available (e.g., for random transitions and costs). For these settings, various sampling and population-based numerical algorithms have been developed recently to overcome the difficulties of computing an optimal solution in terms of a policy and/or value function. Specific approaches include: • multi-stage adaptive sampling; • evolutionary policy iteration; • evolutionary random policy search; and • model reference adaptive search. Simulation-based Algorithms for Markov Decision Processes brings this state-of-the-art research together for the first time and presents it in a manner that makes it accessible to researchers with varying interests and backgrounds. In addition to providing numerous specific algorithms, the exposition includes both illustrative numerical examples and rigorous theoretical convergence results. The algorithms developed and analyzed differ from the successful computational methods for solving MDPs based on neuro-dynamic programming or reinforcement learning and will complement work in those areas. Furthermore, the authors show how to combine the various algorithms introduced with approximate dynamic programming methods that reduce the size of the state space and ameliorate the effects of dimensionality. The self-contained approach of this book will appeal not only to researchers in MDPs, stochastic modeling and control, and simulation but will be a valuable source of instruction and reference for students of control and operations research.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

Markov Decision Processes -- Multi-stage Adaptive Sampling Algorithms -- Population-based Evolutionary Approaches -- Model Reference Adaptive Search -- On-line Control Methods via Simulation.

Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences. It is well-known that many real-world problems modeled by MDPs have huge state and/or action spaces, leading to the notorious curse of dimensionality that makes practical solution of the resulting models intractable. In other cases, the system of interest is complex enough that it is not feasible to specify some of the MDP model parameters explicitly, but simulation samples are readily available (e.g., for random transitions and costs). For these settings, various sampling and population-based numerical algorithms have been developed recently to overcome the difficulties of computing an optimal solution in terms of a policy and/or value function. Specific approaches include: • multi-stage adaptive sampling; • evolutionary policy iteration; • evolutionary random policy search; and • model reference adaptive search. Simulation-based Algorithms for Markov Decision Processes brings this state-of-the-art research together for the first time and presents it in a manner that makes it accessible to researchers with varying interests and backgrounds. In addition to providing numerous specific algorithms, the exposition includes both illustrative numerical examples and rigorous theoretical convergence results. The algorithms developed and analyzed differ from the successful computational methods for solving MDPs based on neuro-dynamic programming or reinforcement learning and will complement work in those areas. Furthermore, the authors show how to combine the various algorithms introduced with approximate dynamic programming methods that reduce the size of the state space and ameliorate the effects of dimensionality. The self-contained approach of this book will appeal not only to researchers in MDPs, stochastic modeling and control, and simulation but will be a valuable source of instruction and reference for students of control and operations research.

There are no comments on this title.

to post a comment.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha