Maintenance Memories: Beyond Concepts and Techniques for Case Base Maintenance

Author(s):  
Ioannis Iglezakis ◽  
Thomas Reinartz ◽  
Thomas R. Roth-Berghofer
Keyword(s):  
2010 ◽  
Vol 97-101 ◽  
pp. 3714-3717 ◽  
Author(s):  
Wei Yan ◽  
Qi Gao ◽  
Zheng Gang Liu ◽  
Shan Hui Zhang ◽  
Yu Ping Hu

An improved multi-group self-adaptive evolutionary programming Algorithm is used to get adapt attribute weight for CBR system. Firstly, this paper analyses the adaptability function based on reference case base REF and testing case base TEST, develops a novel Bi-group self-adaptive evolutionary programming that overcome the lack of conventional evolutionary programming. In this Novel algorithm, evolution of Cauchy operator and Gauss operator are parallel performed with different mutation strategies, and the Gauss operator owns the ability of self-adaptation according to the variation of adaptability function. Information is exchanged when sub-groups are reorganized. Experiment results prove the validity of self-adaptive Algorithm and CBR design system is used successfully in engine design process.


Author(s):  
Jose Luis Jorro-Aragoneses ◽  
Guillermo Jimenez-Díaz ◽  
Juan Antonio Recio-García ◽  
Belén Díaz-Agudo

2012 ◽  
Vol 566 ◽  
pp. 572-579
Author(s):  
Abdolkarim Niazi ◽  
Norizah Redzuan ◽  
Raja Ishak Raja Hamzah ◽  
Sara Esfandiari

In this paper, a new algorithm based on case base reasoning and reinforcement learning (RL) is proposed to increase the convergence rate of the reinforcement learning algorithms. RL algorithms are very useful for solving wide variety decision problems when their models are not available and they must make decision correctly in every state of system, such as multi agent systems, artificial control systems, robotic, tool condition monitoring and etc. In the propose method, we investigate how making improved action selection in reinforcement learning (RL) algorithm. In the proposed method, the new combined model using case base reasoning systems and a new optimized function is proposed to select the action, which led to an increase in algorithms based on Q-learning. The algorithm mentioned was used for solving the problem of cooperative Markov’s games as one of the models of Markov based multi-agent systems. The results of experiments Indicated that the proposed algorithms perform better than the existing algorithms in terms of speed and accuracy of reaching the optimal policy.


Author(s):  
Guanghsu A. Chang ◽  
Cheng-Chung Su ◽  
John W. Priest

Artificial intelligence (AI) approaches have been successfully applied to many fields. Among the numerous AI approaches, Case-Based Reasoning (CBR) is an approach that mainly focuses on the reuse of knowledge and experience. However, little work is done on applications of CBR to improve assembly part design. Similarity measures and the weight of different features are crucial in determining the accuracy of retrieving cases from the case base. To develop the weight of part features and retrieve a similar part design, the research proposes using Genetic Algorithms (GAs) to learn the optimum feature weight and employing nearest-neighbor technique to measure the similarity of assembly part design. Early experimental results indicate that the similar part design is effectively retrieved by these similarity measures.


Sign in / Sign up

Export Citation Format

Share Document