Results 1 
2 of
2
Combining BondGraphs with Genetic Programming for Unified/Automated Design of Mechatronic or Multi Domain Dynamic Systems
 Proceedings of Ninth ACM/SIGEVO Genetic and Evolutionary Computation Conference
"... The multi domain nature of a mechatronic system makes it difficult to model using a single modeling technique over the whole system as varying sets of system variables are required. BondGraphs offer an advanced object oriented and polymorphic modeling and simulation technique. BondGraph model of t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The multi domain nature of a mechatronic system makes it difficult to model using a single modeling technique over the whole system as varying sets of system variables are required. BondGraphs offer an advanced object oriented and polymorphic modeling and simulation technique. BondGraph model of the mechatronic system can be directly simulated on a digital computer using simulation softwares like 20Sim © graphically or manipulated mathematically to yield state equations using a simplified set of power and energy variables. The simulation scheme can be augmented to synthesize designs for mechatronic systems employing genetic programming as a tool for open ended search. This research paper presents results of an experiment developed to combine BondGraphs with genetic programming for unified and automated design of mechatronic or multi domain dynamic systems.
AbstractionBased Genetic Programming By
"... This thesis describes a novel method for representing and automatically generating computer programs in an evolutionary computation context. AbstractionBased Genetic Programming (ABGP) is a typed Genetic Programming representation system that uses System F, an expressive λcalculus, to represent th ..."
Abstract
 Add to MetaCart
This thesis describes a novel method for representing and automatically generating computer programs in an evolutionary computation context. AbstractionBased Genetic Programming (ABGP) is a typed Genetic Programming representation system that uses System F, an expressive λcalculus, to represent the computational components from which the evolved programs are assembled. ABGP is based on the manipulation of closed, independent modules expressing computations with effects that have the ability to affect the whole genotype. These modules are plugged into other modules according to precisely defined rules to form complete computer programs. The use of System F allows the straightforward representation and use of many typical computational structures and behaviors (such as iteration, recursion, lists and trees) in modular form. This is done without introducing additional external symbols in the set of predefined functions and terminals of the system. In fact, programming structures typically included in GP terminal sets, such as if then else, may be removed and represented as abstractions in ABGP for the same problems. ABGP also provides a search space partitioning system based on the structure of the genotypes, similar to the species partitioning system of living organisms and derived from the CurryHoward isomorphism. This thesis also presents the results obtained by applying this method to a set of problems. Acknowledgments I would not have been able to complete this work without the encouragements, trust and support of my