SARSA algorithm

I am having trouble understanding the SARSA algorithm: http://en.wikipedia.org/wiki/SARSA

In particular, when updating the Q value what is gamma? a开发者_StackOverflow中文版nd what values are used for s(t+1) and a(t+1)?

Can someone explain this algorithm to me?

Thanks.

Gamma determines how much memory your algorithm has. If you set it to 0.0, then your algorithm will not update the value function Q at all. If you set it to 1.0, then the new experience will be given as much weight as all the previous experiences combined. The best values lie inbetween and have to be determined experimentally.

Here is how it works:

• In your first step, you just get a state. Simply store it away as s_t. Also, look up your value function for the best action to make in this state and store it as a_t.
• In each subsequent step, you get r_t+1 and s_t+1. Again, use your value function to find the best action — a_t+1. The value of the transition from your previous action to the new one is equal to r_t+1+Q(s_t+1,a_t+1)-Q(s_t,a_t). Use this to update your long-term estimate of the previous action's value Q(s_t,a_tt). Finally, store s_t+1 and a_t+1 as s_t and a_t for the next step.

In effect, the value function is just a running average of these update values for each action and every state.