• Title, Summary, Keyword: Algorithm

Search Result 56,586, Processing Time 0.105 seconds

Smooth Walking Robot Using Genetic Algorithm (유전알고리즘을 이용한 유연한 보행로봇)

  • 한경수;김상범;김진걸
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • /
    • pp.450-453
    • /
    • 2002
  • This paper is concerned with smooth walking robot using genetic algorithm. The new walking algorithm is proposed and we simulated and experimented the algorithm. We suggested the leg trajectory algorithm and balancing trajectory algorithm by applying genetic algorithm. First the leg trajectory algorithm generated the smooth trajectory. Also the balancing trajectory generated the optimal trajectory. We compared results with the previous walking algorithm. It showed that the new proposed algorithm generated the better walking trajectory.

  • PDF

Improved Route Search Method Through the Operation Process of the Genetic Algorithm (유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법)

  • Ji, Hong-il;Seo, Chang-jin
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.64 no.4
    • /
    • pp.315-320
    • /
    • 2015
  • Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

Hardware Accelerated Design on Bag of Words Classification Algorithm

  • Lee, Chang-yong;Lee, Ji-yong;Lee, Yong-hwan
    • Journal of Platform Technology
    • /
    • v.6 no.4
    • /
    • pp.26-33
    • /
    • 2018
  • In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.

Efficiency Analysis of Scheduler based on the Division Scheduling Algorithm (분할 스케쥴링 알고리즘에 기반한 스케쥴러의 효율성 분석)

  • 송유진;이종근
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.1
    • /
    • pp.87-95
    • /
    • 2004
  • We proposed the division algorithm that was aimed at dividing system models. It used a transitive matrix to express the relation between place and transition. And the division algorithm was applied to the scheduling problem, with the division-scheduling algorithm. The division-scheduling algorithm was able to calculate the divided subnet table. And it is able to reduce the analysis complexity. In this study, we applied the proposed division algorithm and division-scheduling algorithm to flexible manufacturing system models. We compared the efficiency and performance of the division-scheduling algorithm with the Hillion algorithm, Korbaa algorithm, and Unfolding algorithm proposed in previous researches.

An improved Bellman-Ford algorithm based on SPFA (SPFA를 기반으로 개선된 벨만-포드 알고리듬)

  • Chen, Hao;Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.721-726
    • /
    • 2012
  • In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

Modified Artificial Fish School Algorithm for Free Space Optical Communication with Sensor-Less Adaptive Optics System

  • Cao, Jingtai;Zhao, Xiaohui;Li, Zhaokun;Liu, Wei;Gu, Haijun
    • Journal of the Korean Physical Society
    • /
    • v.71 no.10
    • /
    • pp.636-646
    • /
    • 2017
  • The performance of free space optical (FSO) communication system is limited by atmospheric turbulent extremely. Adaptive optics (AO) is the significant method to overcome the atmosphere disturbance. Especially, for the strong scintillation effect, the sensor-less AO system plays a major role for compensation. In this paper, a modified artificial fish school (MAFS) algorithm is proposed to compensate the aberrations in the sensor-less AO system. Both the static and dynamic aberrations compensations are analyzed and the performance of FSO communication before and after aberrations compensations is compared. In addition, MAFS algorithm is compared with artificial fish school (AFS) algorithm, stochastic parallel gradient descent (SPGD) algorithm and simulated annealing (SA) algorithm. It is shown that the MAFS algorithm has a higher convergence speed than SPGD algorithm and SA algorithm, and reaches the better convergence value than AFS algorithm, SPGD algorithm and SA algorithm. The sensor-less AO system with MAFS algorithm effectively increases the coupling efficiency at the receiving terminal with fewer numbers of iterations. In conclusion, the MAFS algorithm has great significance for sensor-less AO system to compensate atmospheric turbulence in FSO communication system.

A Tunnel Ventilation Control Algorithm by Using CO Density Prediction Algorithm (일산화탄소 농도 예측 기능을 사용한 터널 환기 제어 알고리즘)

  • Han Doyoung;Yoon Jinwon
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.16 no.11
    • /
    • pp.1035-1043
    • /
    • 2004
  • For a long road tunnel, a tunnel ventilation system may be used in order to reduce the pollution level below the required level. To control the tunnel pollution level, a closed loop control algorithm may be used. The feedforward prediction algorithm and the cascade control algorithm were developed to regulate the CO level in a tunnel. The feedforward prediction algorithm composed of the traffic estimation algorithm and the CO density prediction algorithm, and the cascade control algorithm composed of the jet fan control algorithm and the air velocity setpoint algorithm. The verification of control algorithms was carried out by dynamic models developed from the actual tunnel data. The simulation results showed that control algorithms developed for this study were effective for the control of the tunnel ventilation system.

IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM

  • Cho, Gook Hwa;Lee, Hyang-Sook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.2
    • /
    • pp.277-283
    • /
    • 2019
  • In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm by using a smaller base for exponentiation. Our method can reduce the average number of ${\mathbb{F}}_q$ multiplications.

Performance Evaluation of Q-Algorithm with Tag Number Estimation Scheme

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.1
    • /
    • pp.45-50
    • /
    • 2010
  • EPCglobal Class-1 Gen-2 standard proposed Q-algorithm to select a frame size for the next query round. Q-algorithm calculates the frame size without estimating the number of tags. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it is impossible to allocate the optimized frame size. Also. the conventional Q-algorithm does not define an optimized parameter value C for adjusting the frame size. In this paper, we propose a modified Q-algorithm with the tag number estimation scheme, and evaluate the performance with computer simulations.

Acitve Noise Control via Walsh Transform Domain Genetic Algorithm (월쉬변환영역 유전자 알고리즘에 의한 능동소음제어)

  • Yim, Kook-Hyun;Kim, Jong-Boo;Ahn, Doo-Soo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.11
    • /
    • pp.610-616
    • /
    • 2000
  • This paper presents an active noise control algorithm via Walsh transform domain controller learned by genetic algorithm. Typical active noise control algorithms such as the filtered-x lms algorithm are based on the gradient algorithm. Gradient algorithm have two major problems; local minima and eigenvalue ratio. To solve these problems, we propose a combined algorithm which consist of genetic learning algorithm and discrete Walsh transform called Walsh Transform Domain Genetic Algorithm(WTDGA). Analyses and computer simulations on the effect of Walsh transform to the genetic algorithm are performed. The results show that WTDGA increase convergence speed and reduce steady state errors.

  • PDF