• Title/Summary/Keyword: Direction Computation

Search Result 215, Processing Time 0.024 seconds

A Study on Computational Efficiency Enhancement by Using Full Gray Code Genetic Algorithm (전 영역 그레이코드 유전자 알고리듬의 효율성 증대에 관한 연구)

  • 이원창;성활경
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.10
    • /
    • pp.169-176
    • /
    • 2003
  • Genetic algorithm (GA), which has a powerful searching ability and is comparatively easy to use and also to apply, is in the spotlight in the field of the optimization for mechanical systems these days. However, it also contains some problems of slow convergence and low efficiency caused by a huge amount of repetitive computation. To improve the processing efficiency of repetitive computation, some papers have proposed paralleled GA these days. There are some cases that mention the use of gray code or suggest using gray code partially in GA to raise its slow convergence. Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. A binary gray code with n digits corresponds to a hamiltonian path on an n-dimensional hypercube (including direction reversals). The term gray code is open used to refer to a reflected code, or more specifically still, the binary reflected gray code. However, according to proposed reports, gray code GA has lower convergence about 10-20% comparing with binary code GA without presenting any results. This study proposes new Full gray code GA (FGGA) applying a gray code throughout all basic operation fields of GA, which has a good data processing ability to improve the slow convergence of binary code GA.

A Computation Reduction Technique of MUSIC Algorithm for Optimal Path Tracking (최적경로 추적을 위한 MUSIC 알고리즘의 계산량 감소 기법)

  • Kim, Yongguk;Park, Hae-Guy;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.4
    • /
    • pp.188-194
    • /
    • 2014
  • V2I(Vehicular to Infrastructure) is a one kind of communication systems which is used between the base stations and mobile objects. In V2I communication system, it is difficult to obtain the desired communication performance. Beamforming technology is to find the optimal path. and it can be improved the communication performance. MUSIC algorithm can be estimated the direction of arrival. The directional vector of received signals and the eigenvector has orthogonal property. MUSIC algorithm uses this property. In V2I communication environment, real time optimal path is changed. By the high computational complexity of the MUSIC algorithm, the optimal path estimation error is generated. In this paper, we propose a method of computation reduction algorithm for MUSIC algorithm.

Bargaining Game using Artificial agent based on Evolution Computation (진화계산 기반 인공에이전트를 이용한 교섭게임)

  • Seong, Myoung-Ho;Lee, Sang-Yong
    • Journal of Digital Convergence
    • /
    • v.14 no.8
    • /
    • pp.293-303
    • /
    • 2016
  • Analysis of bargaining games utilizing evolutionary computation in recent years has dealt with important issues in the field of game theory. In this paper, we investigated interaction and coevolution process among heterogeneous artificial agents using evolutionary computation in the bargaining game. We present three kinds of evolving-strategic agents participating in the bargaining games; genetic algorithms (GA), particle swarm optimization (PSO) and differential evolution (DE). The co-evolutionary processes among three kinds of artificial agents which are GA-agent, PSO-agent, and DE-agent are tested to observe which EC-agent shows the best performance in the bargaining game. The simulation results show that a PSO-agent is better than a GA-agent and a DE-agent, and that a GA-agent is better than a DE-agent with respect to co-evolution in bargaining game. In order to understand why a PSO-agent is the best among three kinds of artificial agents in the bargaining game, we observed the strategies of artificial agents after completion of game. The results indicated that the PSO-agent evolves in direction of the strategy to gain as much as possible at the risk of gaining no property upon failure of the transaction, while the GA-agent and the DE-agent evolve in direction of the strategy to accomplish the transaction regardless of the quantity.

Mobile sand barriers for windblown sand mitigation: Effects of plane layout and included angle

  • Gao, Li;Cheng, Jian-jun;Ding, Bo-song;Lei, Jia;An, Yuan-feng;Ma, Ben-teng
    • Wind and Structures
    • /
    • v.34 no.3
    • /
    • pp.275-290
    • /
    • 2022
  • Mobile sand barriers are a new type sand-retaining structure that can be moved and arranged according to the engineering demands of sand control. When only used for sand trapping, mobile sand barriers could be arranged in single row. For the dual purposes of sand trapping and sand stabilization, four rows of mobile sand barriers can be arranged in a staggered form. To reveal the effect of plane layout, the included angle between sand barrier direction and wind direction on the characteristics of flow fields and the sand control laws of mobile sand barriers, numerical computations and wind tunnel tests were conducted. The results showed that inflows deflected after passing through staggered arrangement sand barriers due to changes in included angle, and the sand barrier combination exerted successive wind resistance and group blocking effects. An analysis of wind resistance efficiency revealed that the effective protection length of staggered arrangement sand barriers approximately ranged from the sand barrier to 10H on the leeward side (H is sand barrier height), and that the effective protection length of single row sand barriers roughly ranged from 1H on the windward side to 20H on the leeward side. The distribution of sand deposit indicated that the sand interception increased with increasing included angle in staggered arrangement. The wind-breaking and sand-trapping effects were optimal when included angle between sand barrier direction and wind direction is 60°-90°.

Baseline Analysis for $3^{rd}$ order GPS Network Adjustment (국가기준점 망조정을 위한 GPS 3등기준점 기선해석)

  • Lee, Young-Jin;Jeong, Kwang-Ho;Kwon, Chan-O;Song, Jun-Ho;Cho, Jun-Rae;Nam, Gi-Beom
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2007.04a
    • /
    • pp.3-6
    • /
    • 2007
  • The GPS baseline processing and the network adjustment was required a preliminary classification and check for effective work because the observation data of GPS $3^{rd}$ order control points are enormous attain to about 12,000 points. Particularly, in baseline processing and network adjustment a inaccuracy GPS antenna heights and point names yield a gross error or a S/W computation error. For the baseline processing of observation data, the related all materials were collected and were required a final check. The factor occurring a error, in GPS the baseline processing, were inspected variously after a checking observation data. Also, baseline processing method of GPS $3^{rd}$ order control points were commented and the analysis carry out a results with a experiment. The ellipsoidal distance and height of duplication baseline was compared between adjoin campaign areas for a accuracy analysis of baseline processing. According to the result, the mean is about 1cm for horizontal direction and about 2cm for vertical direction.

  • PDF

Solving the Correspondence Problem by Multiple Stereo Image and Error Analysis of Computed Depth (다중 스테레오영상을 이용한 대응문제의 해결과 거리오차의 해석)

  • 이재웅;이진우;박광일
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.6
    • /
    • pp.1431-1438
    • /
    • 1995
  • In this paper, we present a multiple-view stereo matching method in case of moving in the direction of optical axis with stereo camera. Also we analyze the obtainable depth precision to show that multiple-view stereo increases the virtual baseline with single-view stereo. This method decides candidate points for correspondence in each image pair and then search for the correct combinations of correspondences among them using the geometrical consistency they must satisfy. Adantages of this method are capability in increasing the accuracy in matching by using the multiple stereo images and less computation due to local processing. This method computes 3-D depth by averaging the depth obtained in each multiple-view stereo. We show that the resulting depth has more precision than depth obtainable by each independent stereo when the position of image feature is uncertain due to image noise. This paper first defines a multipleview stereo agorithm in case of moving in the direction of optical axis with stereo camera and analyze the obtainable precision of computed depth. Then we represent the effect of removing the incorrect matching candidate and precision enhancement with experimental result.

Development of a High Accuracy Pure Upwind Difference Scheme (고차 정확도의 순수 상류 차분법의 개발)

  • Cho Ji Ryong
    • Journal of computational fluids engineering
    • /
    • v.4 no.1
    • /
    • pp.8-18
    • /
    • 1999
  • In devising a numerical approximation for the convective spatial transport of a fluid mechanical quantity, it is noted that the convective motion of a scalar quantity occurs in one-way, or from upstream to downstream. This consideration leads to a new scheme termed a pure upwind difference scheme (PUDS) in which an estimated value for a fluid mechanical quantity at a control surface is not influenced from downstream values. The formal accuracy of the proposed scheme is third order accurate. Two typical benchmark problems of a wall-driven fluid flow in a square cavity and a buoyancy-driven natural convection in a tall cavity are computed to evaluate performance of the proposed method. for comparison, the widely used simple upwind scheme, power-law scheme, and QUICK methods are also considered. Computation results are encouraging: the proposed PUDS sensitized to the convection direction produces the least numerical diffusion among tested convection schemes, and, notable improvements in representing recirculation of fluid stream and spatial change of a scalar. Although the formal accuracy of PUDS and QUICK are the same, the accuracy difference of approximately a single order is observed from the revealed results.

  • PDF

Application of TVD-McCormack Scheme to Analysis of Dam-Break Problems (댐붕괴 문제의 해석에 관한 TVD-McCormack기법의 적용)

  • Lee, Jong-Kyu;Kim, Tae-Kwan
    • Journal of Korea Water Resources Association
    • /
    • v.36 no.3 s.134
    • /
    • pp.365-374
    • /
    • 2003
  • This is a study on application of a TVD-Mccormack scheme for the computation of one-dimensional dam-break flows. The TVD scheme not only has the ability to damp out oscillations, but also does not contain terms with adjustable parameters. Moreover, the TVD-McCormack scheme does not cause any additional difficulty when dealing with the source term of the equation and retains second-order accuracy in both space and time. In this study, by appropriately designing the limiter functions, the TVD property can be achieved, and numerical oscillations near a jump discontinuities can be eliminated or reduced. Also, this numerical scheme has less computational errors when the direction of the predictor-corrector step is in the same direction as the shock wane propagation.

Sound Source Localization and Separation for Emotional Robot (감성로봇을 위한 음원의 위치측정 및 분리)

  • 김경환;김연훈;곽윤근
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.5
    • /
    • pp.116-123
    • /
    • 2003
  • These days, the researches related with the emotional robots are actively investigated and in progress. And human language, expression, action etc. are merged in the emotional robot to understand the human emotion. However, there are so many sound sources and background noise around the robot, that the robots should be able to separate the mixture of these sound sources into the original sound sources, moreover to understand the meaning of voice of a specific person. Also they should be able to turn or move to the direction of a specific person to observe his expression or action effectively. Until now, the researches on the localization and separation of sound sources have been so theoretical and computative that real-time processing is hardly possible. In this reason for the practical emotional robot, fast computation should be realized by using simple principle. In this paper the methods for detecting the direction of sound sources by using the phase difference between peaks on spectrums, and the separating the sound sources by using fundamental frequency and its overtones of human voice, are proposed. Also by using these methods, it is shown that the effective and real-time localization and separation of sound sources in living room are possible.

Voxel-Based Thickness Analysis of Intricate Objects

  • Subburaj, K.;Patil, Sandeep;Ravi, B.
    • International Journal of CAD/CAM
    • /
    • v.6 no.1
    • /
    • pp.105-115
    • /
    • 2006
  • Thickness is a commonly used parameter in product design and manufacture. Its intuitive definition as the smallest dimension of a cross-section or the minimum distance between two opposite surfaces is ambiguous for intricate solids, and there is very little reported work in automatic computation of thickness. We present three generic definitions of thickness: interior thickness of points inside an object, exterior thickness for points on the object surface, and radiographic thickness along a view direction. Methods for computing and displaying the respective thickness values are also presented. The internal thickness distribution is obtained by peeling or successive skin removal, eventually revealing the object skeleton (similar to medial axis transformation). Another method involves radiographic scanning along a viewing direction, with minimum, maximum and total thickness options, displayed on the surface of the object. The algorithms have been implemented using an efficient voxel based representation that can handle up to one billion voxels (1000 per axis), coupled with a near-real time display scheme that uses a look-up table based on voxel neighborhood configurations. Three different types of intricate objects: industrial (press cylinder casting), sculpture (Ganesha idol), and medical (pelvic bone) were used for successfully testing the algorithms. The results are found to be useful for early evaluation of manufacturability and other lifecycle considerations.