• 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.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.784-786
• /
• 2000

This paper implements and analyzes logically the Borrow Look-ahead Subtracter using Borrow Generator and Borrow Propagator. In subtracting calculation, we improve the calculating efficiency with using 4-bit subtracter which has Borrow Look-ahead Subtracters connection, and show that this is compatible with adder using the concept of Carry Generator and Carry Propagator. This subtracter may be useful in frequent subtracting calculation. We think this approach makes it possible to implement simple ALU(Arithmetic Logic Unit) with combining the concept of Borrow Look-ahead Subtracter and Carry Look-ahead Adder.

• 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.

• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.566-569
• /
• 2004

본 연구에서는 생산능력의 제한이 있는 다계층(multi-echelon) 공급사슬에서의 효과적인 분배계획수립을 목적으로 한다. 수요 정보는 계획 기간(planning horizon) 동안 확정적인 형태로 주어지고 이러한 상황 하에서 전체 공급사슬에서 발생하는 재고유지 비용(holding cost)과 재고이월 비용(backorder cost)의 합을 최소화하는 분배 문제의 해법을 제시하고자 한다. 본 연구에서는 총비용을 최소화하는 각 노드별 분배량을 결정하기 위해서 look-ahead 기법을 사용한다. Look-ahead 기법을 통해 분배 계획 수립 시 해당 기간의 수요 정보뿐만 아니라 미래 수요를 함께 반영함으로써 생산능력 제한에 효과적으로 대처할 수 있도록 하였다. Look-ahead 기법을 적용하기 위해 본 문제를 단일 기계 일정계획(single machine scheduling) 문제로 전환하고 이에 대한 효율적인 발견적 기법을 제시한다. 또한 제안된 발견적 기법의 성능을 평가하기 위해 다양한 실험 조건하에서 제안된 알고리듬과 기존의 미래 수요를 고려하지 않는 계층 재고 정책(echelon stock policy)의 결과를 비교하여 본 연구의 우수성을 입증하였다.

• Journal of the Korea Safety Management & Science
• /
• v.8 no.5
• /
• pp.139-150
• /
• 2006

The aim of this study is to establish an efficient distribution planning for a capacitated multi-stage supply chain. We assume that the demand information during planning horizon is given a deterministic form using a certain forecasting method. Under such a condition, we present a cost effective heuristic method for minimizing chain-wide supply chain inventory cost that is the sum of holding and backorder costs by using look-ahead technique. We cope with the capacity restriction constraints through look-ahead technique that considers not only the current demand information but also future demand information. To evaluate performance of the proposed heuristic method, we compared it with the extant research that utilizes echelon stock concept, under various supply chain settings.

• 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.

• Journal of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.987-1004
• /
• 2020

Motivated by the traffic flow model with Arrhenius looka-head relaxation dynamics introduced in [25], this paper proposes a traffic flow model with look ahead relaxation-behind intensification by inserting look behind intensification dynamics to the flux. Finite time shock formation conditions in the proposed model with various types of interaction potentials are identified. Several numerical experiments are performed in order to demonstrate the performance of the modified model. It is observed that, comparing to other well-known macroscopic traffic flow models, the model equipped with look ahead relaxation-behind intensification has both enhanced dispersive and smoothing effects.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.63-66
• /
• 2000

본 논문에서는 신호 채널을 이용하여 실제적인 호 연결 처리 전에 착신 단말의 가용 전송률 및 서비스 호환성 여부를 조사하는 Look Ahead Enquiry/Response 기법에 의한 새로운 ABR 트래픽 파라메터 협상 베시지 흐름 메카니즘을 제안하였으며, 신호채널을 이용한 ABR 트래픽 전송률 제어가 가능하도록 Bandwidth Request 메시지와 Bandwidth Allocated 메시지를 고안하였다. 또한 성능 분석을 통하여 기존 방식과 비교하여 호 처리시간과 링크 이용 효율측면에서 본 논문에서 제안한 방안이 월등히 우수함을 알 수 있었다.

• 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.