运筹学的课程笔记 markov decision process

fn(i)=max⁡a∈A{∑j∈SPa(i,j)∗(Ra(i,j)+fn+1(j))}f_n(i)=\max_{a \in A} \{ \sum_{j \in S} P_a (i,j)* (R_a (i,j)+f_{n+1}(j)) \}fn​(i)=a∈Amax​{j∈S∑​Pa​(i,j)∗(Ra​(i,j)+fn+1​(j))}

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$

$$$$