Bond Graph Representation and GP for Automated
Analog Filter Design
Z. Fan, J. Hu, K. Seo, E. Goodman, R. Rosenberg, and B. Zhang. 2001 Genetic and Evolutionary Computation Conference
Late Breaking Papers, page 81--86. San Francisco, California, USA, (9-11 July 2001)
Abstract
We present a novel circuit representation scheme,
namely bond graph, along with strong-typed genetic
programming for the evolution of analog filter
circuits. Bond graph is a concise and uniform language
for the description of circuit systems and more general
engineering systems. Many unique characteristics of
bond graph makes it an attractive candidate for
representing circuit in genetic programming design. The
feasibility and efficiency of using bond graph as the
representation technique of circuit systems are
verified in our experiments with automated analogue
filter design.
%0 Conference Paper
%1 fan:2001:bgrgaafd
%A Fan, Zhun
%A Hu, Jianjun
%A Seo, Kisung
%A Goodman, Erik D.
%A Rosenberg, Ronald C.
%A Zhang, Baihai
%B 2001 Genetic and Evolutionary Computation Conference
Late Breaking Papers
%C San Francisco, California, USA
%D 2001
%E Goodman, Erik D.
%K STGP, algorithms, bond evolutionary genetic graphs, programming, synthesis
%P 81--86
%T Bond Graph Representation and GP for Automated
Analog Filter Design
%U http://citeseer.ist.psu.edu/448346.html
%X We present a novel circuit representation scheme,
namely bond graph, along with strong-typed genetic
programming for the evolution of analog filter
circuits. Bond graph is a concise and uniform language
for the description of circuit systems and more general
engineering systems. Many unique characteristics of
bond graph makes it an attractive candidate for
representing circuit in genetic programming design. The
feasibility and efficiency of using bond graph as the
representation technique of circuit systems are
verified in our experiments with automated analogue
filter design.
@inproceedings{fan:2001:bgrgaafd,
abstract = {We present a novel circuit representation scheme,
namely bond graph, along with strong-typed genetic
programming for the evolution of analog filter
circuits. Bond graph is a concise and uniform language
for the description of circuit systems and more general
engineering systems. Many unique characteristics of
bond graph makes it an attractive candidate for
representing circuit in genetic programming design. The
feasibility and efficiency of using bond graph as the
representation technique of circuit systems are
verified in our experiments with automated analogue
filter design.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {San Francisco, California, USA},
author = {Fan, Zhun and Hu, Jianjun and Seo, Kisung and Goodman, Erik D. and Rosenberg, Ronald C. and Zhang, Baihai},
biburl = {https://www.bibsonomy.org/bibtex/2432375e8b035c7b1e959e4878536be9c/brazovayeye},
booktitle = {2001 Genetic and Evolutionary Computation Conference
Late Breaking Papers},
editor = {Goodman, Erik D.},
email = {fanzhun@egr.msu.edu, hujianju@egr.msu.edu},
interhash = {d5fcc10b13ed1c42cf7c75facb66649b},
intrahash = {432375e8b035c7b1e959e4878536be9c},
keywords = {STGP, algorithms, bond evolutionary genetic graphs, programming, synthesis},
month = {9-11 July},
notes = {GECCO-2001LB, lilgp},
pages = {81--86},
timestamp = {2008-06-19T17:39:24.000+0200},
title = {Bond Graph Representation and {GP} for Automated
Analog Filter Design},
url = {http://citeseer.ist.psu.edu/448346.html},
year = 2001
}