Continuous probabilistic model building genetic network programming using reinforcement learning

Xianneng Li

doi:10.1016/j.asoc.2014.10.023

Return

Continuous probabilistic model building genetic network programming using reinforcement learning

2015-02-01

PRE

Xianneng Li

Kotaro Hirasawa *

DOI：10.1016/j.asoc.2014.10.023

Original

Original request for help

Save

Abstract

En 中文

Recently, a novel probabilistic model-building evolutionary algorithm (so called estimation of distribution algorithm, or EDA), named probabilistic model building genetic network programming (PMBGNP), has been proposed. PMBGNP uses graph structures for its individual representation, which shows higher expression ability than the classical EDAs. Hence, it extends EDAs to solve a range of problems, suchas data mining and agent control. This paper is dedicated to propose a continuous version of PMBGNP for continuous optimization in agent control problems. Different from the other continuous EDAs, the proposed algorithm evolves the continuous variables by reinforcement learning (RL). We compare the performance with several state-of-the-art algorithms on a real mobile robot control problem. The results show that the proposed algorithm outperforms the others with statistically significant differences. (C) 2014 Elsevier B.V. All rights reserved.

Keywords:

Estimation of distribution algorithm

Probabilistic model building genetic network programming

Continuous optimization

Reinforcement learning

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.