Abstract
This paper discusses two feasibility studies of Genetic Programming (GP) to the field of control theory, GP being a method inspired from nature where the goal is to create a computer program automatically from high-level statements of problems' requirements. The first feasibility study derives from stability theory and deals with evolving a program that can solve discrete-time Lyapunov equations. The second application of GP tackles the problem of producing a self-evolved Model Reference Adaptive System (MRAS). Basic structure of the programs used in the experiments are only marginally different, yet applied to seemingly quite different problems. In the first feasibility study, it was observed that GP, beside correct usage of global variables, could also purposely arrange mathematical functions and operations in an iterative manner without being explicitly programmed for the task. In the second feasibility study, a controller was evolved for a second-order process based on a pre-defined reference model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
