• 한국게임학회 논문지
• /
• 제9권4호
• /
• pp.81-88
• /
• 2009

본 논문에서는 유전자 알고리즘을 이용하여 액션 게임에서 지능 캐릭터의 경로 탐색 방법을 제안하였다. 실험방법으로는 유전자 알고리즘의 특성을 살려 이동 캐릭터가 최단 경로를 선택 할 뿐만 아니라 최적경로 탐색이 가능하도록 하였다. 이 때 염색체의 코드화를 그대로 적용할 경우 많은 치사 유전자가 발생하는데 이 문제를 DNA의 행동 특성의 스플라이싱 방법을 이용하여 해결하였다. 탐색 과정에서 여러 개의 후보 해를 생성하는 유전자 알고리즘의 특징을 이용해서 최단 경로 이외에 최적 경로를 1회의 처리로서 지능 캐릭터가 경로를 탐색하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권3호
• /
• pp.980-998
• /
• 2023

In Low Earth Orbit (LEO) satellite networks, satellites operate fast and the inter-satellite link change period is short. In order to sense the spectrum state in LEO satellite networks in real-time, a space-based satellite network intelligent spectrum sensing algorithm based on artificial neural network (ANN) is proposed, while Geosynchronous Earth Orbit (GEO) satellites are introduced to make fast and effective judgments on the spectrum state of LEO satellites by using their stronger arithmetic power. Firstly, the visibility constraints between LEO satellites and GEO satellites are analyzed to derive the inter-satellite link building matrix and complete the inter-satellite link situational awareness. Secondly, an ANN-based energy detection (ANN-ED) algorithm is proposed based on the traditional energy detection algorithm and artificial neural network. The ANN module is used to determine the spectrum state and optimize the traditional energy detection algorithm. GEO satellites are used to fuse the information sensed by LEO satellites and then give the spectrum decision, thereby realizing the inter-satellite spectrum state sensing. Finally, the sensing quality is evaluated by the analysis of sensing delay and sensing energy consumption. The simulation results show that our proposed algorithm has lower complexity, the sensing delay and sensing energy consumption compared with the traditional energy detection method.

• 제어로봇시스템학회논문지
• /
• 제3권2호
• /
• pp.156-161
• /
• 1997

In this thesis, based on Genetic Algorithm, a new route search algorithm is presented to search an optimal route between the origin and the destination in intelligent route guidance systems in order to minimize the route traveling time. The proposed algorithm is effectively employed to complex road networks which have diverse turn constrains, time-delay constraints due to cross signals, and stochastic traffic volume. The algorithm is also shown to significantly promote search efficiency by changing the population size of path individuals that exist in each generation through the concept of age and lifetime to each path individual. A virtual road-traffic network with various turn constraints and traffic volume is simulated, where the suggested algorithm promptly produces not only an optimal route to minimize the route cost but also the estimated travel time for any pair of the origin and the destination, while effectively avoiding turn constraints and traffic jam.

• 한국공작기계학회논문집
• /
• 제13권3호
• /
• pp.126-132
• /
• 2004

This paper proposed trajectory tracking control based on genetic algorithm. Trajectory tracking control scheme are real coding genetic algorithm(RCGA) and back-propagation algorithm(BPA). Control scheme ability experience proposed simulation. Stable tracking control problem of mobile robots have been studied in recent years. These studies have guaranteed stability of controller, but the performance of transient state has not been guaranteed. In some situations, constant gain controller shows overshoots and oscillations. So we introduce better control scheme using real coding genetic algorithm and neural network. Using RCGA, we can find proper gains in several situations and these gains are generalized by neural network. The generalization power of neural network will give proper gain in untrained situation. Performance of proposed controller will verity numerical simulations and the results show better performance than constant gain controller.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.589-594
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the losed loop problem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and efficiently. This algorithm is a hybrid type of using both declarative description (constraint represention) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• 한국지능시스템학회논문지
• /
• 제8권3호
• /
• pp.71-79
• /
• 1998

본 논문은 유전알고리즘과 random tabu 탐색법을 조합한 새로운 최적화 알고리즘을 제안한다. 유전알고리즘과 전역적인 최적해에 대한 탐색능력이 우수하고, random tabu 탐색법은 최적해에의 수렴속도가 매우 빠른 알고리즘이다. 본 논문에서는 이 두 알고리즘의 장점을 이용해서 수렴정도와 수렴속도가 더욱 향상된 최적알고리즘을 제안하여 알고리즘의 수렴성능을 조사하고, 실제 최적화문제로서 지진응답을 최소로 하기위한 배관지지대의 최적배치문제에 적용하여 기존의 방법과 비교를 통하여 유용성을 검토하였다.

• 정보기술과데이타베이스저널
• /
• 제7권1호
• /
• pp.42-53
• /
• 2000

The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

• 한국지능시스템학회논문지
• /
• 제16권3호
• /
• pp.275-284
• /
• 2006

본 논문에서는 자율이동로봇이 주위 환경을 알지 못하는 상황에서 목표점까지 안전하게 주행하게 하는 주행 알고리즘에 대해 연구한다. 주행 알고리즘에서 가장 고려해야할 부분이 장애물 회피 알고리즘인데, 본 논문에서는 장애물 회피 알고리즘인 VFH(Vector Field Histogram) 알고리즘과 퍼지 알고리즘을 조합하여 여러 가지 형태의 환경에서 최적의 성능을 내도록 한다. 로봇이 처한 환경에 따라 상위 레벨의 supervisor가 위의 두 가지 장애물 회피 알고리즘 중 적절한 것을 선택하도록 조합하고, 다양한 환경에서 모의실험을 수행함으로써 제안된 로봇주행 알고리즘의 성능을 검증한다.

• 한국정밀공학회지
• /
• 제14권9호
• /
• pp.116-123
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the closed loop porblem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and effi- ciently. This algorithm is a hybrid type of using both declarative description (constraint representation) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.53-56
• /
• 2007

Symmerge is a stable minimum storage algorithm for merging that needs $O(mlog\frac{n}{m})$ element comparisons, where m and n are the sizes of the input sequences with m ${\leqq}$ n. According to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The objective of this paper is to consider the relationship between m and n for the spanning case with the recursion level m-1.