• Title/Summary/Keyword: the constraint method

Search Result 1,683, Processing Time 0.032 seconds

A Development of Inequality Constrained Algorithm and Applying to Power System Analysis (부등호 제약조건 처리 알고리즘 개발 및 전력계통 해석 적용)

  • Yang, Minuk;Kim, Kern-Joong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.10
    • /
    • pp.1349-1353
    • /
    • 2013
  • The optimal analysis has objective functions, equality constraint functions and inequality functions. Objective functions may be used with inequality function, because occasionally variables are moved to non-analytic condition with calculating objective functions. But inequality constraint functions are very complicated problem in a optimal analysis. this paper suggest a method to solve inequality constraint functions.

A Study on Numerical Analysis of Equation of Motion for Constrained Systems (구속된 시스템 운동방정식의 수치해석에 관한 연구)

  • 은희창;정헌수
    • Journal of KSNVE
    • /
    • v.7 no.5
    • /
    • pp.773-780
    • /
    • 1997
  • Using Generalized Inverse Method presented by Udwadia and Kalaba in 1992, we can obtain equations to exactly describe the motion of constrained systems. When the differential equations are numerically integrated by any numerical integration scheme, the numerical results are generally found to veer away from satisfying constraint equations. Thus, this paper deals with the numerical integration of the differential equations describing constrained systems. Based on Baumgarte method, we propose numerical methods for reducing the errors in the satisfaction of the constraints.

  • PDF

Evaluation of Fracture Toughness considering Constraint Effect of Reactor Pressure Vessel Nozzle (원자로압력용기 노즐부 구속효과를 고려한 파괴인성 평가)

  • Kweon, Hyeong Do;Lee, Yun Joo;Kim, Dong Hak;Lee, Do Hwan
    • Transactions of the Korean Society of Pressure Vessels and Piping
    • /
    • v.15 no.1
    • /
    • pp.71-76
    • /
    • 2019
  • Actual stress distributions in the nozzle of a pressure vessel may not be in plane strain condition, implying that the crack-tip constraint condition may be relaxed in the nozzle. In this paper, a methodology for evaluating the fracture toughness of the ASME Code is presented considering the relaxation of the constraint effect in the nozzle of the reactor pressure vessel. The crack-tip constraint effect is quantified by the T-stress. The equation, which represent the relation between the fracture toughness in the lower constraint condition and the plane strain fracture toughness, is derived using the T-stress. This equation is similar to the method for evaluating the fracture toughness of the Master Curve for low constraint conditions. As a result of evaluating the fracture toughness considering the constraint effect in the reactor inlet, outlet and direct injection nozzles using the proposed equation, it was confirmed that the fracture toughness in the nozzles is higher than the plane strain fracture toughness. Applying the proposed evaluation methodology, it is possible to reflect the relaxation of the constraint effect in the nozzles of the reactor pressure vessel, therefore, the safe operation area on the pressure-temperature limit curve can be prevented from being excessively limited.

A new hybrid optimization algorithm based on path projection

  • Gharebaghi, Saeed Asil;Ardalan Asl, Mohammad
    • Structural Engineering and Mechanics
    • /
    • v.65 no.6
    • /
    • pp.707-719
    • /
    • 2018
  • In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

PAPR Reduction Method for the Nonlinear Distortion in the Multicode CDMA System (멀티코드 CDMA 시스템에서 비선형 왜곡에 대처하는 PAPR 저감 기법)

  • Kim Sang-Woo;Kim Namil;Kim Sun-Ae;Suh Jae-Won;Ryu Heung-Cyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.12 s.103
    • /
    • pp.1171-1178
    • /
    • 2005
  • Multi-code code division multiple access(MC-CDMA) has been proposed for providing the various service rates with different quality of service requirement by assigning multiple codes and increasing the capacity. However, it suffers from the serious problem of high peak to average power ratio(PAPR). So, it requires large input back-off, which causes poor power consumption in high power amplifier(HPA). In this paper, we propose a new method that can reduce PAPR efficiently by constraint codes based on the opposite correlation to the incoming information data in MC-CDMA. PAPR reduction depends on the length and indices of constraint codes in MC-CDMA system. There is a trade-off between PAPR reduction and the length of constraint codes. From the simulation results, we also investigate the BER improvement in AWGN channel with HPA. The simulation results show that BER performance can be similar with linear amplifier in two cases: 1) Using exact constraint codes without input back-off and 2) a few constraint codes with small input back-off.

Kinematic Calibration Method for Redundantly Actuated Parallel Mechanisms (여유구동 병렬기구의 기구학적 보정)

  • 정재일;김종원
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.355-360
    • /
    • 2002
  • To calibrate a non-redundantly actuated parallel mechanism, one can find actual kinematic parameters by means of geometrical constraint of the mechanism's kinematic structure and measurement values. However, the calibration algorithm for a non-redundant case does not apply fur a redundantly actuated parallel mechanism, because the angle error of the actuating joint varies with position and the geometrical constraint fails to be consistent. Such change of joint angle error comes from constraint torque variation with each kinematic pose (meaning position and orientation). To calibrate a redundant parallel mechanism, one therefore has to consider constraint torque equilibrium and the relationship of constraint torque to torsional deflection, in addition to geometric constraint. In this paper, we develop the calibration algorithm fir a redundantly actuated parallel mechanism using these three relationships, and formulate cost functions for an optimization algorithm. As a case study, we executed the calibration of a 2-DOF parallel mechanism using the developed algorithm. Coordinate values of tool plate were measured using a laser ball bar and the actual kinematic parameters were identified with a new cost function of the optimization algorithm. Experimental results showed that the accuracy of the tool plate improved by 82% after kinematic calibration in a redundant actuation case.

  • PDF

Performance Analysis of Road Lane Recognition using Road Condition Constraint (차로 제한 조건을 이용한 차로 구분 성능 분석)

  • Kang, Woo-Yong;Lee, Eun-Sung;Park, Jae-Ik;Han, Ji-Ae;Hong, Woon-Ki;Kim, Hyun-Soo;Heo, Moon-Beom;Nam, Gi-Wook
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.3
    • /
    • pp.432-440
    • /
    • 2011
  • This paper focus on lane recognition performance test using a road lane constraint with transport infrastructure information. The constraint is determined through the relation of the drive direction and vehicle position. The road lane constraint sets large limit for first and last lane. To analyze the performance of the proposed method, simulations are carried out. The results show that the lane recognition performance using a constraint is improved 40% at four-lane, 25% at six-lane, 15% at eight-lane.

A Study on the Path Constraint Error Reducing Trajectory Planning (Path Constraint한 궤적 계획법의 위치 오차 감소에 관한 연구)

  • Hwang, Seung-Jae;Park, Se-Woong;Kim, Dong-Jun;Kim, Kab-Il;Kim, Dae-Won
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.843-845
    • /
    • 1995
  • There are a variety of trajectory and control algorithms available for robot trajectory tracking. Before using the enhanced trajectory and control algorithms to reduce the tracking error, we introduce the new method which reduces the tracking error by clipping the joint velocity. A lot of robot trajectory tracking methods are proposed to enhance the robot tracking, but irregular tracking errors are always accompanied. Up to now, these irregular tracking errors are gradually but uniformly reduced by introducing more complicated control algorithms. It is intuitively obvious to reduce only the big errors selectively in the irregular ones for the better performance. By heuristic method, big tracking errors in these irregular ones are assumed mostly due to the fast moving of joint with respect to the same tracking and control method. So, in this paper, we introduce a new method which reduce the big tracking errors by clippings the joint velocity with the constraint of given path. Using this method, desired trajectory tracking is obtained within the far reduced error bound. Also, this method is successfully applied to generate the path-constrained error reducing trajectories for 2-axis SCARA type robot.

  • PDF

Simulation of Vehicle-Structure Dynamic Interaction by Displacement Constraint Equations and Stabilized Penalty Method (변위제한조건식과 안정화된 Penalty방법에 의한 차량 주행에 따른 구조물의 동적상호작용 해석기법)

  • Chung, Keun Young;Lee, Sung Uk;Min, Kyung Ju
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.4D
    • /
    • pp.671-678
    • /
    • 2006
  • In this study, to describe vehicle-structure dynamic interaction phenomena with 1/4 vehicle model, nonlinear Hertzian contact spring and nonlinear contact damper are adopted. The external loads acting on 1/4 vehicle model are selfweight of vehicle and geometry information of running surface. The constraint equation on contact surface is implemented by the Penalty method with stabilization and the reaction from constraint violation. To describe pitching motion of various vehicles two types of the displacement constraint equations are exerted to connect between car bodies and between bogie frames, i.e., the rigid body connection and the rigid body connection with pin, respectively. For the time integration of dynamic equations of vehicles and structure Newmark time integration scheme is adopted. To reduce the error caused by inadequate time step size, adaptive time-stepping technique is also adopted. Thus, it is expected that more versatile dynamic interaction phenomena can be described by this approach and it can be applied to various railway dynamic problems with low computational cost.

Dynamic VBR traffic characterization for video service in ATM network (ATM 망에서 비디오 서비스를 위한 동적 VBR 트래픽 특성화)

  • 황재철;조미령;이상원;이상훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.4
    • /
    • pp.455-470
    • /
    • 2001
  • This paper is focused on the traffic characterization for the efficient transmission of the VBR video source in the ATM network. For the traffic characterization, low traffic monitoring technique is applied and the dynamic VBR characterization method is suggested to satisfy the delay requirement. The dynamic VBR method uses the token bucket algorithm buffering though Cumulative Constraint Function. According to the Cumulative Constraint Function, the packet initially started transferring at the peak rate and the token bucket provided proper amount of buffer for traffic after a certain period of monitoring. It also reduced the network resource bandwidth through renewal of the cumulative frame and changed the rate from the previous frame information. It requires only small amount of monitoring and causes little overhead. In addition, it lowered the complexity of Deterministic Constraint Function to 0(n) and mapped the token rate and token depth to the token bucket. This study shows less network resource consumed than the previous method, comparing and analyzing the result of simulations.

  • PDF