• Title/Summary/Keyword: look-ahead point

Search Result 16, Processing Time 0.022 seconds

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

  • 이철수
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2000.04a
    • /
    • 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

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

  • 이철수;이제필
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.9 no.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 (물고기 로봇의 기하학적 경로 추종)

  • Park, Jin-Hyun;Choi, Young-Kiu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.4
    • /
    • pp.906-912
    • /
    • 2014
  • The study of fish robot is a main subject that are related with the propulsive force comparison using a varying amplitude and frequency for body and tail motion trajectory, and the quick turn using a proper trajectory function. In this study, when a fish robot thrusts forward, feedback control is difficult to apply for a fish robot, because body and tail joints as a sine wave are rolled. Therefore, we detect the virtual position based on the path of the fish robot, define the angle errors using the detected position and the look-ahead point on the given path, and design a controller to track given path. We have found that the proposed method is useful through the computer simulations.

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

  • Yo-chan Ahn
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.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

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

  • You, Jun-Bok;Chung, Tae-Sang
    • Proceedings of the KIEE Conference
    • /
    • 2000.11d
    • /
    • 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

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

  • Xuhao Zhang;Dae-Ik Kim
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.2
    • /
    • pp.409-416
    • /
    • 2024
  • With the expansion of floating-point operation requirements for fast high-speed data signal processing and logic operations, the speed of the floating-point operation unit is the key to affect system operation. This paper studies the performance characteristics of different floating-point multiplier schemes, completes partial product compression in the form of carry and sum, and then uses a carry look-ahead adder to obtain the result. Intel Quartus II CAD tool is used for describing Verilog HDL and evaluating performance results of the floating point multipliers. Floating point multipliers are analyzed and compared based on area, speed, and power consumption. The FMAX of modified Booth encoding with Wallace tree is 33.96 Mhz, which is 2.04 times faster than the booth encoding, 1.62 times faster than the modified booth encoding, 1.04 times faster than the booth encoding with wallace tree. Furthermore, compared to modified booth encoding, the area of modified booth encoding with wallace tree is reduced by 24.88%, and power consumption of that is reduced by 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
    • /
    • v.17 no.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 (무인전투기 근접 지형추종을 위한 궤적생성 및 유도 항법)

  • Oh, Gyeong-Taek;Seo, Joong-Bo;Kim, Hyoung-Seok;Kim, Youdan;Kim, Byungsoo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.40 no.11
    • /
    • pp.979-987
    • /
    • 2012
  • This paper implements and integrates algorithms for terrain following of UCAVs (Unmanned Combat Aerial Vehicles): trajectory generation, guidance, and navigation. Terrain following is very important for UCAVs because they perform very dangerous missions such as Suppression of Enemy Air Defences while the terrain following can improve the survivability of UCAVs against from the air defence systems of the enemy. To deal with the GPS jamming, terrain referenced navigation based on nonlinear filter is chosen. For the trajectory generation, Voronoi diagram is adopted to generate horizontal plane path to avoid the air defense system. Cubic spline method is used to generate vertical plane path to prevent collisions with ground while flying sufficiently close to surface. Follow-the-Carrot and pure pursuit tracking methods, which are look-ahead point based guidance algorithms, are applied for the guidance. Numerical simulation is performed to verify the performance of the integrated terrain following algorithm.

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

  • Park, Ann-Soo;Chung, Tea-Sang
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • 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.10a
    • /
    • 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