Probabilistic model building genetic network programming using multiple probability vectors

Xianneng Li, Shingo Mabu, Manoj K. Mainali, Kotaro Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

As an extension of GA and GP, a new evolutionary algorithm named Genetic Network Programming (GNP) has been proposed. GNP uses the directed graph structure to represent its solutions, which can express the dynamic environment efficiently. The reusable nodes of GNP can construct compact structures, leading to a good performance in complex problems. In addition, a probabilistic model building GNP named GNP with Estimation of Distribution Algorithm (GNP-EDA) has been proposed to improve the evolution efficiency. GNP-EDA outperforms the conventional GNP by constructing a probabilistic model by estimating the probability distribution from the selected elite individuals of the previous generation. In this paper, a probabilistic model building GNP with multiple probability vectors (PMBGNPM) is proposed. In the proposed algorithm, multiple probability vectors are used in order to escape from premature convergence, and genetic operations like crossover and mutation are carried out to the probability vectors to maintain the diversities of the populations. The proposed algorithm is applied to the controller of autonomous robots and its performance is evaluated.

Original languageEnglish
Title of host publicationIEEE Region 10 Annual International Conference, Proceedings/TENCON
Pages1398-1403
Number of pages6
DOIs
Publication statusPublished - 2010
Event2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka
Duration: 2010 Nov 212010 Nov 24

Other

Other2010 IEEE Region 10 Conference, TENCON 2010
CityFukuoka
Period10/11/2110/11/24

Fingerprint

Genetic programming
Directed graphs
Evolutionary algorithms
Probability distributions
Robots
Controllers
Statistical Models

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications

Cite this

Li, X., Mabu, S., Mainali, M. K., & Hirasawa, K. (2010). Probabilistic model building genetic network programming using multiple probability vectors. In IEEE Region 10 Annual International Conference, Proceedings/TENCON (pp. 1398-1403). [5686113] https://doi.org/10.1109/TENCON.2010.5686113

Probabilistic model building genetic network programming using multiple probability vectors. / Li, Xianneng; Mabu, Shingo; Mainali, Manoj K.; Hirasawa, Kotaro.

IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. p. 1398-1403 5686113.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, X, Mabu, S, Mainali, MK & Hirasawa, K 2010, Probabilistic model building genetic network programming using multiple probability vectors. in IEEE Region 10 Annual International Conference, Proceedings/TENCON., 5686113, pp. 1398-1403, 2010 IEEE Region 10 Conference, TENCON 2010, Fukuoka, 10/11/21. https://doi.org/10.1109/TENCON.2010.5686113
Li X, Mabu S, Mainali MK, Hirasawa K. Probabilistic model building genetic network programming using multiple probability vectors. In IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. p. 1398-1403. 5686113 https://doi.org/10.1109/TENCON.2010.5686113
Li, Xianneng ; Mabu, Shingo ; Mainali, Manoj K. ; Hirasawa, Kotaro. / Probabilistic model building genetic network programming using multiple probability vectors. IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. pp. 1398-1403
@inproceedings{61f22bc52f224eedbe40ae44e114e285,
title = "Probabilistic model building genetic network programming using multiple probability vectors",
abstract = "As an extension of GA and GP, a new evolutionary algorithm named Genetic Network Programming (GNP) has been proposed. GNP uses the directed graph structure to represent its solutions, which can express the dynamic environment efficiently. The reusable nodes of GNP can construct compact structures, leading to a good performance in complex problems. In addition, a probabilistic model building GNP named GNP with Estimation of Distribution Algorithm (GNP-EDA) has been proposed to improve the evolution efficiency. GNP-EDA outperforms the conventional GNP by constructing a probabilistic model by estimating the probability distribution from the selected elite individuals of the previous generation. In this paper, a probabilistic model building GNP with multiple probability vectors (PMBGNPM) is proposed. In the proposed algorithm, multiple probability vectors are used in order to escape from premature convergence, and genetic operations like crossover and mutation are carried out to the probability vectors to maintain the diversities of the populations. The proposed algorithm is applied to the controller of autonomous robots and its performance is evaluated.",
author = "Xianneng Li and Shingo Mabu and Mainali, {Manoj K.} and Kotaro Hirasawa",
year = "2010",
doi = "10.1109/TENCON.2010.5686113",
language = "English",
isbn = "9781424468904",
pages = "1398--1403",
booktitle = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",

}

TY - GEN

T1 - Probabilistic model building genetic network programming using multiple probability vectors

AU - Li, Xianneng

AU - Mabu, Shingo

AU - Mainali, Manoj K.

AU - Hirasawa, Kotaro

PY - 2010

Y1 - 2010

N2 - As an extension of GA and GP, a new evolutionary algorithm named Genetic Network Programming (GNP) has been proposed. GNP uses the directed graph structure to represent its solutions, which can express the dynamic environment efficiently. The reusable nodes of GNP can construct compact structures, leading to a good performance in complex problems. In addition, a probabilistic model building GNP named GNP with Estimation of Distribution Algorithm (GNP-EDA) has been proposed to improve the evolution efficiency. GNP-EDA outperforms the conventional GNP by constructing a probabilistic model by estimating the probability distribution from the selected elite individuals of the previous generation. In this paper, a probabilistic model building GNP with multiple probability vectors (PMBGNPM) is proposed. In the proposed algorithm, multiple probability vectors are used in order to escape from premature convergence, and genetic operations like crossover and mutation are carried out to the probability vectors to maintain the diversities of the populations. The proposed algorithm is applied to the controller of autonomous robots and its performance is evaluated.

AB - As an extension of GA and GP, a new evolutionary algorithm named Genetic Network Programming (GNP) has been proposed. GNP uses the directed graph structure to represent its solutions, which can express the dynamic environment efficiently. The reusable nodes of GNP can construct compact structures, leading to a good performance in complex problems. In addition, a probabilistic model building GNP named GNP with Estimation of Distribution Algorithm (GNP-EDA) has been proposed to improve the evolution efficiency. GNP-EDA outperforms the conventional GNP by constructing a probabilistic model by estimating the probability distribution from the selected elite individuals of the previous generation. In this paper, a probabilistic model building GNP with multiple probability vectors (PMBGNPM) is proposed. In the proposed algorithm, multiple probability vectors are used in order to escape from premature convergence, and genetic operations like crossover and mutation are carried out to the probability vectors to maintain the diversities of the populations. The proposed algorithm is applied to the controller of autonomous robots and its performance is evaluated.

UR - http://www.scopus.com/inward/record.url?scp=79951652784&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79951652784&partnerID=8YFLogxK

U2 - 10.1109/TENCON.2010.5686113

DO - 10.1109/TENCON.2010.5686113

M3 - Conference contribution

SN - 9781424468904

SP - 1398

EP - 1403

BT - IEEE Region 10 Annual International Conference, Proceedings/TENCON

ER -