• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhao Fengfei and Qin Zheng. A Multi-Motive Reinforcement Learning Framework[J]. Journal of Computer Research and Development, 2013, 50(2): 240-247.
Citation: Zhao Fengfei and Qin Zheng. A Multi-Motive Reinforcement Learning Framework[J]. Journal of Computer Research and Development, 2013, 50(2): 240-247.

A Multi-Motive Reinforcement Learning Framework

More Information
  • Published Date: February 14, 2013
  • The traditional reinforcement learning methods such as Q-learning, maintain a table that maps the states to the actions. This simple dual-layer mapping structure has been widely used in many applied situations. However, dual-layer mapping structure of state-action lacks flexibility, while priori knowledge can not be effectively used to guide the learning process. To solve this problem, a new reinforcement learning framework is proposed, called multi-motive reinforcement learning (MMRL). Between state layer and action layer, MMRL framework introduces motive layer, in which multiple motives can be set based on experience. In this way, the original state-action dual-layer structure is extended to state-motive-action triple-layer structure. Under this framework, two new corresponding algorithms are presented, the first is MMQ-unique algorithm and the second is MMQ-voting algorithm. Moreover, it is stated that traditional reinforcement learning methods can be seen as a degenerate form of multi-motive reinforcement learning. That is to say, multi-motive reinforcement learning framework is a superset of traditional methods. This new framework and the corresponding algorithms improve the flexibility of reinforcement learning by adding the motive layer, and make use of priori knowledge to speed up the learning process. Experiments demonstrate that, multi-motive reinforcement learning can get better performance than the traditional reinforcement learning methods significantly by setting reasonable motives.
  • Related Articles

    [1]Wang Xianghai, Huang Junying, Li Ming. Approximate Degree Reduction Method by Blending of Multi-Triangular Bézier Surfaces with GC\+1 Constraint[J]. Journal of Computer Research and Development, 2013, 50(5): 1012-1020.
    [2]Liu Zhi, Tan Jieqing, Chen Xiaoyan. Cubic Bézier Triangular Patch with Shape Parameters[J]. Journal of Computer Research and Development, 2012, 49(1): 152-157.
    [3]Huang Weixian and Wang Guojin. Ribs and Fans of Bézier Curves and Surfaces with Endpoints G1 Continuity[J]. Journal of Computer Research and Development, 2011, 48(9): 1781-1787.
    [4]Zhi Dejia and Wang Guojin. Bézier Approximate Merging by Interval Curves[J]. Journal of Computer Research and Development, 2011, 48(4): 675-682.
    [5]Chen Jun and Wang Guojin. Optimal Parameterizations of the Degree 2 Rational Bézier Curves[J]. Journal of Computer Research and Development, 2008, 45(9): 1601-1604.
    [6]Tang Min, Tang Yang, Xu Lizhong, Pheng Ann Heng, Xia Deshen. 3D Segmentation Based on Cylindrical B-Spline Active Surface Model[J]. Journal of Computer Research and Development, 2007, 44(9): 1604-1611.
    [7]Xu Gang and Wang Guozhao. Extensions of Uniform Cubic B-Spline Curve with Local Shape Parameters[J]. Journal of Computer Research and Development, 2007, 44(6): 1032-1037.
    [8]Liu Xumin, Huang Houkuan, Wang Liuqiang, Ma Sujing. Study of Spline-Curves with Shape Parameters[J]. Journal of Computer Research and Development, 2007, 44(3).
    [9]Chen Jun and Wang Guojin. Constructing Convexity-Preserving Interpolation Curves of Hyperbolic Polynomial B-Splines Using a Shape Parameter[J]. Journal of Computer Research and Development, 2006, 43(7): 1216-1224.
    [10]Liu Yi and Zhang Caiming. Study of Determining a Conic with Five Constrained Points and Its Application in Parametric Interpolation[J]. Journal of Computer Research and Development, 2005, 42(12): 2161-2168.

Catalog

    Article views (858) PDF downloads (732) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return