节点文献

Solution to reinforcement learning problems with artificial potential field

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 谢丽娟谢光荣陈焕文李小俚

【Author】 XIE Li-juan1,2,XIE Guang-rong1,CHEN Huan-wen2,3,LI Xiao-li4(1.Institute of Mental Health,Xiangya School of Medicine,Central South University,Changsha 410011,China;2.School of Computer and Communication,Changsha University of Science and Technology,Changsha 410076,China;3.Department of Computer Engineering,Hunan College of Information,Changsha 410200,China;4.School of Computer Science,University of Birmingham,Birmingham,B15 2TT,UK)

【机构】 Institute of Mental Health,Xiangya School of Medicine,Central South UniversitySchool of Computer and Communication,Changsha University of Science and TechnologySchool of Computer Science,University of Birmingham

【摘要】 A novel method was designed to solve reinforcement learning problems with artificial potential field.Firstly a reinforcement learning problem was transferred to a path planning problem by using artificial potential field(APF),which was a very appropriate method to model a reinforcement learning problem.Secondly,a new APF algorithm was proposed to overcome the local minimum problem in the potential field methods with a virtual water-flow concept.The performance of this new method was tested by a gridworld problem named as key and door maze.The experimental results show that within 45 trials,good and deterministic policies are found in almost all simulations.In comparison with WIERING’s HQ-learning system which needs 20 000 trials for stable solution,the proposed new method can obtain optimal and stable policy far more quickly than HQ-learning.Therefore,the new method is simple and effective to give an optimal solution to the reinforcement learning problem.

【Abstract】 A novel method was designed to solve reinforcement learning problems with artificial potential field.Firstly a reinforcement learning problem was transferred to a path planning problem by using artificial potential field(APF),which was a very appropriate method to model a reinforcement learning problem.Secondly,a new APF algorithm was proposed to overcome the local minimum problem in the potential field methods with a virtual water-flow concept.The performance of this new method was tested by a gridworld problem named as key and door maze.The experimental results show that within 45 trials,good and deterministic policies are found in almost all simulations.In comparison with WIERING’s HQ-learning system which needs 20 000 trials for stable solution,the proposed new method can obtain optimal and stable policy far more quickly than HQ-learning.Therefore,the new method is simple and effective to give an optimal solution to the reinforcement learning problem.

【基金】 Projects(30270496,60075019,60575012)supported by the National Natural Science Foundation of China
  • 【文献出处】 Journal of Central South University of Technology ,中南工业大学学报(英文版) , 编辑部邮箱 ,2008年04期
  • 【分类号】TP18
  • 【被引频次】13
  • 【下载频次】172
节点文献中: