• 한국시뮬레이션학회논문지
• /
• 제18권2호
• /
• pp.57-64
• /
• 2009

물리적 기반의 다이내믹 시뮬레이션에 있어서 안정적이고 효율적인 제한 시스템은 매우 중요한 요소 중 하나이다. 본 논문은 기존에 널리 사용되고 있는 제한 시스템들(Lagrange Multiplier method, Baumgarte stabilization method, Post-stabilization Method, Implicit constraint enforcement method, Fast projection method)에 대한 분석과 평가를 통해 제한 시스템을 사용하고자 하는 사용자들에게 적절한 선택을 할 수 있는 지침을 제공하고자 한다. 본 논문은 기존의 제한 방법들에 대한 수학적 수식들이 설명되어 있고, 제한 오차 비교, 계산 비용, 동적 움직임 분석 등을 통해 기존 제한 시스템들 각각에 대한 평가를 제공한다.

• 한국자동차공학회논문집
• /
• 제5권1호
• /
• pp.154-161
• /
• 1997

This paper presents the method to eliminate the constraint reaction in the Lagrange multiplier form equation of motion by using a generalized coordinate driveder from the velocity constraint equation. This method introduces a matrix method by considering the m dimensional space spanned by the rows of the constraint jacobian matrix. The orthogonal vectors defining the constraint manifold are projected to null vectors by the tangential vectors defined on the constraint manifold. Therefore the orthogonal projection matrix is defined by the tangential vectors. For correcting the generalized position coordinate, the optimization problem is formulated. And this correction process is analyzed by the quasi Newton method. Finally this method is verified through 3 dimensional vehicle model.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.376-382
• /
• 1991

In the analysis of constrained holonomic systems, the Lagange multiplier method yields a system of second-order ordinary differential equations of motion and algebraic constraint equations. Conventional holonomic or nonholonomic constraints are defined as geometric constraints in this paper. Previous works concentrate on the geometric constraints. However, if the total energy of a dynamic system can be computed from the initial energy plus the time integral of the energy input rate due to external or internal forces, then the total energy can be artificially treated as a constraint. The violation of the total energy constraint due to numerical errors can be used as information to control these errors. It is a necessary condition for accurate simulation that both geometric and energy constraints be satisfied. When geometric constraint control is combined with energy constraint control, numerical simulation of a constrained dynamic system becomes more accurate. A new convenient and effective method to implement energy constraint control in numerical simulation is developed based on the geometric interpretation of the relation between constraints in the phase space. Several combinations of energy constraint control with either Baumgarte's Constraint Violation Stabilization Method (CVSM) are also addressed.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 춘계학술대회
• /
• pp.706-709
• /
• 2004

A numerical method was developed that imposes constraint condition on the order parameters in martensitic phase transformation. In the method, an amplitude function having values of 1 or 0 was multiplied to transformation rates. The merit of the method is that the imposition of the constraint condition is more straightforward than a method with Lagrangian multiplier and easy to implement in the tangent modulus method. The developed method is applied to three-dimensional finite element analyses of single and poly crystalline shape memory alloys.

• 한국컴퓨터정보학회논문지
• /
• 제22권9호
• /
• pp.9-16
• /
• 2017

The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

• 제어로봇시스템학회논문지
• /
• 제17권7호
• /
• pp.619-624
• /
• 2011

This paper presents a controller design method for a robust control problem with multiple constraints using genetic algorithms and LMI design method. A robust $H_{\infty}$ constraint with loop shaping and pole placement is used to address disturbance attenuation with error limits and desired transient specifications, in spite of the plant uncertainties and disturbances. In addition, a loop gain constraint is considered so as not to enlarge the loop gain unnecessarily. The robust $H_{\infty}$ constraint and pole placement constraint can be expressed in terms of two matrix inequalities and the loop gain constraint can be considered as an objective function so that genetic algorithms can be applied. Accordingly, a robust controller can be obtained by integrating genetic algorithms with LMI approach. The proposed controller design method is applied to a track-following system of an optical disk drive and is evaluated through simulation results.

• 한국도로학회논문집
• /
• 제15권4호
• /
• pp.155-165
• /
• 2013

PURPOSES : Benefits for improvement of travel time reliability obtained from construction of new highways should be considered as a major factor in the feasibility study for highway constructions. The purpose of this study is to develop a method of estimation for the value of travel time reliability. METHODS : Highway type (urban/rural highway) and traffic flow type(interrupted/uninterrupted) was considered to estimate he value of travel time reliability. And Double-bounded Dichotomous Choice among Contingent Valuation Method(CVM) was applied to survey the willingness-to-pay of drivers when travel time reliability is improved. Finally the value of travel time reliability was estimated using the results of survey and logit model. The value of travel time reliability was estimated considering travel objectives, time constraint travel and non-time constraint travel. RESULTS: The value of travel time reliability of business trip is higher than that of non-business trip. The value of travel time reliability of time constraint travel is higher than that of non-time constraint travel. The value of travel time reliability in urban area is higher than that in rural area. CONCLUSIONS: It was concluded that the proposed method in this study is more realistic and proper to estimate the value of travel time reliability because it reflects the situations of time constraint travel and non-time constraint travel.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1098-1100
• /
• 2005

The floorplanning problem is an essential design step in VLSI layout design and it is how to place rectangular modules as density as possible. And then, as the DSM advances, the VLSI chip becomes more congested even though more metal layers are used for routing. Usually, a VLSI chip includes several buses. As design increases in complexity, bus routing becomes a heavy task. To ease bus routing and avoid unnecessary iterations in physical design, we need to consider bus planning in early floorplanning stage. In this paper, we propose a floorplanning method for topological constraint consisting of bus constraint and memory constraint. The proposed algorithms based on Genetic Algorithm(GA) is adopted a sequence pair. For selection control, new objective functions are introduced for topological constraint. Studies on floor planning and cell placement have been reported as being applications of GA to the LSI layout problem. However, no studies have ever seen the effect of applying GA in consideration of topological constraint. Experimental results show improvement of bus and memory constraint.

• 한국공간정보시스템학회 논문지
• /
• 제11권1호
• /
• pp.79-86
• /
• 2009

제약 데이터베이스의 투플은 제약 논리식으로 구성되었으며, 공간 데이터의 표현 및 질의를 비교적 간결하게 처리할 수 있다. 제약 데이터베이스를 통한 공간 데이터의 실렉션, 합집합, 교집합 등의 질의 연산 처리는 간단하게 관련 투플 간에 제약식을 포함시켜 주면 된다. 그러나 중복되거나 불필요한 데이터가 증가할 수 있으며, 그에 따른 질의 비용이 증가될 수도 있다. 이 논문에서는 제약 데이터베이스에서의 질의처리 결과에 대한 문제점을 밝히고, 효율적인 질의처리를 위해서 결과 릴레이션에 대한 투플 최소화 정리기법의 제안 및 그 효과를 분석했다. 우리는 투플 최소화 기법을 이용하여 제약 릴레이션의 불필요한 제약식을 제거함에 따른 질의처리의 효율성이 개선됨을 확인할 수 있었다.

• 대한임베디드공학회논문지
• /
• 제8권2호
• /
• pp.111-119
• /
• 2013

This paper proposes one method on photometric stereo calibration using the constraint on light source directions in which the light sources have the unknown tilt and slant angles but the slant angles are the same. First, the constraint is analyzed based on the equation of linear ambiguity which leads to the conclusion that another constraint should be added to solve the calibration completely. Later, the combination of constraint on light source directions and the constraint that there exists at least six surface patches having known albedos is exploited to resolve the linear ambiguity up to an accurate and close-form solution. The effective performance of the proposed method is demonstrated through experiment results.