• Title/Summary/Keyword: Look-ahead Algorithm

Search Result 44, Processing Time 0.03 seconds

Velocity Profile Generation of CNC Machines by the Look Ahead Algorithm (Look Ahead 알고리즘에 의한 CNC 공작 기계의 속도 궤적 생성 연구)

  • 전도영;김한석
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.977-980
    • /
    • 1995
  • This paper proposes the look ahead algorithm with the trapezoidal velocity trajectory in each G-code block. The algorithm requires the information on the length of next trajectories and the connecting angle between each trajectiories. A method of generating the maximum corner velocity upon the connecting angle within the machining tolerance is developed and applied to the look ahead algorithm. Simulations and experiments witha machining center show the effectiveness of the methodology.

  • PDF

Development of Look Ahead Interpolation Algorithm For PC Based CNC System (PC기반CNC시스템을 위한 Look Ahead 보간 알고리즘 개발)

  • Ryu, Sun-Joong
    • Journal of the Semiconductor & Display Technology
    • /
    • v.14 no.4
    • /
    • pp.30-37
    • /
    • 2015
  • This research aims to develop Look Ahead position interpolation algorithm for small size CNC machine controlled by PC based controller. Look Ahead scheme can process a bundle of CNC's linear interpolation commands simultaneously, which reduces acceleration and deceleration time within single linear interpolation command. The algorithm is derived as simple analytical form which can be adapted to PC based CNC system by C language programming. The performance of the algorithm was verified by tail stock machining G codes experimentally. The average traverse speed of the CNC machine was increased by 27.5% and the total traverse time also reduced by 27.2% with the Look Ahead scheme.

A Look-ahead Heuristic Algorithm for Large-scale Part-Machine Grouping Problems (대단위 부품-기계 군집 문제를 위한 Look-ahead 휴리스틱 알고리듬)

  • Baek Jong-Kwan;Baek Jun-Geol;Kim Chang Ouk
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.3
    • /
    • pp.41-54
    • /
    • 2005
  • In this paper, we consider a multi-objective machine cell formation problem. This problem Is characterized as determining part route families and machine cells such that total sum of inter-ceil part movements and maximum machine workload imbalance are simultaneously minimized. Together with the objective function, alternative part routes and the machine sequences of part routes are considered In grouping Part route families. Due to the complexity of the problem, a two-phase heuristic algorithm is proposed. And we developed an n-stage look-ahead heuristic algorithm that generalizes the roll-out algorithm. Computational experiments were conducted to verify the performance of the algorithm.

Performance Evaluation of Left-Comer and Look-Ahead Chart Parsing for Small-Sized Context Free Grammar (소규모 문맥 자유 문법에 대한 Left-Corner / Look-Ahead 차트 파싱 알고리즘의 성능 평가)

  • Shim, Kwang-Seob
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.7
    • /
    • pp.571-579
    • /
    • 2009
  • A left-comer and look-ahead chart parsing algorithm suppresses the generation of meaningless intermediate structures, and thus, gains parsing speed-ups. However, the algorithm requires additional costs to maintain left-comer and look-ahead information throughout the parsing process. Albeit the additional costs, previous research shows that significant parsing speed-ups have been achieved for large-sized context-free grammars. In this paper, we perform similar experiments with a small-sized grammar. We still get parsing speed-ups, but relatively low. We also find that left-comer information has rather negative effects on parsing speed-ups.

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

LMI-BASED $H_{\infty}$ LATERAL CONTROL OF AN AUTONOMUS VEHICLE BY LOOK-AHEAD SENSING

  • Kim, C.S.;Kim, S.Y.;Ryu, J.H.;Lee, M.H.
    • International Journal of Automotive Technology
    • /
    • v.7 no.5
    • /
    • pp.609-618
    • /
    • 2006
  • This paper presents the lateral control of an autonomous vehicle by using a look-ahead sensing system. In look-ahead sensing by an absolute positioning system, a reference lane, constructed by straight lanes or circular lanes, was switched by a segment switching algorithm. To cope with sensor noise and modeling uncertainty, a robust LMI-based $H_{\infty}$ lateral controller was designed by the feedback of lateral offset and yaw angle error at the vehicle look-ahead. In order to verify the safety and the performance of lateral control, a scaled-down vehicle was developed and the location of the vehicle was detected by using an ultrasonic local positioning system. In the mechatronic scaled-down vehicle, the lateral model and parameters are verified and estimated by a J-turn test. For the lane change and reference lane tracking, the lateral controllers are used experimentally. The experimental results show that the $H_{\infty}$ controller is robust and has better performance compared with look-down sensing.

Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks (광 버스트 스위칭 네트워크에서 Look-Ahead 알고리즘을 적용한 그룰 스케줄링의 성능 분석)

  • Shin, Jong-Dug;Jang, Won-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1037-1043
    • /
    • 2006
  • There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.

Design of Jerk Bounded Feed Rate with Look Ahead using Adaptive NURBS Interpolator (NURBS 적응보간기를 이용한 Jerk 제한 이송속도 생성)

  • Kweon S.H.;Mohan S.;Yang S.H.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.457-458
    • /
    • 2006
  • A method for obtaining smooth, jerk bounded feed rate profile in high speed machining has been developed. This study proposes a NURBS interpolator based on adaptive feed rate control with a well developed look ahead algorithm which takes into account the machining dynamics as well. Limitation of jerk and proportional torque rate result in smoothened loads on the machine which effectively reduces excitation of the resonant frequencies of the machine. It is found that the values of the feed rate of the down stream sharp corner have profound effect on the feed rate of the upstream sharp corners. By using a windowing scheme the feed rate profile obtained after look ahead method is re-interpolated to reduce the jerk related problems. This is compared with the adaptive NURBS interpolator to show the effectiveness of the proposed method. Simulation results indicate that the consideration of 'ripple effect' is important in avoiding jerk and thereby increasing the machining accuracy.

  • PDF

Design of 10-Gb/s Adaptive Decision Feedback Equalizer with On-Chip Eye-Opening Monitoring (온 칩 아이 오프닝 모니터링을 탑재한 10Gb/s 적응형 Decision Feedback Equalizer 설계)

  • Seong, Chang-Kyung;Rhim, Jin-Soo;Choi, Woo-Young
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.1
    • /
    • pp.31-38
    • /
    • 2011
  • With the increasing demand for high-speed transmission systems, adaptive equalizers have been widely used in receivers to overcome the limited bandwidth of channels. In order to reduce the cost for testing high-speed receiver chips, on-chip eye-opening monitoring (EOM) technique which measures the eye-opening of data waveform inside the chip can be employed. In this paper, a 10-Gb/s adaptive 2-tap look-ahead decision feedback equalizer (DFE) with EOM function is proposed. The proposed EOM circuit can be applied to look-ahead DFEs while existing EOM techniques cannot. The magnitudes of the post-cursors are measured by monitoring the eye of received signal, and coefficients of DFE are calculated using them by proposed adaptation algorithm. The circuit designed in 90nm CMOS technology and the algorithm are verified with post-layout simulation. The DFE core occupies $110{\times}95{\mu}m^2$ and consumes 11mW in 1.2V supply voltage.