• Title/Summary/Keyword: Approach 알고리즘

Search Result 2,235, Processing Time 0.033 seconds

The Pathplanning of Navigation Algorithm using Dynamic Window Approach and Dijkstra (동적창과 Dijkstra 알고리즘을 이용한 항법 알고리즘에서 경로 설정)

  • Kim, Jae Joon;Jee, Gui-In
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.94-96
    • /
    • 2021
  • In this paper, we develop a new navigation algorithm for industrial mobile robots to arrive at the destination in unknown environment. To achieve this, we suggest a navigation algorithm that combines Dynamic Window Approach (DWA) and Dijkstra path planning algorithm. We compare Local Dynamic Window Approach (LDWA), Global Dynamic Window Approach(GDWA), Rapidly-exploring Random Tree (RRT) Algorithm. The navigation algorithm using Dijkstra algorithm combined with LDWA and GDWA makes mobile robots to reach the destination. and obstacles faced during the path planning process of LDWA and GDWA. Then, we compare on time taken to arrive at the destination, obstacle avoidance and computation complexity of each algorithm. To overcome the limitation, we seek ways to use the optimized navigation algorithm for industrial use.

  • PDF

Removing Non-informative Features by Robust Feature Wrapping Method for Microarray Gene Expression Data (유전자 알고리즘과 Feature Wrapping을 통한 마이크로어레이 데이타 중복 특징 소거법)

  • Lee, Jae-Sung;Kim, Dae-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.8
    • /
    • pp.463-478
    • /
    • 2008
  • Due to the high dimensional problem, typically machine learning algorithms have relied on feature selection techniques in order to perform effective classification in microarray gene expression datasets. However, the large number of features compared to the number of samples makes the task of feature selection computationally inprohibitive and prone to errors. One of traditional feature selection approach was feature filtering; measuring one gene per one step. Then feature filtering was an univariate approach that cannot validate multivariate correlations. In this paper, we proposed a function for measuring both class separability and correlations. With this approach, we solved the problem related to feature filtering approach.

An Adaptive Genetic Algorithm with a Fuzzy Logic Controller for Solving Sequencing Problems with Precedence Constraints (선행제약순서결정문제 해결을 위한 퍼지로직제어를 가진 적응형 유전알고리즘)

  • Yun, Young-Su
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.2
    • /
    • pp.1-22
    • /
    • 2011
  • In this paper, we propose an adaptive genetic algorithm (aGA) approach for effectively solving the sequencing problem with precedence constraints (SPPC). For effective representation of the SPPC in the aGA approach, a new representation procedure, called the topological sort-based representation procedure, is used. The proposed aGA approach has an adaptive scheme using a fuzzy logic controller and adaptively regulates the rate of the crossover operator during the genetic search process. Experimental results using various types of the SPPC show that the proposed aGA approach outperforms conventional competing approaches. Finally the proposed aGA approach can be a good alternative for locating optimal solutions or sequences for various types of the SPPC.

Nonlinear mappings of interval vectors by neural networks (신경회로망에 의한 구간 벡터의 비선형 사상)

  • 권기택;배철수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.2119-2132
    • /
    • 1996
  • This paper proposes four approaches for approximately realizing nonlinear mappling of interval vectors by neural networks. In the proposed approaches, training data for the learning of neural networks are the paris of interval input vectors and interval target output vectors. The first approach is a direct application of the standard BP (Back-Propagation) algorithm with a pre-processed training data. The second approach is an application of the two BP algorithms. The third approach is an extension of the BP algorithm to the case of interval input-output data. The last approach is an extension of the third approach to neural network with interval weights and interval biases. These approaches are compared with one another by computer simulations.

  • PDF

Development of Photogrammetric Rectification Method Applying Bayesian Approach for High Quality 3D Contents Production (고품질의 3D 콘텐츠 제작을 위한 베이지안 접근방식의 사진측량기반 편위수정기법 개발)

  • Kim, Jae-In;Kim, Taejung
    • Journal of Broadcast Engineering
    • /
    • v.18 no.1
    • /
    • pp.31-42
    • /
    • 2013
  • This paper proposes a photogrammetric rectification method based on Bayesian approach as a method that eliminates vertical parallax between stereo images to minimize visual fatigue of 3D contents. The image rectification consists of two phases; geometry estimation and epipolar transformation. For geometry estimation, coplanarity-based relative orientation algorithm was used in this paper. To ensure robustness for mismatch and localization error occurred by automation of tie point extraction, Bayesian approach was applied by introducing several prior constraints. As epipolar transformation perspective transformation was used based on condition of collinearity to minimize distortion of result images and modification for input images. Other algorithms were compared to evaluate performance. For geometry estimation, traditional relative orientation algorithm, 8-points algorithm and stereo calibration algorithm were employed. For epipolar transformation, Hartley algorithm and Bouguet algorithm were employed. The evaluation results showed that the proposed algorithm produced results with high accuracy, robustness about error sources and minimum image modification.

Integrating Multiple Classifiers in a GA-based Inductive Learning Environment (유전 알고리즘 기반 귀납적 학습 환경에서 분류기의 통합)

  • Kim, Yeong-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.3
    • /
    • pp.614-621
    • /
    • 2006
  • We have implemented a multiclassifier learning approach in a GA-based inductive learning environment that learns classification rules that are similar to rules used in PROSPECTOR. In the multiclassifier learning approach, a classification system is constructed with several classifiers that are obtained by running a GA-based learning system several times to improve the overall performance of a classification system. To implement the multiclassifier learning approach, we need a decision-making scheme that can draw a decision using multiple classifiers. In this paper, we introduce two decision-making schemes: one is based on combining posterior odds given by classifiers to each class and the other one is a voting scheme based on ranking assigned to each class by classifiers. We also present empirical results that evaluate the effect of the multiclassifier learning approach on the GA-based inductive teaming environment.

Quotitive Division and Invert and Multiply Algorithm for Fraction Division (분수 포함제와 제수의 역수 곱하기 알고리즘의 연결성)

  • Yim, Jaehoon
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.20 no.4
    • /
    • pp.521-539
    • /
    • 2016
  • The structures of partitive and quotitive division of fractions are dealt with differently, and this led to using partitive division context for helping develop invert-multiply algorithm and quotitive division for common denominator algorithm. This approach is unlikely to provide children with an opportunity to develop an understanding of common structure involved in solving different types of division. In this study, I propose two approaches, measurement approach and isomorphism approach, to develop a unifying understanding of fraction division. From each of two approaches of solving quotitive division based on proportional reasoning, I discuss an idea of constructing a measure space, unit of which is a quantity of divisor, and another idea of constructing an isomorphic relationship between the measure spaces of dividend and divisor. These ideas support invert-multiply algorithm for quotitive as well as partitive division and bring proportional reasoning into the context of fraction division. I also discuss some curriculum issues regarding fraction division and proportion in order to promote the proposed unifying understanding of partitive and quotitive division of fractions.

Generating Multiple Paths by Using Multi-label Vine-building Shortest Path Algorithm (수정형 덩굴망 최단경로 탐색 알고리즘을 이용한 다경로 생성 알고리즘의 개발)

  • Kim, Ik-Ki
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.2 s.73
    • /
    • pp.121-130
    • /
    • 2004
  • In these days, multiple-path generation method is highly demanded in practice and research areas, which can represents realistically travelers behavior in choosing possible alternative paths. The multiple-path generation algorithm is one of the key components for policy analysis related to ATIS, DRGS and ATMS in ITS. This study suggested a method to generate multiple Possible paths from an origin to a destination. The approach of the suggested method is different from an other existing methods(K-shortest path algorithm) such as link elimination approach, link penalty approach and simulation approach. The result of the multi-label vine-building shortest path algorithm(MVA) by Kim (1998) and Kim(2001) was used to generate multiple reasonable possible paths with the concept of the rational upper boundary. Because the MVA algorithm records the cost, back-node and back-back node of the minimum path from the origin to the concerned node(intersection) for each direction to the node, many potential possible paths can be generated by tracing back. Among such large number of the potential possible paths, the algorithm distinguishes reasonable alternative paths from the unrealistic potential possible paths by using the concept of the rational upper boundary. The study also shows the very simple network examples to help the concept of the suggested path generation algorithm.

A Study of Cold Chain Logistics in China: Hybrid Genetic Algorithm Approach (중국 콜드체인 물류에 관한 연구: 혼합유전알고리즘 접근법)

  • Chen, Xing;Jang, Eun-Mi
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.6
    • /
    • pp.159-169
    • /
    • 2020
  • A cold chain logistics (CCL) model for chilled food (-1℃ to 8℃) distributed in China was developed in this study. The CCL model consists of a distribution center (DC) and distribution target points (DT). The objective function of the CCL model is to minimize the total distribution routes of all distributors. To find the optimal result of the objective function, the hybrid genetic algorithm (HGA) approach is proposed. The HGA approach was constructed by combining the improved K-means and genetic algorithm (GA) approaches. In the case study, three scenarios were considered for the CCL model based on the distribution routes and the available distance, and they were solved using the proposed HGA approach. Analysis results showed that the distribution costs and mileage were reduced by approximately 19%, 20% and 16% when the proposed HGA approach was used.

A Generalized Subspace Approach for Enhancing Speech Corrupted by Colored Noise Using Voice Activity Detector(VAD) (음성활동영역검색을 사용하는 유색잡음에 오염된 음성의 향상을 위한 일반화 부공간 접근)

  • Son, Kyung-Sik;Kim, Hyun-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.8
    • /
    • pp.1769-1776
    • /
    • 2013
  • In this paper, we proposed the modified YL(Yi and Loizou) algorithm, using a VAD(voice activity detector) for enhancing speech corrupted by colored noise. The performance of the proposed algorithm has been compared to the YL algorithm and LS(Lee and Son, etc.) algorithm by computer simulation. The colored noises used in the experiment were a car noise and multi-talker babble from the AURORA data base and the used voices from the TIMIT data base. It is confirmed that the proposed algorithm shows better performance from SNR(signal to noise ratio) and SSD(speech spectral distortion) viewpoint over the previous two approach.