Using Q-Learning and Genetic Algorithms to Improve the Efficiency of Weight Adjustments for Optimal Control and Design Problems

2007 ◽  
Vol 7 (4) ◽  
pp. 302-308 ◽  
Author(s):  
Kaivan Kamali ◽  
L. J. Jiang ◽  
John Yen ◽  
K. W. Wang

In traditional optimal control and design problems, the control gains and design parameters are usually derived to minimize a cost function reflecting the system performance and control effort. One major challenge of such approaches is the selection of weighting matrices in the cost function, which are usually determined via trial-and-error and human intuition. While various techniques have been proposed to automate the weight selection process, they either can not address complex design problems or suffer from slow convergence rate and high computational costs. We propose a layered approach based on Q-learning, a reinforcement learning technique, on top of genetic algorithms (GA) to determine the best weightings for optimal control and design problems. The layered approach allows for reuse of knowledge. Knowledge obtained via Q-learning in a design problem can be used to speed up the convergence rate of a similar design problem. Moreover, the layered approach allows for solving optimizations that cannot be solved by GA alone. To test the proposed method, we perform numerical experiments on a sample active-passive hybrid vibration control problem, namely adaptive structures with active-passive hybrid piezoelectric networks. These numerical experiments show that the proposed Q-learning scheme is a promising approach for automation of weight selection for complex design problems.

Author(s):  
Kaivan Kamali ◽  
Lijun Jiang ◽  
John Yen ◽  
K. W. Wang

In traditional optimal control and design problems, the control gains and design parameters are usually derived to minimize a cost function reflecting the system performance and control effort. One major challenge of such approaches is the selection of weighting matrices in the cost function, which are usually determined via trial and error and human intuition. While various techniques have been proposed to automate the weight selection process, they either can not address complex design problems or suffer from slow convergence rate and high computational costs. We propose a layered approach based on Q-learning, a reinforcement learning technique, on top of genetic algorithms (GA) to determine the best weightings for optimal control and design problems. The layered approach allows for reuse of knowledge. Knowledge obtained via Q-learning in a design problem can be used to speed up the convergence rate of a similar design problem. Moreover, the layered approach allows for solving optimizations that cannot be solved by GA alone. To test the proposed method, we perform numerical experiments on a sample active-passive hybrid vibration control problem, namely adaptive structures with active-passive hybrid piezoelectric networks (APPN). These numerical experiments show that the proposed Q-learning scheme is a promising approach for.


Author(s):  
Nathan J. Adams ◽  
Georges M. Fadel

Abstract Configuration design is the process of placing components, without altering their shape or connectivity, into an available space, while satisfying various spatial constraints, such as no component overlap. Minimizing the volume occupied by the components and or maximizing the accessibility of the components are just two examples of the many objectives that can drive a configuration design problem. For complex configuration designs, there can be many objectives, which can impose spatial constraints among the components and increase the design complexity, cycle cost, and time. An iterative procedure becomes necessary to reconcile these spatial constraints. To reach solutions that are optimal, these constraints must be reordered else combinatorial methods such as Genetic Algorithms that are used for such problems do not converge. Successful reordering can make complex configuration design problems easier to solve by minimizing the iterations necessary to reach an acceptable solution. Minimizing iterations translates into faster convergence and thus savings on time and money. This paper presents a methodology that can manage the propagation of spatial constraints in complex configuration design problems. Representative examples are shown and results and conclusions are drawn.


Author(s):  
Matthew D. Bauer ◽  
David W. Rosen

Abstract In engineering design, many design problems have multiple constraints and objectives, which may be nondifferentiable. For this problem type, only zero-order solution methods are applicable. In this paper, we present a relaxed lexicographic pattern search method for solving this design problem type, where the objectives are preferenced in either an Archimedean or preemptive formulation. The Hooke-Jeeves (HJ) pattern search method is the basis of this method, which is implemented as the MORPS (Multi-Objective Randomized Pattern Search) algorithm. The HJ pattern search method is used because it requires only function values and has an intuitive graphical interpretation through which to gain insight into the nature of complex design spaces. A relatively new class of simultaneous product/process design problem utilizing virtual prototypes to support design for disassembly is introduced to motivate the need for the MORPS algorithm. An example, based on the design of an automotive center console for disassembly, illustrates the application of the MORPS algorithm.


Author(s):  
Lata Nautiyal ◽  
Preeti Shivach ◽  
Mangey Ram

With the advancement in contemporary computational and modeling skills, engineering design completely depends upon on variety of computer modeling and simulation tools to hasten the design cycles and decrease the overall budget. The most difficult design problem will include various design parameters along with the tables. Finding out the design space and ultimate solutions to those problems are still biggest challenges for the area of complex systems. This chapter is all about suggesting the use of Genetic Algorithms to enhance maximum engineering design problems. The chapter recommended that Genetic Algorithms are highly useful to increase the High-Performance Areas for Engineering Design. This chapter is established to use Genetic Algorithms to large number of design areas and delivered a comprehensive conversation on the use, scope and its applications in mechanical engineering.


Author(s):  
Lata Nautiyal ◽  
Preeti Shivach ◽  
Mangey Ram

With the advancement in contemporary computational and modeling skills, engineering design completely depends upon on variety of computer modeling and simulation tools to hasten the design cycles and decrease the overall budget. The most difficult design problem will include various design parameters along with the tables. Finding out the design space and ultimate solutions to those problems are still biggest challenges for the area of complex systems. This chapter is all about suggesting the use of Genetic Algorithms to enhance maximum engineering design problems. The chapter recommended that Genetic Algorithms are highly useful to increase the High-Performance Areas for Engineering Design. This chapter is established to use Genetic Algorithms to large number of design areas and delivered a comprehensive conversation on the use, scope and its applications in mechanical engineering.


2020 ◽  
Vol 15 ◽  
pp. 48
Author(s):  
J. Frédéric Bonnans ◽  
Justina Gianatti

We propose a model for the COVID-19 epidemic where the population is partitioned into classes corresponding to ages (that remain constant during the epidemic). The main feature is to take into account the infection age of the infected population. This allows to better simulate the infection propagation that crucially depend on the infection age. We discuss how to estimate the coefficients from data available in the future, and introduce a confinement variable as control. The cost function is a compromise between a confinement term, the hospitalization peak and the death toll. Our numerical experiments allow to evaluate the interest of confinement varying with age classes.


2021 ◽  
Vol 11 (2) ◽  
pp. 850
Author(s):  
Dokkyun Yi ◽  
Sangmin Ji ◽  
Jieun Park

Artificial intelligence (AI) is achieved by optimizing the cost function constructed from learning data. Changing the parameters in the cost function is an AI learning process (or AI learning for convenience). If AI learning is well performed, then the value of the cost function is the global minimum. In order to obtain the well-learned AI learning, the parameter should be no change in the value of the cost function at the global minimum. One useful optimization method is the momentum method; however, the momentum method has difficulty stopping the parameter when the value of the cost function satisfies the global minimum (non-stop problem). The proposed method is based on the momentum method. In order to solve the non-stop problem of the momentum method, we use the value of the cost function to our method. Therefore, as the learning method processes, the mechanism in our method reduces the amount of change in the parameter by the effect of the value of the cost function. We verified the method through proof of convergence and numerical experiments with existing methods to ensure that the learning works well.


2014 ◽  
Vol 643 ◽  
pp. 237-242 ◽  
Author(s):  
Tahari Abdou El Karim ◽  
Bendakmousse Abdeslam ◽  
Ait Aoudia Samy

The image registration is a very important task in image processing. In the field of medical imaging, it is used to compare the anatomical structures of two or more images taken at different time to track for example the evolution of a disease. Intensity-based techniques are widely used in the multi-modal registration. To have the best registration, a cost function expressing the similarity between these images is maximized. The registration problem is reduced to the optimization of a cost function. We propose to use neighborhood meta-heuristics (tabu search, simulated annealing) and a meta-heuristic population (genetic algorithms). An evaluation step is necessary to estimate the quality of registration obtained. In this paper we present some results of medical image registration


Sign in / Sign up

Export Citation Format

Share Document