• Title/Summary/Keyword: Changing algorithm

Search Result 1,004, Processing Time 0.027 seconds

Efficiency Analysis of PV Tracking System with PSA Algorithm (PSA 알고리즘에 의한 태양광 추적시스템의 효율분석)

  • Choi, Jung-Sik;Ko, Jae-Sub;Chung, Dong-Hwa
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.23 no.10
    • /
    • pp.36-44
    • /
    • 2009
  • This paper analyzes efficiency of photovoltaic(PV) tracking system using position solar algorithm(PSA). Solar location tracking system is needed for efficiently and intensively using PV system independent of environmental condition. PV tracking system of program method is presented a high tracking accuracy without the wrong operating in rapidly changing insolation by the clouds and atmospheric condition. Therefore, this paper analyzes efficiency of PV system using PSA algorithm for more correct position tracking of solar. Also, controlled altitude angle and azimuth angle by applied algorithm is compared with data of korea astronomy observatory. And this paper analyzes the tracking error and generation efficiency then proves the validity of applied algorithm.

Design and Evaluation of DDoS Attack Detection Algorithm in Voice Network (음성망 환경에서 DDoS 공격 탐지 알고리즘 설계 및 평가)

  • Yun, Sung-Yeol;Kim, Hwan-Kuk;Park, Seok-Cheon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2555-2562
    • /
    • 2009
  • The algorithm that is proposed in this paper defined a probability function to count connection process and connection-end process to apply TRW algorithm to voice network. Set threshold to evaluate the algorithm that is proposed, Based on the type of connection attack traffic changing the probability to measure the effectiveness of the algorithm, and Attack packets based on the speed of attack detection time was measured. At the result of evaluation, proposed algorithm shows that DDoS attack starts at 10 packets per a second and it detects the attack after 1.2 seconds from the start. Moreover, it shows that the algorithm detects the attack in 0.5 second if the packets were 20 per a second.

Behavior Learning and Evolution of Swarm Robot based on Harmony Search Algorithm (Harmony Search 알고리즘 기반 군집로봇의 행동학습 및 진화)

  • Kim, Min-Kyung;Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.3
    • /
    • pp.441-446
    • /
    • 2010
  • Each robot decides and behaviors themselves surrounding circumstances in the swarm robot system. Robots have to conduct tasks allowed through cooperation with other robots. Therefore each robot should have the ability to learn and evolve in order to adapt to a changing environment. In this paper, we proposed learning based on Q-learning algorithm and evolutionary using Harmony Search algorithm and are trying to improve the accuracy using Harmony Search Algorithm, not the Genetic Algorithm. We verify that swarm robot has improved the ability to perform the task.

A DASH System Using the A3C-based Deep Reinforcement Learning (A3C 기반의 강화학습을 사용한 DASH 시스템)

  • Choi, Minje;Lim, Kyungshik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.17 no.5
    • /
    • pp.297-307
    • /
    • 2022
  • The simple procedural segment selection algorithm commonly used in Dynamic Adaptive Streaming over HTTP (DASH) reveals severe weakness to provide high-quality streaming services in the integrated mobile networks of various wired and wireless links. A major issue could be how to properly cope with dynamically changing underlying network conditions. The key to meet it should be to make the segment selection algorithm much more adaptive to fluctuation of network traffics. This paper presents a system architecture that replaces the existing procedural segment selection algorithm with a deep reinforcement learning algorithm based on the Asynchronous Advantage Actor-Critic (A3C). The distributed A3C-based deep learning server is designed and implemented to allow multiple clients in different network conditions to stream videos simultaneously, collect learning data quickly, and learn asynchronously, resulting in greatly improved learning speed as the number of video clients increases. The performance analysis shows that the proposed algorithm outperforms both the conventional DASH algorithm and the Deep Q-Network algorithm in terms of the user's quality of experience and the speed of deep learning.

A Novel and Effective University Course Scheduler Using Adaptive Parallel Tabu Search and Simulated Annealing

  • Xiaorui Shao;Su Yeon Lee;Chang Soo Kim
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.4
    • /
    • pp.843-859
    • /
    • 2024
  • The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.

A Learning-based Visual Inspection System for Part Verification in a Panorama Sunroof Assembly Line using the SVM Algorithm (SVM 학습 알고리즘을 이용한 자동차 썬루프의 부품 유무 비전검사 시스템)

  • Kim, Giseok;Lee, Saac;Cho, Jae-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.12
    • /
    • pp.1099-1104
    • /
    • 2013
  • This paper presents a learning-based visual inspection method that addresses the need for an improved adaptability of a visual inspection system for parts verification in panorama sunroof assembly lines. It is essential to ensure that the many parts required (bolts and nuts, etc.) are properly installed in the PLC sunroof manufacturing process. Instead of human inspectors, a visual inspection system can automatically perform parts verification tasks to assure that parts are properly installed while rejecting any that are improperly assembled. The proposed visual inspection method is able to adapt to changing inspection tasks and environmental conditions through an efficient learning process. The proposed system consists of two major modules: learning mode and test mode. The SVM (Support Vector Machine) learning algorithm is employed to implement part learning and verification. The proposed method is very robust for changing environmental conditions, and various experimental results show the effectiveness of the proposed method.

Development of Genetic Algorithm for Production and Distribution Management in Multiple Supplier Network Environment of Robot Engineering Industry (로봇 산업의 다중 공급망 환경을 고려한 생산 및 분배 관리를 위한 유전 알고리듬 개발)

  • Jo, Sung-Min;Kim, Tai-Young;Hwang, Seung-June
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.2
    • /
    • pp.147-160
    • /
    • 2013
  • Today, the management environments of intelligence firm are changing the way of production planning and logistics management, and are changing the process of supply chain management system. This paper shows the development of information system software for intelligence enterprises is used in supply chain management for robot engineering industry. Specifically, supply chain management system in this paper has been developed to analyze the impact of multi plant and multi distribution environment, showing the process analysis and system development of hierarchical assembly manufacturing industry. In this paper we consider a production planning and distribution management system of intelligence firm in the supply chain. We focus on a capacitated production resource and distribution volume allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using a genetic algorithm to solve it efficiently. This method makes it possible for the population to reach the feasible approximate solution easily. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solution converge to the feasible approximate solution quickly.

Dynamic Optimization of the Traffic Flow of AGVs in an Automated Container Terminal (자동화 컨테이너 터미널의 AGV 교통흐름 동적 최적화)

  • Kim, Hoo-Lim;Choe, Ri;Park, Tae-Jin;Ryu, Kwang-Ryel
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.591-595
    • /
    • 2010
  • In this paper, a method that dynamically adapts the traffic flow of automated guided vehicles (AGVs) used in automated container terminals to the changing operational condition is presented. In a container terminal, the AGVs are vulnerable to traffic congestion because a large number of AGVs operate in a limited area. In addition, dynamically changing operational condition requires the traffic flow of AGVs to be continuously adjusted to keep up with the change. The proposed method utilizes a genetic algorithm to optimize the traffic flow. Exploiting the dynamic nature of the problem an approach that reuses the results of the previous search is tried to speed up the convergence of the genetic algorithm. The results of simulation experiments show the efficiency of the proposed method.

On Designing a Robust Control System Using Immune Algorithm (면역 알고리즘을 이용한 강건한 제어 시스템 설계)

  • Seo, Jae-Yong;Won, Kyoung-Jae;Kim, Seong-Hyun;Cho, Hyun-Chan;Jeon, Hong-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.6
    • /
    • pp.12-20
    • /
    • 1998
  • As an approach to develope a control system with high robustness in changing control environment conditions, this paper will propose a robust control system, using multilayer neural network and biological immune system. The proposed control system adjusts weights of the multilayer neural network(MNN) with the immune algorithm. This algorithm is made up of two major divisions, the innate immune algorithm as a first line of defence and the adaptive immune algorithm as a barrier of self-adjustment. Using the proposed control system based on immune algorithm, we will work out a design for the controller of a robot manipulator. And we will demonstrate the effectiveness of the control system of robot manipulator with computer simulations.

  • PDF

Optimization of parameters in mobile robot navigation using genetic algorithm (유전자 알고리즘을 이용한 이동 로봇 주행 파라미터의 최적화)

  • 김경훈;조형석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1161-1164
    • /
    • 1996
  • In this paper, a parameter optimization technique for a mobile robot navigation is discussed. Authors already have proposed a navigation algorithm for mobile robots with sonar sensors using fuzzy decision making theory. Fuzzy decision making selects the optimal via-point utilizing membership values of each via-point candidate for fuzzy navigation goals. However, to make a robot successfully navigate through an unknown and cluttered environment, one needs to adjust parameters of membership function, thus changing shape of MF, for each fuzzy goal. Furthermore, the change in robot configuration, like change in sensor arrangement or sensing range, invokes another adjusting of MFs. To accomplish an intelligent way to adjust these parameters, we adopted a genetic algorithm, which does not require any formulation of the problem, thus more appropriate for robot navigation. Genetic algorithm generates the fittest parameter set through crossover and mutation operation of its string representation. The fitness of a parameter set is assigned after a simulation run according to its time of travel, accumulated heading angle change and collision. A series of simulations for several different environments is carried out to verify the proposed method. The results show the optimal parameters can be acquired with this method.

  • PDF