|
Computes the span of a vector.
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_span
●
0 images
|
|
Applies the Bellman operator to a value function Vprev and returns a new value function and a Vprev-improving policy.
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_bellman_operator
●
0 images
|
|
Evaluates a policy using matrix operation
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_eval_policy_matrix
●
0 images
|
|
Generates a simple MDP example of forest management problem
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_example_forest
●
0 images
|
|
Computes a bound on the number of iterations for the value iteration algorithm
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_value_iteration_bound_iter
●
0 images
|
|
Solves discounted MDP with Gauss-Seidel's value iteration algorithm.
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_value_iterationGS
●
0 images
|
|
Evaluates a policy using the TD(0) algorithm
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_eval_policy_TD_0
●
0 images
|
|
Solves discounted MDP with the Q-learning algorithm (Reinforcement learning)
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_Q_learning
●
0 images
|
|
Solves discounted MDP using modified policy iteration algorithm
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_policy_iteration_modified
●
0 images
|
|
Checks the validity of a MDP
● Data Source:
CranContrib
● Keywords:
● Alias: mdp_check
●
0 images
|
providing 
.