Algorithms.MDP.Examples.Ex_3_1

The problem described by Bertsekas p. 22.

Documentation

data State

There are two distinct states

Constructors

A

B

Instances

Eq State

Ord State

Show State

data Control

There are two distinct actions we can take in each state

Constructors

U1

U2

Instances

Eq Control

Ord Control

Show Control

transition :: Control -> State -> State -> Double

The transition matrix

costs :: Control -> State -> Double

The costs associated with each state and action

alpha :: Double

The discount factor

states :: [State]

The available states

controls :: [Control]

The available actions

mdp :: MDP State Control Double

The MDP representing the problem.