• Title/Summary/Keyword: experience-based learning algorithm

Search Result 65, Processing Time 0.022 seconds

Neuro-Fuzzy Algorithm for Nuclear Reactor Power Control : Part I

  • Chio, Jung-In;Hah, Yung-Joon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.5 no.3
    • /
    • pp.52-63
    • /
    • 1995
  • A neuro-fuzzy algorithm is presented for nuclear reactor power control in a pressurized water reactor. Automatic reacotr power control is complicated by the use of control rods because of highly nonlinear dynamics in the axial power shape. Thus, manual shaped controls are usually employed even for the limited capability during the power maneuvers. In an attempt to achieve automatic shape control, a neuro-fuzzy approach is considered because fuzzy algorithms are good at various aspects of operator's knowledge representation while neural networks are efficinet structures capable of learning from experience and adaptation to a changing nuclear core state. In the proposed neuro-fuzzy control scheme, the rule base is formulated based ona multi-input multi-output system and the dynamic back-propagation is used for learning. The neuro-fuzzy powere control algorithm has been tested using simulation fesponses of a Korean standard pressurized water reactor. The results illustrate that the proposed control algorithm would be a parctical strategy for automatic nuclear reactor power control.

  • PDF

Deep Q-Network based Game Agents (심층 큐 신경망을 이용한 게임 에이전트 구현)

  • Han, Dongki;Kim, Myeongseop;Kim, Jaeyoun;Kim, Jung-Su
    • The Journal of Korea Robotics Society
    • /
    • v.14 no.3
    • /
    • pp.157-162
    • /
    • 2019
  • The video game Tetris is one of most popular game and it is well known that its game rule can be modelled as MDP (Markov Decision Process). This paper presents a DQN (Deep Q-Network) based game agent for Tetris game. To this end, the state is defined as the captured image of the Tetris game board and the reward is designed as a function of cleared lines by the game agent. The action is defined as left, right, rotate, drop, and their finite number of combinations. In addition to this, PER (Prioritized Experience Replay) is employed in order to enhance learning performance. To train the network more than 500000 episodes are used. The game agent employs the trained network to make a decision. The performance of the developed algorithm is validated via not only simulation but also real Tetris robot agent which is made of a camera, two Arduinos, 4 servo motors, and artificial fingers by 3D printing.

A Radiomics-based Unread Cervical Imaging Classification Algorithm (자궁경부 영상에서의 라디오믹스 기반 판독 불가 영상 분류 알고리즘 연구)

  • Kim, Go Eun;Kim, Young Jae;Ju, Woong;Nam, Kyehyun;Kim, Soonyung;Kim, Kwang Gi
    • Journal of Biomedical Engineering Research
    • /
    • v.42 no.5
    • /
    • pp.241-249
    • /
    • 2021
  • Recently, artificial intelligence for diagnosis system of obstetric diseases have been actively studied. Artificial intelligence diagnostic assist systems, which support medical diagnosis benefits of efficiency and accuracy, may experience problems of poor learning accuracy and reliability when inappropriate images are the model's input data. For this reason, before learning, We proposed an algorithm to exclude unread cervical imaging. 2,000 images of read cervical imaging and 257 images of unread cervical imaging were used for this study. Experiments were conducted based on the statistical method Radiomics to extract feature values of the entire images for classification of unread images from the entire images and to obtain a range of read threshold values. The degree to which brightness, blur, and cervical regions were photographed adequately in the image was determined as classification indicators. We compared the classification performance by learning read cervical imaging classified by the algorithm proposed in this paper and unread cervical imaging for deep learning classification model. We evaluate the classification accuracy for unread Cervical imaging of the algorithm by comparing the performance. Images for the algorithm showed higher accuracy of 91.6% on average. It is expected that the algorithm proposed in this paper will improve reliability by effectively excluding unread cervical imaging and ultimately reducing errors in artificial intelligence diagnosis.

A Study on the Characteristics of AI Fashion based on Emotions -Focus on the User Experience- (감성을 기반으로 하는 AI 패션 특성 연구 -사용자 중심(UX) 관점으로-)

  • Kim, Minsun;Kim, Jinyoung
    • Journal of Fashion Business
    • /
    • v.26 no.1
    • /
    • pp.1-15
    • /
    • 2022
  • Digital transformation has induced changes in human life patterns; consumption patterns are also changing to digitalization. Entering the era of industry 4.0 with the 4th industrial revolution, it is important to pay attention to a new paradigm in the fashion industry, the shift from developer-centered to user-centered in the era of the 3rd industrial revolution. The meaning of storing users' changing life and consumption patterns and analyzing stored big data are linked to consumer sentiment. It is more valuable to read emotions, then develop and distribute products based on them, rather than developer-centered processes that previously started in the fashion market. An AI(Artificial Intelligence) deep learning algorithm that analyzes user emotion big data from user experience(UX) to emotion and uses the analyzed data as a source has become possible. By combining AI technology, the fashion industry can develop various new products and technologies that meet the functional and emotional aspects required by consumers and expect a sustainable user experience structure. This study analyzes clear and useful user experience in the fashion industry to derive the characteristics of AI algorithms that combine emotions and technologies reflecting users' needs and proposes methods that can be used in the fashion industry. The purpose of the study is to utilize information analysis using big data and AI algorithms so that structures that can interact with users and developers can lead to a sustainable ecosystem. Ultimately, it is meaningful to identify the direction of the optimized fashion industry through user experienced emotional fashion technology algorithms.

Design of Immersive Walking Interaction Using Deep Learning for Virtual Reality Experience Environment of Visually Impaired People (시각 장애인 가상현실 체험 환경을 위한 딥러닝을 활용한 몰입형 보행 상호작용 설계)

  • Oh, Jiseok;Bong, Changyun;Kim, Jinmo
    • Journal of the Korea Computer Graphics Society
    • /
    • v.25 no.3
    • /
    • pp.11-20
    • /
    • 2019
  • In this study, a novel virtual reality (VR) experience environment is proposed for enabling walking adaptation of visually impaired people. The core of proposed VR environment is based on immersive walking interactions and deep learning based braille blocks recognition. To provide a realistic walking experience from the perspective of visually impaired people, a tracker-based walking process is designed for determining the walking state by detecting marching in place, and a controller-based VR white cane is developed that serves as the walking assistance tool for visually impaired people. Additionally, a learning model is developed for conducting comprehensive decision-making by recognizing and responding to braille blocks situated on roads that are followed during the course of directions provided by the VR white cane. Based on the same, a VR application comprising an outdoor urban environment is designed for analyzing the VR walking environment experience. An experimental survey and performance analysis were also conducted for the participants. Obtained results corroborate that the proposed VR walking environment provides a presence of high-level walking experience from the perspective of visually impaired people. Furthermore, the results verify that the proposed learning algorithm and process can recognize braille blocks situated on sidewalks and roadways with high accuracy.

A Cellular Learning Strategy for Local Search in Hybrid Genetic Algorithms (복합 유전자 알고리즘에서의 국부 탐색을 위한 셀룰러 학습 전략)

  • Ko, Myung-Sook;Gil, Joon-Min
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.669-680
    • /
    • 2001
  • Genetic Algorithms are optimization algorithm that mimics biological evolution to solve optimization problems. Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex fitness landscapes. Hybrid genetic algorithm that is combined with local search called learning can sustain the balance between exploration and exploitation. The genetic traits that each individual in the population learns through evolution are transferred back to the next generation, and when this learning is combined with genetic algorithm we can expect the improvement of the search speed. This paper proposes a genetic algorithm based Cellular Learning with accelerated learning capability for function optimization. Proposed Cellular Learning strategy is based on periodic and convergent behaviors in cellular automata, and on the theory of transmitting to offspring the knowledge and experience that organisms acquire in their lifetime. We compared the search efficiency of Cellular Learning strategy with those of Lamarckian and Baldwin Effect in hybrid genetic algorithm. We showed that the local improvement by cellular learning could enhance the global performance higher by evaluating their performance through the experiment of various test bed functions and also showed that proposed learning strategy could find out the better global optima than conventional method.

  • PDF

PESA: Prioritized experience replay for parallel hybrid evolutionary and swarm algorithms - Application to nuclear fuel

  • Radaideh, Majdi I.;Shirvan, Koroush
    • Nuclear Engineering and Technology
    • /
    • v.54 no.10
    • /
    • pp.3864-3877
    • /
    • 2022
  • We propose a new approach called PESA (Prioritized replay Evolutionary and Swarm Algorithms) combining prioritized replay of reinforcement learning with hybrid evolutionary algorithms. PESA hybridizes different evolutionary and swarm algorithms such as particle swarm optimization, evolution strategies, simulated annealing, and differential evolution, with a modular approach to account for other algorithms. PESA hybridizes three algorithms by storing their solutions in a shared replay memory, then applying prioritized replay to redistribute data between the integral algorithms in frequent form based on their fitness and priority values, which significantly enhances sample diversity and algorithm exploration. Additionally, greedy replay is used implicitly to improve PESA exploitation close to the end of evolution. PESA features in balancing exploration and exploitation during search and the parallel computing result in an agnostic excellent performance over a wide range of experiments and problems presented in this work. PESA also shows very good scalability with number of processors in solving an expensive problem of optimizing nuclear fuel in nuclear power plants. PESA's competitive performance and modularity over all experiments allow it to join the family of evolutionary algorithms as a new hybrid algorithm; unleashing the power of parallel computing for expensive optimization.

Class Imbalance Resolution Method and Classification Algorithm Suggesting Based on Dataset Type Segmentation (데이터셋 유형 분류를 통한 클래스 불균형 해소 방법 및 분류 알고리즘 추천)

  • Kim, Jeonghun;Kwahk, Kee-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.28 no.3
    • /
    • pp.23-43
    • /
    • 2022
  • In order to apply AI (Artificial Intelligence) in various industries, interest in algorithm selection is increasing. Algorithm selection is largely determined by the experience of a data scientist. However, in the case of an inexperienced data scientist, an algorithm is selected through meta-learning based on dataset characteristics. However, since the selection process is a black box, it was not possible to know on what basis the existing algorithm recommendation was derived. Accordingly, this study uses k-means cluster analysis to classify types according to data set characteristics, and to explore suitable classification algorithms and methods for resolving class imbalance. As a result of this study, four types were derived, and an appropriate class imbalance resolution method and classification algorithm were recommended according to the data set type.

Search of Optimal Path and Implementation using Network based Reinforcement Learning Algorithm and sharing of System Information (네트워크기반의 강화학습 알고리즘과 시스템의 정보공유화를 이용한 최단경로의 검색 및 구현)

  • Min, Seong-Joon;Oh, Kyung-Seok;Ahn, June-Young;Heo, Hoon
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.174-176
    • /
    • 2005
  • This treatise studies composing process that renew information mastered by interactive experience between environment and system via network among individuals. In the previous study map information regarding free space is learned by using of reinforced learning algorithm, which enable each individual to construct optimal action policy. Based on those action policy each individuals can obtain optimal path. Moreover decision process to distinguish best optimal path by comparing those in the network composed of each individuals is added. Also information about the finally chosen path is being updated. A self renewing method of each system information by sharing the each individual data via network is proposed Data enrichment by shilling the information of many maps not in the single map is tried Numerical simulation is conducted to confirm the propose concept. In order to prove its suitability experiment using micro-mouse by integrating and comparing the information between individuals is carried out in various types of map to reveal successful result.

  • PDF

System simulation and synchronization for optimal evolutionary design of nonlinear controlled systems

  • Chen, C.Y.J.;Kuo, D.;Hsieh, Chia-Yen;Chen, Tim
    • Smart Structures and Systems
    • /
    • v.26 no.6
    • /
    • pp.797-807
    • /
    • 2020
  • Due to the influence of nonlinearity and time-variation, it is difficult to establish an accurate model of concrete frame structures that adopt active controllers. Fuzzy theory is a relatively appropriate method but susceptible to human subjective experience to decrease the performance. This paper proposes a novel artificial intelligence based EBA (Evolved Bat Algorithm) controller with machine learning matched membership functions in the complex nonlinear system. The proposed affine transformed membership functions are adopted and stabilization and performance criterion of the closed-loop fuzzy systems are obtained through a new parametrized linear matrix inequality which is rearranged by machine learning affine matched membership functions. The trajectory of the closed-loop dithered system and that of the closed-loop fuzzy relaxed system can be made as close as desired. This enables us to get a rigorous prediction of stability of the closed-loop dithered system by establishing that of the closed-loop fuzzy relaxed system.