Model-based Value Iteration Algorithm for Stochastic Cleaning Robot

An Example for Reinforcement Learning and Dynamic Programming (Stochastic)
Updated 27 Feb 2014

View License

Model-based value iteration Algorithm for Stochastic Cleaning Robot. This code is a very simple implementation of a value iteration algorithm, which makes it a useful start point for beginners in the field of Reinforcement learning and dynamic programming.
The stochastic cleaning-robot MDP: a cleaning robot has to collect a used can also has to recharge its batteries. the state describes the position of the robot and the action describes the direction of motion. The robot can move to the left or to the right. The first (0) and the final (5) states are the terminal states. The goal is to find an optimal policy that maximizes the return from any initial state. Here the Q-iteration (model-based value iteration DP). Reference: Algorithm 2-2, from:
title={Reinforcement learning and dynamic programming using function approximators},
author={Busoniu, Lucian and Babuska, Robert and De Schutter, Bart and Ernst, Damien},
publisher={CRC Press}

Cite As

Reza Ahmadzadeh (2024). Model-based Value Iteration Algorithm for Stochastic Cleaning Robot (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2011a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Find more on Sequence and Numeric Feature Data Workflows in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes