Optimal Policies for MDPs: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 11:2411:24, 15 February 2023‎ Admin talk contribs‎ 1,531 bytes +1,531‎ Created page with "{{DISPLAYTITLE:Optimal Policies for MDPs (Optimal Policies for MDPs)}} == Description == In an MDP, a policy is a choice of what action to choose at each state An Optimal Policy is a policy where you are always choosing the action that maximizes the “return”/”utility” of the current state. The problem here is to find such an optimal policy from a given MDP. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" styl..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Optimal_Policies_for_MDPs"