import numpy as np import random # 获取一个格子的状态 def get_state(row, col): if row!=3: return 'ground' if row == 3 and col == 11: return 'terminal' if row == 3 and col == 0: return 'ground' return 'trap' # 在某一状态下执行动作,获得对应奖励 def move(row, col, action): # 状态检查-进入陷阱或结束,则不能执行任何动作,获得0奖励 if get_state(row, col) in ["trap", "terminal"]: return row, col, 0 # 执行上下左右动作后,对应的位置变化 if action == 0: row -= 1 if action == 1: row += 1 if action == 2: col -= 1 if action == 3: col += 1 # 最小不能小于零,最大不能大于3 row = max(0, row) row = min(3, row) col = max(0, col) col = min(11, col) # 掉进trap奖励-100,其余每走一步奖励-1,让agent尽快完成任务 reward = -1 if get_state(row, col) == 'trap': reward = -100 return row, col, reward # 初始化Q表格,每个格子采取每个动作的分数,刚开始都是未知的故为零 Q = np.zeros([4, 12, 4]) # 根据当前所处的格子,选取一个动作 def get_action(row, col): # 以一定的概率探索 if random.random() < 0.1: return np.random.choice(range(4)) else: # 返回当前Q表格中分数最高的动作 return Q[row, col].argmax() # 计算当前格子的更新量(当前格子采取动作后获得的奖励,来到下一个格子及要进行的动作) def update(row, col, action, reward, next_row, next_col, next_action): target = reward + Q[next_row, next_col, next_action] * 0.95 value = Q[row, col, action] # 时序查分计算td_error td_error = 0.1 * (target - value) # 返回误差值 return td_error def train(): for epoch in range(10000): # 每次迭代开始,随机一个起点,尽可能多地与环境交互,同时绑定一个动作 row = np.random.choice(range(4)) col = 0 action = get_action(row, col) # 计算本轮奖励的总和,越来越大 rewards_sum = 0 # 一直取探索,直到游戏结束或者进入trap(要判断) while get_state(row, col) not in ["terminal", "trap"]: # 当前状态下移动一次,获得新的状态 next_row, next_col, reward = move(row, col, action) next_action = get_action(next_row, next_col) rewards_sum += reward # 获取此次移动的更新量 td_error = update(row, col, action, reward, next_row, next_col, next_action) # 更新Q表格 Q[row, col, action] += td_error # 状态更新 row, col, action = next_row, next_col, next_action if epoch % 500 == 0: print(f"epoch:{epoch}, rewards_sum:{rewards_sum}")
标签:return,04,差分,next,SARSA,action,reward,col,row From: https://www.cnblogs.com/demo-deng/p/16877999.html