2003
DOI: 10.1007/3-540-45110-2_68
|View full text |Cite
|
Sign up to set email alerts
|

Dense and Switched Modular Primitives for Bond Graph Model Design

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2006
2006
2019
2019

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…In that approach, the GP functions for topological operation included {Insert_J0/J1, Add_C/I/R, and Replace_C/I/R}, which allowed evolution of a large variety of bond graph topologies. The shortcoming of this approach is that it tended to evolve redundant and sometimes causally ill-posed bond graphs [48]. Later, we used a causally well-posed modular GP function set to evolve more concise bond graphs with much less redundancy [45].…”
Section: Evolving Analog Filters Using Bond Graphs and Gp: The Gpbg Fmentioning
confidence: 99%
“…In that approach, the GP functions for topological operation included {Insert_J0/J1, Add_C/I/R, and Replace_C/I/R}, which allowed evolution of a large variety of bond graph topologies. The shortcoming of this approach is that it tended to evolve redundant and sometimes causally ill-posed bond graphs [48]. Later, we used a causally well-posed modular GP function set to evolve more concise bond graphs with much less redundancy [45].…”
Section: Evolving Analog Filters Using Bond Graphs and Gp: The Gpbg Fmentioning
confidence: 99%
“…In that approach, the GP functions for topological operation included fInsert_J0/J1, Add_C/I/R, and Replace_C/I/Rg, which allowed evolution of a large variety of bond graph topologies; see Figures 7 and 8. The shortcoming of this approach is that it tended to evolve redundant and sometimes causally ill-posed bond graphs (Seo et al, 2003a). Later, we used a causally wellposed modular GP function set to evolve more concise bond graphs with much less redundancy (Hu et al, 2004).…”
Section: Evolving Dynamic Systems Using Bond Graphs and Gp: The Gpbg mentioning
confidence: 99%
“…Instead of using electrical circuits and block diagrams in our previous work, we developed a GP-based framework for automated synthesis of mechatronic systems using bond graphs as the modeling scheme. The so-called GPBG approach has been applied to automated synthesis of analog filters (Fan et al, 2001), redesign of an old-fashioned mechanical printer (Seo et al, 2002) and pump (Seo et al, 2003 b ), automated synthesis of MEMS systems (Fan et al, 2004), and synthesis of robust analog filter circuits (Hu et al, 2005). However, no attempt has been made to duplicate or compare with designs invented by experts.…”
Section: Related Workmentioning
confidence: 99%