• 제목/요약/키워드: realize the algorithm

검색결과 453건 처리시간 0.028초

구조로봇에 적합한 장애물 회피 알고리즘 ELA의 실험적 검증 (Experimental Verification of Obstacle Avoidance Algorithm ELA Applicable to Rescue Robots)

  • 정해관;현경학;김수현;곽윤근
    • 로봇학회논문지
    • /
    • 제4권2호
    • /
    • pp.105-111
    • /
    • 2009
  • In this paper, we provide experimental results and verification for obstacle avoidance algorithm 'ELA(Emergency Level Around)', which is applicable to rescue robots. ELA is a low level intelligence-based obstacle avoidance algorithm, so can be used in fast mobile robots requiringhigh speed in operation with little computational load. Constructed system for experiments consist of laptop, sensors, peripheral devices and mobile robot platform VSTR(Variable Single-tracked Robot) to realize predetermined scenarios. Finally, experiment was conducted in indoor surroundings including miscellaneous things as well as dark environment to show fitness and robustness of ELA for rescue, and it is shown that VSTR navigates endowed area well with real-time obstacle avoidance based on ELA. Therefore, it is concluded that ELA can be a candidate algorithm to increase mobility of rescue robots in real situation.

  • PDF

은닉마르코브 모델의 부합확률연산의 정수화 알고리즘 개발 (I) (Development of an Integer Algorithm for Computation of the Matching Probability in the Hidden Markov Model (I))

  • 김진헌;김민기;박귀태
    • 전자공학회논문지B
    • /
    • 제31B권8호
    • /
    • pp.11-19
    • /
    • 1994
  • The matching probability P(ο/$\lambda$), of the signal sequence(ο) observed for a finite time interval with a HMM (Hidden Markov Model $\lambda$) indicates the probability that signal comes from the given model. By utilizing the fact that the probability represents matching score of the observed signal with the model we can recognize an unknown signal pattern by comparing the magnitudes of the matching probabilities with respect to the known models. Because the algorithm however uses floating point variables during the computing process hardware implementation of the algorithm requires floating point units. This paper proposes an integer algorithm which uses positive integer numbers rather than float point ones to compute the matching probability so that we can economically realize the algorithm into hardware. The algorithm makes the model parameters integer numbers by multiplying positive constants and prevents from divergence of data through the normalization of variables at each step. The final equation of matching probability is composed of constant terms and a variable term which contains logarithm operations. A scheme to make the log conversion table smaller is also presented. To analyze the qualitive characteristics of the proposed algorithm we attatch simulation result performed on two groups of 10 hypothetic models respectively and inspect the statistical properties with repect to the model order the magnitude of scaling constants and the effect of the observation length.

  • PDF

신경망을 이용한 제조셀 형성 알고리듬 (A Manufacturing Cell Formantion Algorithm Using Neural Networks)

  • 이준한;김양렬
    • 경영과학
    • /
    • 제16권1호
    • /
    • pp.157-171
    • /
    • 1999
  • In a increasingly competitive marketplace, the manufacturing companies have no choice but looking for ways to improve productivity to sustain their competitiveness and survive in the industry. Recently cellular manufacturing has been under discussion as an option to be easily implemented without burdensome capital investment. The objective of cellular manufacturing is to realize many aspects of efficiencies associated with mass production in the less repetitive job-shop production systems. The very first step for cellular manufacturing is to group the sets of parts having similar processing requirements into part families, and the equipment needed to process a particular part family into machine cells. The underlying problem to determine the part and machine assignments to each manufacturing cell is called the cell formation. The purpose of this study is to develop a clustering algorithm based on the neural network approach which overcomes the drawbacks of ART1 algorithm for cell formation problems. In this paper, a generalized learning vector quantization(GLVQ) algorithm was devised in order to transform a 0/1 part-machine assignment matrix into the matrix with diagonal blocks in such a way to increase clustering performance. Furthermore, an assignment problem model and a rearrangement procedure has been embedded to increase efficiency. The performance of the proposed algorithm has been evaluated using data sets adopted by prior studies on cell formation. The proposed algorithm dominates almost all the cell formation reported so far, based on the grouping index($\alpha$ = 0.2). Among 27 cell formation problems investigated, the result by the proposed algorithm was superior in 11, equal 15, and inferior only in 1.

  • PDF

Logo를 이용한 정보과학적 사고 기반의 알고리즘 학습이 예비 초등교사에게 미치는 영향 (The Effects of Computational Thinking of Algorithm Learning using Logo for Primary Pre-service Teachers)

  • 김태훈;김병수;김종훈
    • 정보교육학회논문지
    • /
    • 제16권4호
    • /
    • pp.463-474
    • /
    • 2012
  • 정보과학기술의 발달로 급변하는 사회에서 정보교육의 필요성에 대한 목소리가 높아지고 있다. 하지만 초등학교의 대부분의 교사들은 정보교육의 필요성을 체감하지 못하고 핵심원리인 정보과학적 사고에 대하여 인지하지 못하고 있는 실정이다. 본 연구에서는 예비 초등교사들이 정보교육의 필요성을 체감하고 정보과학적 사고를 올바로 인지할 수 있도록 Logo를 이용한 정보과학적 사고 기반의 알고리즘 학습 프로그램을 설계하고 시행하였다. 사전, 사후검사를 분석한 결과 예비교사의 논리적 사고력 중 상관논리, 조합논리와 논리적 사고력 합계의 평균이 유의미하게 상승하였다. 또한 정보교육과 정보과학적 사고에 대한 예비교사들의 인식이 긍정적으로 변화한 것으로 나타났다.

  • PDF

스테레오 영상에서 움직임 벡터를 이용한 고속 변이 벡터 추정 (Fast Disparity Vector Estimation using Motion vector in Stereo Image Coding)

  • 도남금;김태용
    • 대한전자공학회논문지SP
    • /
    • 제46권5호
    • /
    • pp.56-65
    • /
    • 2009
  • 스테레오 영상은 단일 영상과는 달리 오른쪽과 왼쪽, 2개의 영상으로 구성되어 있기 때문에 단일 영상에 비하여 더욱 많은 데이터량을 가지게 된다. 따라서 이를 효율적으로 처리하기 위한 영상 압축 기술이 필요하게 되었고, 이를 위해 DPCM기반의 예측 부호화 압축 기술을 대부분의 비디오 압축 표준에서 사용한다. 예측 부호화 기술의 구현을 위해 움직임 추정 및 변이 추정이 필요한데 이를 수행하는 알고리즘으로 여러 가지 비디오 코딩 표준들에서 블록 정합 알고리즘을 사용한다. 블록 정합 알고리즘 중 완전탐색 알고리즘은 기준 블록을 탐색영역 안에 존재하는 모든 블록과 비교하여 최적의 블록을 찾아낸다. 이 알고리즘은 최적의 블록을 찾을 수 있어 효율은 좋으나 많은 연산량이 단점이 된다. 본 논문에서는 스테레오 영상에서 움직임 벡터 정보와 전 프레임의 변이벡터 정보를 이용하여 고속으로 현재 프레임의 변이 벡터를 추정할 수 있는 방안을 제시한다. 변이 벡터 추정시 전역 변이 벡터를 사용하여 탐색 영역을 줄이고, 전 프레임들 사이에서 구한 변이 벡터 정보를 재사용하면서 움직임 벡터 정보를 이용하여 탐색 위치를 제한함으로 연산량을 줄여 고속의 변이 벡터 추정을 가능하게 하였다. 실험결과 제안 알고리즘은 움직임이 많은 복잡 영상 보다는 움직임이 적은 단순 영상에서의 성능이 훨씬 뛰어났으며, 움직임이 적은 단순 영상에서의 변이 벡터 추정 시에 약간의 residual 증가는 있지만 빠른 처리 속도를 제공하여 고속의 변이 벡터 추정을 가능하게 함을 확인하였다.

지능형 속도 추정기를 이용한 유도전동기 속도 제어 (Speed Control of an Induction Motor using Intelligent Speed Estimator)

  • 김낙교;최성대
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제54권7호
    • /
    • pp.437-442
    • /
    • 2005
  • In order to realize the speed control of an induction motor, the information of the rotor speed is needed. So the speed sensor as an encoder or a pulse generator is used to obtain it. But the use of speed sensor occur the some problems in the control system of an induction motor. To solve the problems, the appropriate speed estimation algorithm is used instead of the speed sensor. Also there is the limitation to improve the speed control performance of an induction motor using the existing speed estimation algorithm. Therefore, in this paper, intelligent speed estimator using Fuzzy-Neural systems as adaptive laws in Model Reference Adaptive System is proposed so as to improve the existing estimation algorithm and ,using the rotor speed estimated by the Proposed estimator, the speed control of an induction motor without speed sensor is performed. The computer simulation and the experiment is executed to prove the performance of the speed control system usinu the proposed speed estimator.

Energy-balance node-selection algorithm for heterogeneous wireless sensor networks

  • Khan, Imran;Singh, Dhananjay
    • ETRI Journal
    • /
    • 제40권5호
    • /
    • pp.604-612
    • /
    • 2018
  • To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.

최대후회 최소화 임계 경로 탐색 알고리듬 (A Heuristic Algorithm to Find the Critical Path Minimizing the Maximal Regret)

  • 강준규;윤협상
    • 산업경영시스템학회지
    • /
    • 제34권3호
    • /
    • pp.90-96
    • /
    • 2011
  • Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

포토메트릭 스테레오를 이용한 물체표면방향의 인식 (Recognition of surface orientations in an object using photomeric stereo method)

  • 이종훈;전태현;김도성;이명호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.816-820
    • /
    • 1990
  • This paper is pre-stage for getting EGI which can be used for modeling of an object. It discusses the construction of the vision processing system and its algorithm for getting needle diagram from tie object image. We realize the algorithm with monocular camera system, using Reflectance Map theory and photometric stereo method. We can calculate the surface normal at any point in the image if we take multiple images at the different lighting conditions. From the 3 images taken from different lighting conditions through the experiment, we get the needle diagrams of the sphere and the object. We confirm the validness of the surface, normal acquisition algorithm comparing the experimental needle diagram with the ideal one obtained from the surface normal of the known object.

  • PDF

Unified MPPT Control Strategy for Z-Source Inverter Based Photovoltaic Power Conversion Systems

  • Thangaprakash, Sengodan
    • Journal of Power Electronics
    • /
    • 제12권1호
    • /
    • pp.172-180
    • /
    • 2012
  • Z-source inverters (ZSI) are used to realize both DC voltage boost and DC-AC inversion in single stage with a reduced number of power switching devices. A traditional MPPT control algorithm provides a shoot-through interval which should be inserted in the switching waveforms of the inverter to output the maximum power to the Z-network. At this instant, the voltage across the Z-source capacitor is equal to the output voltage of a PV array at the maximum power point (MPP). The control of the Z-source capacitor voltage beyond the MPP voltage of a PV array is not facilitated in traditional MPPT algorithms. This paper presents a unified MPPT control algorithm to simultaneously achieve MPPT as well as Z-source capacitor voltage control. Development and implementation of the proposed algorithm and a comparison with traditional results are discussed. The effectiveness of the proposed unified MPPT control strategy is implemented in Matlab/Simulink software and verified by experimental results.