• Title/Summary/Keyword: and Algorithm

Search Result 60,269, Processing Time 0.061 seconds

Path-finding Algorithm using Heuristic-based Genetic Algorithm (휴리스틱 기반의 유전 알고리즘을 활용한 경로 탐색 알고리즘)

  • Ko, Jung-Woon;Lee, Dong-Yeop
    • Journal of Korea Game Society
    • /
    • v.17 no.5
    • /
    • pp.123-132
    • /
    • 2017
  • The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

Design of a New VSS-Adaptive Filter for a Potential Application of Active Noise Control to Intake System (흡기계 능동소음제어를 위한 적응형 필터 알고리즘의 개발)

  • Kim, Eui-Youl;Kim, Byung-Hyun;Kim, Ho-Wuk;Lee, Sang-Kwon
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.22 no.2
    • /
    • pp.146-155
    • /
    • 2012
  • The filtered-x LMS(FX-LMS) algorithm has been applied to the active noise control(ANC) system in an acoustic duct. This algorithm is designed based on the FIR(finite impulse response) filter, but it has a slow convergence problem because of a large number of zero coefficients. In order to improve the convergence performance, the step size of the LMS algorithm was modified from fixed to variable. However, this algorithm is still not suitable for the ANC system of a short acoustic duct since the reference signal is affected by the backward acoustic wave propagated from a secondary source. Therefore, the recursive filtered-u LMS algorithm(FU-LMS) based on infinite impulse response(IIR) is developed by considering the backward acoustic propagation. This algorithm, unfortunately, generally has a stability problem. The stability problem was improved by using an error smoothing filter. In this paper, the recursive LMS algorithm with variable step size and smoothing error filter is designed. This recursive LMS algorithm, called FU-VSSLMS algorithm, uses an IIR filter. With fast convergence and good stability, this algorithm is suitable for the ANC system in a short acoustic duct such as the intake system of an automotive. This algorithm is applied to the ANC system of a short acoustic duct. The disturbance signals used as primary noise source are a sinusoidal signal embedded in white noise and the chirp signal of which the instantaneous frequency is variable. Test results demonstrate that the FU-VSSLMS algorithm has superior convergence performance to the FX-LMS algorithm and FX-LMS algorithm. It is successfully applied to the ANC system in a short duct.

Energy Bounding Algorithm for Stable Haptic Interaction

  • Kim, Jong-Phil;Ryu, Je-Ha
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2765-2770
    • /
    • 2003
  • This paper introduces a novel control algorithm, energy bounding algorithm, for stable haptic interaction. The energy bounding algorithm restricts energy generated by zero-order hold within consumable energy by physical damping that is energy consumption element in the haptic interface. The passivity condition can always be guaranteed by the energy bounding algorithm. The virtual coupling algorithm restricts the actuator force with respect to the penetration depth and restricts generated energy. In contrast, energy bounding algorithm restricts the change of actuator force with respect to time and restricts generated energy by zero-order hold. Therefore, much stiffer contact simulation can be implemented by the energy bounding algorithm. Moreover, the energy bounding algorithm doesn’t is not computationally intensive and the implementation of it is very simple.

  • PDF

An Improved Distributed Algorithm for Delay-Constrained Unicast Routing (개선된 분산 Delay-Constrained Unicast Routing 알고리듬)

  • Zhou, Xiao-Zheng;Suh, Hee-Jong
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.109-112
    • /
    • 2005
  • In this paper, we propose an improved delay-constrained unicast routing (I-DCUR) algorithm for real-time networks which is based on the delay-constrained unicast routing (DCUR) algorithm. Our I-DCUR algorithm is quite different from DCUR algorithm, because the node will choose the link between the active node and the previous node, and it will replace the original loop path when it detects a loop. Thus, firstly consider to choose the link between the active node and the previous node to replace the original loop path when a node detects a loop. So our algorithm can make the construction of path more efficiently, as compared to DCUR algorithm. We could see that the performance of I-DCUR algorithm is much better than DCUR algorithm in the experimental results. There were over 40% improvement in 100 nodes, 60% in 200 nodes, and 9% reduction of costs.

  • PDF

The research of new algorithm to improve prediction accuracy of recommender system in electronic commercey

  • Kim, Sun-Ok
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.1
    • /
    • pp.185-194
    • /
    • 2010
  • In recommender systems which are used widely at e-commerce, collaborative filtering needs the information of user-ratings and neighbor user-ratings. These are an important value for recommendation in recommender systems. We investigate the in-formation of rating in NBCFA (neighbor Based Collaborative Filtering Algorithm), we suggest new algorithm that improve prediction accuracy of recommender system. After we analyze relations between two variable and Error Value (EV), we suggest new algorithm and apply it to fitted line. This fitted line uses Least Squares Method (LSM) in Exploratory Data Analysis (EDA). To compute the prediction value of new algorithm, the fitted line is applied to experimental data with fitted function. In order to confirm prediction accuracy of new algorithm, we applied new algorithm to increased sparsity data and total data. As a result of study, the prediction accuracy of recommender system in the new algorithm was more improved than current algorithm.

Quantum-behaved Electromagnetism-like Mechanism Algorithm for Economic Load Dispatch of Power System

  • Zhisheng, Zhang;Wenjie, Gong;Xiaoyan, Duan
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1415-1421
    • /
    • 2015
  • This paper presents a new algorithm called Quantum-behaved Electromagnetism-like Mechanism Algorithm which is used to solve economic load dispatch of power system. Electromagnetism-like mechanism algorithm simulates attraction and repulsion mechanism for particles in the electromagnetic field. Every solution is a charged particle, and it move to optimum solution according to certain criteria. Quantum-behaved electromagnetism-like mechanism algorithm merges quantum computing theory with electromagnetism-like mechanism algorithm. Superposition characteristic of quantum methodology can make a single particle present several states, and the characteristic potentially increases population diversity. Probability representation of quantum methodology is to make particle state be presented according to a certain probability. And the quantum rotation gates are used to realize update operation of particles. The algorithm is tested for 13-generator system and 40-generator system, which validates it can effectively solve economic load dispatch problem. Through performance comparison, it is obvious the solution is superior to other optimization algorithm.

A Novel Maximum Power Point Tracking Control Algorithm for Photovoltaic System (태양광 발전 시스템을 위한 새로운 최대 출력점 추종 제어 알고리즘)

  • Kim, Tae-Yeop;Lee, Yun-Gyu;An, Ho-Gyun;Park, Seung-Gyu
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.51 no.3
    • /
    • pp.133-141
    • /
    • 2002
  • Most maximum power point tracking(MPPT) control algorithm is based on Perturb and Observe(P&O) and Incremental Conductance(IncCond). In comparison with P&O and IncCond algorithm, the dynamic and tracking characteristic of IncCond algorithm is better than P&O algorithm in condition of rapidly changing solar radiation. But in the case of digital implementation, the InCond algorithm has error en decision of maximum power operation point(MPOP). To solve this problem, this paper proposes a improved IncCond algorithm, which can determine the MPOP correctly by inserting the test signal in control input. This paper proposes a novel MPPT control algorithm for the digitally implemented photovoltaic system in condition of rapidly changing solar radiation. To verify the validity of the proposed control algorithm. the computer simulation and experiment are carried out.

A Study on the Optimal Facility Layout Design Using an Improved Genetic Algorithm (개선된 유전자 알고리즘을 이용한 최적 공간 배치 설계에 관한 연구)

  • 한성남;이규열;노명일
    • Korean Journal of Computational Design and Engineering
    • /
    • v.6 no.3
    • /
    • pp.174-183
    • /
    • 2001
  • This study proposes an improved genetic algorithm (GA) to derive solutions for facility layout problems having inner walls and passages. The proposed algorithm models the layout of facilities on a flour-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities are calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared to an actual ship compartment layout.

  • PDF

The Intelligent Control Algorithm of a Transformer Cooling System (변압기 냉각시스템의 지능제어알고리즘)

  • Han, Do-Young;Won, Jae-Young
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.22 no.8
    • /
    • pp.515-522
    • /
    • 2010
  • In order to improve the efficiency of a transformer cooling system, the intelligent algorithm was developed. The intelligent algorithm is composed of a setpoint algorithm and a control algorithm. The setpoint algorithm was developed by the neural network, and the control algorithm was developed by the fuzzy logic. These algorithms were used for the control of a blower and an oil pump of the transformer cooling system. In order to analyse performances of these algorithms, the dynamic model of a transformer cooling system was used. Based on various performance tests, energy savings and stable controls of a transformer cooling system were observed. Therefore, control algorithms developed for this study may be effectively used for the control of a transformer cooling system.

Development of Electrocardiogram Identification Algorithm using SVM classifier (SVM분류기를 이용한 심전도 개인인식 알고리즘 개발)

  • Lee, Sang-Joon;Lee, Myoung-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.3
    • /
    • pp.654-661
    • /
    • 2011
  • This paper is about a personal identification algorithm using an ECG that has been studied by a few researchers recently. Previously published algorithm can be classified as two methods. One is the method that analyzes of ECG features and the other is the morphological analysis of ECG. The main characteristic of proposed algorithm can be classified the method of analysis ECG features. Proposed algorithm adopts DSTW(Down Slope Trace Wave) for extracting ECG features, and applies SVM(Support Vector Machine) to training and testing as a classifier algorithm. We choose 18 ECG files from MIT-BIH Normal Sinus Rhythm Database for estimating of algorithm performance. The algorithm extracts 100 heartbeats from each ECG file, and use 40 heartbeats for training and 60 heartbeats for testing. The proposed algorithm shows clearly superior performance in all ECG data, amounting to 93.89% heartbeat recognition rate and 100% ECG recognition rate.