• 제목/요약/키워드: look-ahead point

검색결과 16건 처리시간 0.027초

선독 알고리즘에 의한 고속 가공 소프트웨어 구현 (The Implement of a high Speed Machining Software by Look-ahead Algorithm)

  • 이철수
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2000년도 춘계학술대회논문집 - 한국공작기계학회
    • /
    • pp.252-257
    • /
    • 2000
  • This paper describes a look-ahead algorithm of PCNC(personal computer numerical control). The algorithm is based on acceleration/deceleration before interpolation never including a command error and determines a velocity value in end point of each block(or start point of each block). The algorithm is represented as following; 1) calculating two maximum arrival velocity(v1, v2) by a acceleration value, a command velocity and distance in a previous block and a next block, 2) getting a tangent velocity(v3) of the adjacent blocks, 3) choosing a minimum value among these three velocities, and 4) setting the value to a velocity of a start point of the next block(or a end point of the previous block). The proposed look-ahead algorithm was implemented and tested by using a commercial RTOS(real time operation system) on the MS-Windows NT 4.0 in a PC platform. For interfacing to a machine, a counter board, a DAC board and a DIO board were used. The result of the algorithm increased a machining precision and a machining speed in many short blocks.

  • PDF

고속가공을 위한 2단계 모션 제어 루프와 선독 알고리즘의 구현 (The Implement of 2-Step Motion Control Loop and Look Ahead Algorithm for a High Speed Machining)

  • 이철수;이제필
    • 한국생산제조학회지
    • /
    • 제9권6호
    • /
    • pp.71-81
    • /
    • 2000
  • This paper describers a look ahead algorithm of PC-NC(personal computer numerical control). The algorithm is based on acceleration/deceleration before interpolation which doesn\`t include a command error and determines a feedrate value at the end point of each block(or start point of each block). The algorithm is represented as following; 1) calculating two maximum arrival feedrates(F$_1$,F$_2$) by an acceleration value, a command feedrate, and the distance of a NC block, 2) getting a tangent feedrate (F$_3$) of the adjacent blocks, 3) choosing a minimum value among these three feedrates, and 4) setting the value to a feedrate of a start point of the next block(or a end point of the previous block). The proposed look ahead algorithm was implemented and tested by using a commercial TROS(real time operation system) on the MS-Windows NT 4.0 in a PC platform. For interfacing to a machine, a counter board, a DAC board and a DIO board were used. The result of the algorithm increased a machining precision and a machining speed in many short blocks.

  • PDF

물고기 로봇의 기하학적 경로 추종 (Geometric Path Tracking for a Fish Robot)

  • 박진현;최영규
    • 한국정보통신학회논문지
    • /
    • 제18권4호
    • /
    • pp.906-912
    • /
    • 2014
  • 물고기 로봇 연구는 몸체 및 꼬리 관절 궤적의 크기나 주파수의 크기에 따른 로봇의 추력 비교 또는 꼬리 관절 궤적을 적절한 함수로 선정하여 물고기 로봇의 빠른 회전 등과 관련된 연구가 주를 이루고 있다. 본 연구에서는 물고기 로봇이 추력을 받아 앞으로 유영할 경우, 로봇의 몸체 및 꼬리 관절이 사인파와 같이 좌, 우로 요동치며 움직이므로 피드백 제어를 행하기 어렵다. 따라서 물고기 로봇의 경로에 기초한 가상의 위치를 검출하고, 검출된 위치를 사용하여 주어진 경로 위의 예견 점(look-ahead point)을 기준으로 방향 오차를 정의하여 물고기 로봇이 경로를 추종하도록 제어기를 설계하였다. 모의실험 결과 제안된 방법의 유용성을 확인할 수 있었다.

Ad-hoc 네트워크에서 Look-ahead Selective Flooding을 이용한 On-Demand 라우팅 프로토콜 성능 개선 (Performance Evaluation of On-Demand Routing Protocol using Look-ahead Selective Flooding in Ad-hoc Network)

  • Yo-chan Ahn
    • Journal of Information Technology Applications and Management
    • /
    • 제10권2호
    • /
    • pp.61-71
    • /
    • 2003
  • Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

  • PDF

4-Bit 카운터 74LS163의 연결방법에 대한 분석 (Analysis of the Method of Cascading 74LS163 4-Bit Binary Counters)

  • 유준복;정태상
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 추계학술대회 논문집 학회본부 D
    • /
    • pp.794-796
    • /
    • 2000
  • This paper analyzes the method of cascading 74LS163 4-Bit Binary Counters. The 74LS163 4-Bit Binary Counter has synchronous LD. CLR functions and especially ENT, ENP, RCO to cascade some chips in order to count more 4bit binary number. The maximum operating frequency may vary according to the method of cascading. The Data sheet from Texas Instruments introduces two methods, The Ripple Carry Mode Circuit and The Carry Look Ahead Circuit, and shows that The Carry Look Ahead Circuit is more efficient than the other. However, there are only little information for user to understand and apply this to other circuits. Thus, we not only analyzed the two methods but also compared with each other in the point of performance.

  • PDF

FPGA를 위한 32비트 부동소수점 곱셈기 설계 (Design of 32-bit Floating Point Multiplier for FPGA)

  • ;김대익
    • 한국전자통신학회논문지
    • /
    • 제19권2호
    • /
    • pp.409-416
    • /
    • 2024
  • 빠른 고속 데이터 신호 처리 및 논리 연산을 위한 부동 소수점 연산 요구 사항이 확대됨에 따라 부동 소수점 연산 장치의 속도는 시스템 작동에 영향을 미치는 핵심 요소이다. 본 논문에서는 다양한 부동소수점 곱셈기 방식의 성능 특성을 연구하고, 캐리와 합의 형태로 부분 곱을 압축한 다음, 최종 결과를 얻기 위해 캐리 미리 보기 가산기를 사용한다. Intel Quartus II CAD 툴을 이용하여 Verilog HDL로 부동소수점 곱셈기를 기술하고 성능 평가를 하였다. 설계된 부동소수점 곱셈기는 면적, 속도 및 전력 소비에 대해 분석 및 비교하였다. 월러스 트리를 사용한 수정 부스 인코딩 방식의 FMAX는 33.96Mhz로 부스 인코딩보다 2.04배, 수정 부스 인코딩보다 1.62배, 월러스 트리를 사용한 부스 인코딩보다 1.04배 빠르다. 또한, 수정 부스 인코딩에 비해 월러스 트리를 이용한 수정 부스 인코딩 방식의 면적은 24.88% 감소하고, 전력소모도 2.5% 감소하였다.

NUMERICAL IMPLEMENTATION OF THE QMR ALGORITHM BY USING DISCRETE STOCHASTIC ARITHMETIC

  • TOUTOUNIAN FAEZEH;KHOJASTEH SALKUYEH DAVOD;ASADI BAHRAM
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.457-473
    • /
    • 2005
  • In each step of the quasi-minimal residual (QMR) method which uses a look-ahead variant of the nonsymmetric Lanczos process to generate basis vectors for the Krylov subspaces induced by A, it is necessary to decide whether to construct the Lanczos vectors $v_{n+l}\;and\;w{n+l}$ as regular or inner vectors. For a regular step it is necessary that $D_k\;=\;W^{T}_{k}V_{k}$ is nonsingular. Therefore, in the floating-point arithmetic, the smallest singular value of matrix $D_k$, ${\sigma}_min(D_k)$, is computed and an inner step is performed if $\sigma_{min}(D_k)<{\epsilon}$, where $\epsilon$ is a suitably chosen tolerance. In practice it is absolutely impossible to choose correctly the value of the tolerance $\epsilon$. The subject of this paper is to show how discrete stochastic arithmetic remedies the problem of this tolerance, as well as the problem of the other tolerances which are needed in the other checks of the QMR method with the estimation of the accuracy of some intermediate results. Numerical examples are used to show the good numerical properties.

무인전투기 근접 지형추종을 위한 궤적생성 및 유도 항법 (Trajectory Generation, Guidance, and Navigation for Terrain Following of Unmanned Combat Aerial Vehicles)

  • 오경택;서중보;김형석;김유단;김병수
    • 한국항공우주학회지
    • /
    • 제40권11호
    • /
    • pp.979-987
    • /
    • 2012
  • 본 논문에서는 무인전투기의 지형추종을 위한 궤적생성, 유도, 항법 알고리즘을 구현하고 이를 통합하였다. 적 방공망 제압과 같은 위험한 임무를 수행하는 무인전투기는 적의 대공방어망으로부터 생존성을 높이기 위해서 지면을 근접하여 비행하는 지형추종 알고리즘이 필수적으로 요구된다. 무인전투기가 지형추종 비행을 하기 위해서는 경로생성, 유도, 그리고 항법 분야 알고리즘이 통합되어야 한다. 본 논문에서는 항법 알고리즘으로 GPS가 교란된 상황을 대비하여 비선형 필터 기반의 지형참조 항법을 사용하였다. 경로생성을 위해 지형추종에 적합한 경로생성 기법으로 보로노이 다이어그램을 이용하여 적의 대공망을 회피하는 수평경로를 생성하고, Cubic Spline 기법을 사용하여 정해진 수평경로 상에서 지면과의 근접비행이 가능한 수직경로를 생성하였다. 유도 알고리즘으로 전방주시점 기반의 유도법칙인 Follow-the-Carrot 기법과 Pure Pursuit 기법을 사용하여 생성된 경로를 추종하게 하였다. 제안한 통합알고리즘의 성능을 검증하기 위하여 수치 시뮬레이션을 수행하였다.

IEEE 754-1985 단정도 부동 소수점 연산용 나눗셈기 설계 (Design of a Floating-Point Divider for IEEE 754-1985 Single-Precision Operations)

  • 박안수;정태상
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 합동 추계학술대회 논문집 정보 및 제어부문
    • /
    • pp.165-168
    • /
    • 2001
  • This paper presents a design of a divide unit supporting IEEE-754 floating point standard single-precision with 32-bit word length. Its functions have been verified with ALTERA MAX PLUS II tool. For a high-speed division operation, the radix-4 non-restoring algorithm has been applied and CLA(carry-look -ahead) adders has been used in order to improve the area efficiency and the speed of performance for the fraction division part. The prevention of the speed decrement of operations due to clocking has been achieved by taking advantage of combinational logic. A quotient select block which is very complicated and significant in the high-radix part was designed by using P-D plot in order to select the fast and accurate quotient. Also, we designed all division steps with Gate-level which visualize the operations and delay time.

  • PDF

유니버셜 관절을 이용한 유연 레이저 영상 구현 (An Implementation of Smooth laser image using universal joint)

  • 김태강;이건영
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.347-347
    • /
    • 2000
  • Nowadays, the Laser image is used to realize multi-media show for events, an advertising media and 3D simulation, realization of video image and so on. It is a hot issue to realize the laser image like computer graphic image. The image used in laser projector is vector graphic image that is described by linking point to point. A computer makes this continuous vector graphic images so that the image shows as an animation. A control signal converted by a computer makes the laser projector draw image. Two motors and universal joint are used to realize 2D laser image in this study. Developing a controller applied Look-ahead algorithm and software to interface with personal computer, This study is the chief aim of improving difference of moving velocity that is appeared from edge of vector graphic image and disparity of graphic density.

  • PDF