MDP Toolbox for MATLAB

mdp_example_forest

Generates a simple MDP example of forest management problem.

Syntax

[P, R] = mdp_example_forest ()
[P, R] = mdp_example_forest (S)
[P, R] = mdp_example_forest (S, r1)
[P, R] = mdp_example_forest (S, r1, r2)
[P, R] = mdp_example_forest (S, r1, r2, p)

Description

mdp_example_forest generates a transition probability (SxSxA) array P and a reward (SxA) matrix R that model the following problem.
A forest is managed by two actions: Wait and Cut.
An action is decided each year with first the objective to maintain an old forest for wildlife and second to make money selling cut wood.
Each year there is a probability p that a fire burns the forest.

Here is the modelisation of this problem.
Let {1, ... S} be the states of the forest. the Sth state being the oldest.
Let Wait be action 1 and Cut action 2.
After a fire, the forest is in the youngest state, that is state 1.
The transition matrix P of the problem can then be defined as follows.

               |  p  1-p  0.......0  |
               |  p  0  1-p  0...0  |
P(:,:,1) = |  .    .     .        .  |
               |  .    .         .   0  |
               |  .    .          1-p  |
               |  p   0  0..0 1-p  |

                 |  1  0........0  |
                 |  .  .          .  |
P(:,:,2) =   |  .  .          .  |
                 |  .  .          .  |
                 |  .  .          .  |
                 |  1  0........0  |

The reward matrix R is defined as follows.

               |  0  |
               |  .   |
R(:,1) =   |  .   |
               |  .   |
               |  0  |
               |  r1 |

               |  0  |
               |  1  |
R(:,2) =   |  .   |
               |  .   |
               |  1  |
               |  r2 |

Arguments

• S (optional): number of states

Evaluations

• P : transition probability array.