• Title/Summary/Keyword: advanced numerical algorithm

Search Result 183, Processing Time 0.022 seconds

Advanced Lane Change Assist System for Automatic Vehicle Control in Merging Sections : An algorithm for Optimal Lane Change Start Point Positioning (고속도로 합류구간 첨단 차로변경 보조 시스템 개발 : 최적 차로변경 시작 지점 Positioning 알고리즘)

  • Kim, Jinsoo;Jeong, Jin-han;You, Sung-Hyun;Park, Janhg-Hyon;Young, Jhang-Kyung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.3
    • /
    • pp.9-23
    • /
    • 2015
  • A lane change maneuver which has a high driver cognitive workload and skills sometimes leads to severe traffic accidents. In this study, the Advanced Lane Change Assist System (ALCAS) was developed to assist with the automatic lane changes in merging sections which is mainly based on an automatic control algorithm for detecting an available gap, determining the Optimal Lane Change Start Point (OLCSP) in various traffic conditions, and positioning the merging vehicle at the OLCSP safely by longitudinal automatic controlling. The analysis of lane change behavior and modeling of fundamental lane change feature were performed for determining the default parameters and the boundary conditions of the algorithm. The algorithm was composed of six steps with closed-loop. In order to confirm the algorithm performance, numerical scenario tests were performed in various surrounding vehicles conditions. Moreover, feasibility of the developed system was verified in microscopic traffic simulation(VISSIM 5.3 version). The results showed that merging vehicles using the system had a tendency to find the OLCSP readily and precisely, so improved merging performance was observed when the system was applied. The system is also effective even during increases in vehicle volume of the mainline.

Simultaneous 3D Machining with Real-Time NURBS Interpolation

  • Hong, Won-Pyo;Lee, Seok-Woo;Park, Hon-Zong;Yang, Min-Yang
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.3
    • /
    • pp.336-342
    • /
    • 2003
  • Increasing demand on precision machining using computerized numerical control (CNC) machines have necessitated that the tool move not only with the smallest possible position error but also with smoothly varying feedrates in 3-dimensional (3D) space. This paper presents the simultaneous 3D machining process investigated using a retrofitted PC-NC milling machine. To achieve the simultaneous 3-axis motions, a new precision interpolation algorithm for 3D Non Uniform Rational B-Spline (NURBS) curve is proposed. With this accurate and efficient algorithm for the generation of complex 3D shapes, a real-time NURBS interpolator was developed using a PC and the simultaneous 3D machining was accomplished satisfactorily.

On Development of Vibration Analysis Algorithm of Beam with Multi-Joints (다관절 보의 진동해석 알고리즘의 개발에 관한 연구)

  • 문덕홍;여동준;최명수
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.18 no.5
    • /
    • pp.68-77
    • /
    • 1994
  • The authors apply the transfer influence coefficient method to the 3-dimensional vibration analysis of beam with multi-joints and formulate a general algorithm to analysis the longitudinal, flexural and torsional coupled free vibration. In this paper, the structure, which is mainly founded in the robot arms, cranes and so on, has some crooked parts, subsystems and joints but has no closed loop in this system. It is modeled as the beam of a distributed mass system with massless translational, rotational and torsional springs in each node, and joint elements of release or roll at which node the displacement vector is discontinuous. The superiorty of the present method to the transfer matrix method in the computation accuracy was confirmed by the numerical computation results. Moreover, we confirmed that boundary and intermediate conditions could ve controlled by varying the values o the spring constants.

  • PDF

Genetic Algorithm for Designing Independent Manufacturing Cells (독립적인 생산셀 설계를 위한 유전 알고리즘)

  • Moon, Chi-Ung;Yi, Sang-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.3
    • /
    • pp.581-595
    • /
    • 1997
  • The procedure of grouping the machines and parts to form cells is called manufacturing cell design. The manufacturing cell design is an important step in the development and implementation of advanced manufacturing systems. For the successful implementation of the manufacturing systems, identification of independent manufacturing cells, i.e., cells where parts are completely processed in the cell and no intercell movements, is necessary in the design phase. In this paper, we developed a mixed integer programming model and genetic algorithm based procedure to solve the independent manufacturing cells design problem considering the alternative process plans and machines duplication. Several manufacturing parameters such as, production volume, machine capacity, processing time, number of cells and cell size, are considered in the process. The model determines the process plan for parts, port families and machine cells simultaneously. The model has been verified with the numerical examples.

  • PDF

On Development of Vibration Analysis Algorithm of Beam with Multi - Joints(II) (다관절 보의 진동해석 알고리즘 개발에 관한 연구 (II))

  • 문덕홍;최명수;홍숭수;강현석
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.21 no.3
    • /
    • pp.256-266
    • /
    • 1997
  • The authors apply the transfer influence coefficient method to the 3. dimensional vibration analysis of beam with multi - joints and formulate a general algorithm to analyse the longitudinal, flexural and torsional coupled forced vibration. In this paper, a structure which is mainly found in the robot arms, cranes and so on, has some crooked parts, subsystems and joints, but has no closed loop in this system. It is modeled as the beam of a distributed mass system with massless translational, rotational and torsional springs in each node, and joint elements of release or roll at node which the displacement vector is discontinuous. The superiority of the present method to the transfer matrix method in the computation accuracy was confirmed from the numerical computation results. Moreover, we confirmed that boundary and intermediate conditions could be controlled by varying the values of the spring constants.

  • PDF

ADVANCED DOMAIN DECOMPOSITION METHOD BY LOCAL AND MIXED LAGRANGE MULTIPLIERS

  • Kwak, Junyoung;Chun, Taeyoung;Cho, Haeseong;Shin, Sangjoon;Bauchau, Olivier A.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.18 no.1
    • /
    • pp.17-26
    • /
    • 2014
  • This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.

EFFICIENT LATTICE REDUCTION UPDATING AND DOWNDATING METHODS AND ANALYSIS

  • PARK, JAEHYUN;PARK, YUNJU
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.19 no.2
    • /
    • pp.171-188
    • /
    • 2015
  • In this paper, the efficient column-wise/row-wise lattice reduction (LR) updating and downdating methods are developed and their complexities are analyzed. The well-known LLL algorithm, developed by Lenstra, Lenstra, and Lov${\acute{a}}$sz, is considered as a LR method. When the column or the row is appended/deleted in the given lattice basis matrix H, the proposed updating and downdating methods modify the preconditioning matrix that is primarily computed for the LR with H and provide the initial parameters to reduce the updated lattice basis matrix efficiently. Since the modified preconditioning matrix keeps the information of the original reduced lattice bases, the redundant computational complexities can be eliminated when reducing the lattice by using the proposed methods. In addition, the rounding error analysis of the proposed methods is studied. The numerical results demonstrate that the proposed methods drastically reduce the computational load without any performance loss in terms of the condition number of the reduced lattice basis matrix.

Partially Observable Markov Decision Process with Lagged Information over Infinite Horizon

  • Jeong, Byong-Ho;Kim, Soung-Hie
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.16 no.1
    • /
    • pp.135-146
    • /
    • 1991
  • This paper shows the infinite horizon model of Partially Observable Markov Decision Process with lagged information. The lagged information is uncertain delayed observation of the process under control. Even though the optimal policy of the model exists, finding the optimal policy is very time consuming. Thus, the aim of this study is to find an .eplison.-optimal stationary policy minimizing the expected discounted total cost of the model. .EPSILON.- optimal policy is found by using a modified version of the well known policy iteration algorithm. The modification focuses to the value determination routine of the algorithm. Some properties of the approximation functions for the expected discounted cost of a stationary policy are presented. The expected discounted cost of a stationary policy is approximated based on these properties. A numerical example is also shown.

  • PDF

The development of a visual tracking algorithm for the stable grasping of a moving object (움직이는 물체의 안정한 파지를 위한 시각추적 알고리즘 개발)

  • Cha, In-Hyuk;Sun, Yeong-Gab;Han, Chang-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.2
    • /
    • pp.187-193
    • /
    • 1998
  • This paper proposes an advanced visual tracking algorithm for the stable grasping of a moving target(2D). This algorithm is programmed to find grasping points of an unknown polygonal object and execute visual tracking. The Kalman Filter(KF) algorithm based on the SVD(Singular Value Decomposition) is applied to the visual tracking system for the tracking of a moving object. The KF based on the SVD improves the accuracy of the tracking and the robustness in the estimation of state variables and noise statistics. In addition, it does not have the numerical unstability problem that can occur in the visual tracking system based on Kalman filter. In the grasping system, a parameterized family is constructcd, and through the family, the grasping system finds the stable grasping points of an unknown object through the geometric properties of the parameterized family. In the previous studies, many researchers have been studied on only 'How to track a moving target'. This paper concern not only on 'how to track' but also 'how to grasp' and apply the grasping theory to a visual tracking system.

  • PDF

Firing Data Calculation Algorithm for Smart Weapon System Under Non-standard Conditions (스마트무장 비 표준조건 사격제원 산출 알고리즘)

  • Moon, Kyujin;Jeong, Ui-Taek;Lee, Yongseon;Choi, Sungho;Ryoo, Chang-Kyung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.50 no.4
    • /
    • pp.233-240
    • /
    • 2022
  • The smart weapon system is a new weapon system of the future battlefield environment as a miniature guided weapon that performs precision strike missions through terminal phase guidance. However, it has small coverage to guide due to its low maneuverability because the smart weapon is controlled by using actuator of piezoelectric drive type due to the structural limitations. In this paper, we propose a firing data calculation algorithm under non-standard conditions to increase the effectiveness of the smart weapon. The proposed algorithm calculates firing data under non-standard conditions by calibrating firing data under standard conditions using information acquired in battlefield environments. The performance of the proposed algorithm is verified by numerical simulations under various conditions.