New Pathways in Coevolutionary Computation.

Moshe Sipper; Jason H. Moore; Ryan J. Urbanowicz

doi:10.1007/978-3-030-39958-0_15

New Pathways in Coevolutionary Computation.

Moshe Sipper, Jason H. Moore, Ryan J. Urbanowicz

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

The simultaneous evolution of two or more species with coupled fitness—coevolution—has been put to good use in the field of evolutionary computation. Herein, we present two new forms of coevolutionary algorithms, which we have recently designed and applied with success. OMNIREP is a cooperative coevolutionary algorithm that discovers both a representation and an encoding for solving a particular problem of interest. SAFE is a commensalistic coevolutionary algorithm that maintains two coevolving populations: a population of candidate solutions and a population of candidate objective functions needed to measure solution quality during evolution.

Original language	English
Title of host publication	Genetic Programming Theory and Practice XVII
Editors	W Banzhaf , E Goodman, L Sheneman , L. Trujillo, B. Worzel
Place of Publication	Cham
Publisher	Springer
Pages	295-305
ISBN (Electronic)	978-3-030-39958-0
ISBN (Print)	978-3-030-39957-3
DOIs	https://doi.org/10.1007/978-3-030-39958-0_15
State	Published - 8 May 2019

Keywords

Evolutionary computation
Coevolution
Novelty search
Robotics
Evolutionary art
Multiobjective optimization
Objective function

Access to Document

10.1007/978-3-030-39958-0_15

https://dblp.org/db/conf/gptp/gptp2019.html#SipperMU19

Cite this

@inbook{445d0e40b9c34af18bccf9f206b41305,

title = "New Pathways in Coevolutionary Computation.",

abstract = "The simultaneous evolution of two or more species with coupled fitness—coevolution—has been put to good use in the field of evolutionary computation. Herein, we present two new forms of coevolutionary algorithms, which we have recently designed and applied with success. OMNIREP is a cooperative coevolutionary algorithm that discovers both a representation and an encoding for solving a particular problem of interest. SAFE is a commensalistic coevolutionary algorithm that maintains two coevolving populations: a population of candidate solutions and a population of candidate objective functions needed to measure solution quality during evolution.",

keywords = "Evolutionary computation, Coevolution, Novelty search, Robotics, Evolutionary art, Multiobjective optimization, Objective function",

author = "Moshe Sipper and Moore, {Jason H.} and Urbanowicz, {Ryan J.}",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2019",

month = may,

day = "8",

doi = "10.1007/978-3-030-39958-0_15",

language = "English",

isbn = "978-3-030-39957-3",

pages = "295--305",

editor = "{Banzhaf }, W and E Goodman and {Sheneman }, L and L. Trujillo and B. Worzel",

booktitle = "Genetic Programming Theory and Practice XVII",

publisher = "Springer",

address = "Germany",

}

TY - CHAP

T1 - New Pathways in Coevolutionary Computation.

AU - Sipper, Moshe

AU - Moore, Jason H.

AU - Urbanowicz, Ryan J.

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2019/5/8

Y1 - 2019/5/8

N2 - The simultaneous evolution of two or more species with coupled fitness—coevolution—has been put to good use in the field of evolutionary computation. Herein, we present two new forms of coevolutionary algorithms, which we have recently designed and applied with success. OMNIREP is a cooperative coevolutionary algorithm that discovers both a representation and an encoding for solving a particular problem of interest. SAFE is a commensalistic coevolutionary algorithm that maintains two coevolving populations: a population of candidate solutions and a population of candidate objective functions needed to measure solution quality during evolution.

AB - The simultaneous evolution of two or more species with coupled fitness—coevolution—has been put to good use in the field of evolutionary computation. Herein, we present two new forms of coevolutionary algorithms, which we have recently designed and applied with success. OMNIREP is a cooperative coevolutionary algorithm that discovers both a representation and an encoding for solving a particular problem of interest. SAFE is a commensalistic coevolutionary algorithm that maintains two coevolving populations: a population of candidate solutions and a population of candidate objective functions needed to measure solution quality during evolution.

KW - Evolutionary computation

KW - Coevolution

KW - Novelty search

KW - Robotics

KW - Evolutionary art

KW - Multiobjective optimization

KW - Objective function

U2 - 10.1007/978-3-030-39958-0_15

DO - 10.1007/978-3-030-39958-0_15

M3 - Chapter

SN - 978-3-030-39957-3

SP - 295

EP - 305

BT - Genetic Programming Theory and Practice XVII

A2 - Banzhaf , W

A2 - Goodman, E

A2 - Sheneman , L

A2 - Trujillo, L.

A2 - Worzel, B.

PB - Springer

CY - Cham

ER -

New Pathways in Coevolutionary Computation.

Abstract

Keywords

Access to Document

Fingerprint

Cite this