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

Methods

(==) :: State -> State -> Bool

(/=) :: State -> State -> Bool

Ord State

Methods

compare :: State -> State -> Ordering

(<) :: State -> State -> Bool

(<=) :: State -> State -> Bool

(>) :: State -> State -> Bool

(>=) :: State -> State -> Bool

max :: State -> State -> State

min :: State -> State -> State

Show State

Methods

showsPrec :: Int -> State -> ShowS

show :: State -> String

showList :: [State] -> ShowS

data Control

There are two distinct actions we can take in each state

Constructors

U1

U2

Instances

Eq Control

Methods

(==) :: Control -> Control -> Bool

(/=) :: Control -> Control -> Bool

Ord Control

Methods

compare :: Control -> Control -> Ordering

(<) :: Control -> Control -> Bool

(<=) :: Control -> Control -> Bool

(>) :: Control -> Control -> Bool

(>=) :: Control -> Control -> Bool

max :: Control -> Control -> Control

min :: Control -> Control -> Control

Show Control

Methods

showsPrec :: Int -> Control -> ShowS

show :: Control -> String

showList :: [Control] -> ShowS

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.