First Steps toward Automated Design of Mechatronic
Systems Using Bond Graphs and Genetic Programming
K. Seo, E. Goodman, and R. Rosenberg. Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO-2001), page 189. San Francisco, California, USA, Morgan Kaufmann, (7-11 July 2001)
Abstract
This paper suggests a method for automatically
synthesizing designs for mechatronic systems. The
domain of mechatronic systems includes mixtures of, for
example, electrical, mechanical, hydraulic, pneumatic,
and thermal components, making it difficult to design a
system to meet specified performance goals with a
single design tool. Bond graphs are domain independent,
allow free composition, and are efficient for
classification and analysis of models, allowing rapid
determination of various types of acceptability or
feasibility of candidate designs (Karnopp et al). This
can sharply reduce the time needed for analysis of
designs that are infeasible or otherwise unattractive.
Genetic programming is well recognized as a powerful
tool for open-ended search (Koza et al). The
combination of these two powerful methods is therefore
an appropriate target for a better system for synthesis
of complex multi-domain systems. The approach described
here will evolve new designs (represented as bond
graphs) with ever-improving performance, in an
iterative loop of synthesis, analysis, and feedback to
the synthesis process.
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO-2001)
year
2001
month
7-11 July
pages
189
publisher
Morgan Kaufmann
publisher_address
San Francisco, CA 94104, USA
size
1 page
isbn
1-55860-774-9
notes
GECCO-2001 A joint meeting of the tenth International
Conference on Genetic Algorithms (ICGA-2001) and the
sixth Annual Genetic Programming Conference (GP-2001)
Part of spector:2001:GECCO
%0 Conference Paper
%1 kisungseo:2001:gecco
%A Seo, Kisung
%A Goodman, Erik D.
%A Rosenberg, Ronald C.
%B Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO-2001)
%C San Francisco, California, USA
%D 2001
%E Spector, Lee
%E Goodman, Erik D.
%E Wu, Annie
%E Langdon, W. B.
%E Voigt, Hans-Michael
%E Gen, Mitsuo
%E Sen, Sandip
%E Dorigo, Marco
%E Pezeshk, Shahram
%E Garzon, Max H.
%E Burke, Edmund
%I Morgan Kaufmann
%K Poster, algorithms, bond design design, dynamic genetic graphs, mechatronic, programming: systems
%P 189
%T First Steps toward Automated Design of Mechatronic
Systems Using Bond Graphs and Genetic Programming
%U http://www.cs.bham.ac.uk/~wbl/biblio/gecco2001/d02.pdf
%X This paper suggests a method for automatically
synthesizing designs for mechatronic systems. The
domain of mechatronic systems includes mixtures of, for
example, electrical, mechanical, hydraulic, pneumatic,
and thermal components, making it difficult to design a
system to meet specified performance goals with a
single design tool. Bond graphs are domain independent,
allow free composition, and are efficient for
classification and analysis of models, allowing rapid
determination of various types of acceptability or
feasibility of candidate designs (Karnopp et al). This
can sharply reduce the time needed for analysis of
designs that are infeasible or otherwise unattractive.
Genetic programming is well recognized as a powerful
tool for open-ended search (Koza et al). The
combination of these two powerful methods is therefore
an appropriate target for a better system for synthesis
of complex multi-domain systems. The approach described
here will evolve new designs (represented as bond
graphs) with ever-improving performance, in an
iterative loop of synthesis, analysis, and feedback to
the synthesis process.
%@ 1-55860-774-9
@inproceedings{kisungseo:2001:gecco,
abstract = {This paper suggests a method for automatically
synthesizing designs for mechatronic systems. The
domain of mechatronic systems includes mixtures of, for
example, electrical, mechanical, hydraulic, pneumatic,
and thermal components, making it difficult to design a
system to meet specified performance goals with a
single design tool. Bond graphs are domain independent,
allow free composition, and are efficient for
classification and analysis of models, allowing rapid
determination of various types of acceptability or
feasibility of candidate designs (Karnopp et al). This
can sharply reduce the time needed for analysis of
designs that are infeasible or otherwise unattractive.
Genetic programming is well recognized as a powerful
tool for open-ended search (Koza et al). The
combination of these two powerful methods is therefore
an appropriate target for a better system for synthesis
of complex multi-domain systems. The approach described
here will evolve new designs (represented as bond
graphs) with ever-improving performance, in an
iterative loop of synthesis, analysis, and feedback to
the synthesis process.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {San Francisco, California, USA},
author = {Seo, Kisung and Goodman, Erik D. and Rosenberg, Ronald C.},
biburl = {https://www.bibsonomy.org/bibtex/23af2fa508b1f568caf5e11334adbd80c/brazovayeye},
booktitle = {Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO-2001)},
editor = {Spector, Lee and Goodman, Erik D. and Wu, Annie and Langdon, W. B. and Voigt, Hans-Michael and Gen, Mitsuo and Sen, Sandip and Dorigo, Marco and Pezeshk, Shahram and Garzon, Max H. and Burke, Edmund},
interhash = {82a48b77e81416fd3625dd9b7948fe33},
intrahash = {3af2fa508b1f568caf5e11334adbd80c},
isbn = {1-55860-774-9},
keywords = {Poster, algorithms, bond design design, dynamic genetic graphs, mechatronic, programming: systems},
month = {7-11 July},
notes = {GECCO-2001 A joint meeting of the tenth International
Conference on Genetic Algorithms (ICGA-2001) and the
sixth Annual Genetic Programming Conference (GP-2001)
Part of \cite{spector:2001:GECCO}},
pages = 189,
publisher = {Morgan Kaufmann},
publisher_address = {San Francisco, CA 94104, USA},
size = {1 page},
timestamp = {2008-06-19T17:51:22.000+0200},
title = {First Steps toward Automated Design of Mechatronic
Systems Using Bond Graphs and Genetic Programming},
url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco2001/d02.pdf},
year = 2001
}