Dense and Switched Modular Primitives for Bond Graph Model Design

Kisung Seo¹, Zhun Fan¹, Jianjun Hu¹, Erik D. Goodman¹, and Ronald C. Rosenberg²

¹Genetic Algorithms Research and Applications Group (GARAGe)
Michigan State University

²Department of Mechanical Engineering
Michigan State University
East Lansing, MI 48824, USA
{ksseo,fanzhun,hujianju,goodman,rosenber}@egr.msu.edu

Abstract. This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems. A set of primitives is sought that will avoid redundant junctions and elements, based on pre-assembling useful functional blocks of bond graph elements and (optionally) using a switched choice mechanism for inclusion of some elements. Motivation for using these primitives is to improve performance through greater search efficiency and thereby to reduce computational effort. As a proof of concept for this approach, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

LNCS 2724, p. 1764 ff.

Full article in PDF

lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003