Blindbuilder : A new encoding to evolve Lego-like
structures
A. Devert, N. Bredeche, and M. Schoenauer. Proceedings of the 9th European Conference on Genetic
Programming, volume 3905 of Lecture Notes in Computer Science, page 61--72. Budapest, Hungary, Springer, (10 - 12 April 2006)
Abstract
This paper introduces a new representation for
assemblies of small Lego-like elements: structures are
indirectly encoded as construction plans. This
representation shows some interesting properties such
as hierarchy, modularity and easy constructibility
checking by definition. Together with this
representation, efficient GP operators are introduced
that allow efficient and fast evolution, as witnessed
by the results on two construction problems that
demonstrate that the proposed approach is able to
achieve both compactness and reusability of evolved
components.
%0 Conference Paper
%1 eurogp06:DevertBredecheSchoenauer
%A Devert, Alexandre
%A Bredeche, Nicolas
%A Schoenauer, Marc
%B Proceedings of the 9th European Conference on Genetic
Programming
%C Budapest, Hungary
%D 2006
%E Collet, Pierre
%E Tomassini, Marco
%E Ebner, Marc
%E Gustafson, Steven
%E Ekárt, Anikó
%I Springer
%K algorithms, context free genetic grammar programming,
%P 61--72
%T Blindbuilder : A new encoding to evolve Lego-like
structures
%U http://link.springer.de/link/service/series/0558/papers/3905/39050061.pdf
%V 3905
%X This paper introduces a new representation for
assemblies of small Lego-like elements: structures are
indirectly encoded as construction plans. This
representation shows some interesting properties such
as hierarchy, modularity and easy constructibility
checking by definition. Together with this
representation, efficient GP operators are introduced
that allow efficient and fast evolution, as witnessed
by the results on two construction problems that
demonstrate that the proposed approach is able to
achieve both compactness and reusability of evolved
components.
%Z Alexandre Devert <devert@lri.fr>
%@ 3-540-33143-3
@inproceedings{eurogp06:DevertBredecheSchoenauer,
abstract = {This paper introduces a new representation for
assemblies of small Lego-like elements: structures are
indirectly encoded as construction plans. This
representation shows some interesting properties such
as hierarchy, modularity and easy constructibility
checking by definition. Together with this
representation, efficient GP operators are introduced
that allow efficient and fast evolution, as witnessed
by the results on two construction problems that
demonstrate that the proposed approach is able to
achieve both compactness and reusability of evolved
components.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Budapest, Hungary},
annote = {Alexandre Devert <devert@lri.fr>},
author = {Devert, Alexandre and Bredeche, Nicolas and Schoenauer, Marc},
bibsource = {DBLP, http://dblp.uni-trier.de},
biburl = {https://www.bibsonomy.org/bibtex/24d9e674749b7db7fadcf6b23c1b577d0/brazovayeye},
booktitle = {Proceedings of the 9th European Conference on Genetic
Programming},
contributor = {Alexandre Devert <devert@lri.fr>},
coverage = {genetic programming},
editor = {Collet, Pierre and Tomassini, Marco and Ebner, Marc and Gustafson, Steven and Ek\'art, Anik\'o},
identifier = {inria-00000995 (version 1)},
interhash = {f4dc1b636389d9d69734e800317cb428},
intrahash = {4d9e674749b7db7fadcf6b23c1b577d0},
isbn = {3-540-33143-3},
keywords = {algorithms, context free genetic grammar programming,},
month = {10 - 12 April},
notes = {Part of \cite{collet:2006:GP} EuroGP'2006 held in
conjunction with EvoCOP2006 and EvoWorkshops2006},
oai = {oai:hal.ccsd.cnrs.fr:inria-00000995_v1},
organisation = {EvoNet},
pages = {61--72},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
subject = {Computer Science/Artificial Intelligence; Computer
Science/Learning},
timestamp = {2008-06-19T17:38:39.000+0200},
title = {Blindbuilder : {A} new encoding to evolve Lego-like
structures},
type = {ARTCOLLOQUE},
url = {http://link.springer.de/link/service/series/0558/papers/3905/39050061.pdf},
volume = 3905,
year = 2006
}