Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Dense and Switched Modular Primitives for Bond Graph Model Design

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2724))

Included in the following conference series:

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 preassembling 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Youcef-Toumi, K.: Modeling, Design, and Control Integration: A necessary Step in Mechatronics. IEEE/ASME Trans. Mechatronics, vol. 1, no.1, (1996) 29–38

    Article  Google Scholar 

  2. Koza, J.R., Bennett, F. H., Andre, D., Keane, M.A., Dunlap, F.: Automated Synthesis of Analog Electrical Circuits by Means of Genetic Programming. IEEE Trans. Evolutionary Computation, vol. 1. no. 2. (1997) 109–128.

    Article  Google Scholar 

  3. Koza, J.R., Bennett F.H., Andre D., Keane M.A., Genetic Programming III, Darwinian Invention and Problem Solving. Morgan Kaufmann Publishers, (1999)

    Google Scholar 

  4. Seo K., Goodman, E., Rosenberg, R.C.: First Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic Programming. Proc. Genetic and Evolutionary Computation Conference, GECCO-2001, San Francisco (2001) 189

    Google Scholar 

  5. Seo K., Hu, J., Fan, Z., Goodman E.D., Rosenberg R.C.: Automated Design Approaches for Multi-Domain Dynamic Systems Using Bond Graphs and Genetic Programming. Int. Jour. of Computers, Systems and Signals, vol. 3. no. 1. (2002) 55–70

    Google Scholar 

  6. Fan Z., Hu, J., Seo, K., Goodman E.D., Rosenberg R.C., Zhang, B.: Bond Graph Representation and GP for Automated Analog Filter Design. Genetic and Evolutionary Computation Conference Late-Breaking Papers, San Francisco (2001) 81–86

    Google Scholar 

  7. Fan Z., Seo, K., Rosenberg R.C., Hu J., Goodman E.D.: Exploring Multiple Design Topologies using Genetic Programming and Bond Graphs. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2002, NewYork (2002) 1073–1080.

    Google Scholar 

  8. Goodman E.D., Seo, K., Rosenberg R.C., Fan Z., Hu, J.: Automated Design of Mechatronic Systems: Novel Search Methods and Modular Primitives to Enable Real-World Applications. Proc. 2003 NSF Design, Service and Manufacturing Grantees and Research Conference, January, Birmingham, Alabama, (2003)

    Google Scholar 

  9. Hu J., Goodman E.D., Seo, K., Pei, M.: Adaptive Hierarchical Fair Competition (AHFC) Model for Parallel Evolutionary Algorithms. Proc. Genetic and Evolutionary Computation Conference, GECCO-2002, NewYork (2002) 772–779.

    Google Scholar 

  10. Koza, J.R., Genetic Programming II: Automatic Discovery of Reusable Programs. The MIT Press, (1994)

    Google Scholar 

  11. Soule, T., Heckendorn, R.B.: Function Sets in Genetic Programming.: Proc. Genetic and Evolutionary Computation Conference, GECCO-2001, San Francisco (2001) 190

    Google Scholar 

  12. Karnopp, D.C., Rosenberg R.C., Margolis, D.L., System Dynamics, A Unified Approach, 3nd ed., John Wiley & Sons (2000)

    Google Scholar 

  13. Luke S., Strongly-Typed, Multithreaded C Genetic Programming Kernel. http://www.cs.umd.edu/users/seanl/gp/patched-gp/. (1997)

    Google Scholar 

  14. Zongker, D., Punch, W., lil-gp 1.1 User’s Manual. Michigan State University, (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seo, K., Fan, Z., Hu, J., Goodman, E.D., Rosenberg, R.C. (2003). Dense and Switched Modular Primitives for Bond Graph Model Design. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-45110-2_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40603-7

  • Online ISBN: 978-3-540-45110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics