• Transactions of the Korean Society of Automotive Engineers
• /
• v.21 no.2
• /
• pp.122-130
• /
• 2013

Rail geometries such as cant, grade and curvature can be easily represented by means of a track coordinate system. In this analysis, in order to derive a dynamic and constraint equation of a wheelset, the track coordinate system is used as an intermediate stage. Dynamic and constraint equations of railway vehicle bodies except the wheelset are written in the Cartesian coordinate system as a conventional method. Therefore, whole dynamic equations of a railway vehicle are derived by combining wheelset dynamic equations and dynamic equations of railway vehicle bodies. Constraint equations and constraint Jacobians are newly derived for the track coordinate system. A process for numerical analysis is suggested for the derived dynamic and constraint equations of a railway vehicle. The proposed dynamic analysis of a railway vehicle is validated by comparison against results obtained from VI-RAIL analysis.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.57-64
• /
• 2009

Stable and effective constraint enforcement system is one of the crucial components for physically-based dynamic simulations. This paper presents analysis and evaluation for traditional constraint enforcement systems(Lagrange Multiplier method, Baumgarte stabilization method, Post-stabilization method, Implicit constraint enforcement method, Fast projection method) to provide a guideline to users who need to integrate a suitable constraint enforcement system into their dynamic simulations. The mathematical formulations for traditional constraint enforcement systems are presented in this paper. This paper describes a summary of evaluation which consists of constraint error comparison, computational cost, and dynamic behavior analysis to verify the efficiency of each traditional constraint enforcement system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• 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.

• Asia Marketing Journal
• /
• v.18 no.4
• /
• pp.125-138
• /
• 2017

The goal of the study is to understand how consumers' constraint as opposed to utility structure gives rise to final decision when consumers purchase more than one variant of product at a time, i.e., horizontal variety seeking or multiple-discreteness. Purchase and consumption decision not only produces utility but also involves some sort of cognitive pressure. Past consumption or last purchase is likely to be linked to this burden we face such as concern for obesity, risk of harm, and guilt for mischief. In this research, the existence and the role of dynamic constraint are investigated through a microeconomic utility model with multiple dynamic constraint. The model is applied to the salty snacks data collected from field study where burden for spiciness serves as a constraint. The results are compared to the conventional multiple discreteness choice models of static constraints, and policy implications on price discounts is explored. The major findings are that first, one would underestimate the level of consumer preference for product offerings when ignoring the carry-over of the concern from the past consumption, and second, the impact of price promotion on demand would be properly evaluated when the model allows for the role of constraint as both multiple and dynamic. The current study is different from the existing studies in two ways. First, it captures the effect of 'mental constraint' on demand in formal economic model. Second, unlike the state dependence well documented in the literature, the study proposes the notion of state dependence in different way, via constraint rather than utility.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.534-534
• /
• 2000

This paper proposes a dynamic compensation scheme for input-constrained feedback linearizable nonlinear systems to cope with the windup phenomenon. Given a feedback linearizing controller for such a nonlinear system designed without considering its input constraint, an additional dynamic compensator is proposed to account for the constraint. This dynamic anti-windup is based on the minimization of a reasonable performance index, and some stability properties of the resulting closed-loop are presented.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.173-181
• /
• 2006

In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.6
• /
• pp.148-159
• /
• 1999

A numerical method is presented for the dynamic analysis of spur gears rotating with very high angular speeds. For an efficient computation each gear is assumed to consist of a rotating rigid disk and an elastic tooth having mass, and finite element formulations are used for the equations of motion of the tooth. The geometric constraint is imposed between the rigid disk and the elastic tooth to fix them, and contact condition is imposed between the meshing teeth of the gears. At each iteration of each time step the Lagrange multiplier and contact force are revised by using the constraint error vector, and then the whole equations of motion are time integrated with the given Lagrange multiplier and contact force. For the accurate solution the velocity and acceleration constraints as well as the displacement constraint are satisfied by the monotone reductions of the constraint error vectors. Computing procedures associated with the iterative schemes are explained and numerical simulations are conducted with the spur gears.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.309-314
• /
• 1992

Many dynamic mechanical systems, such as parts-feeders, walking machines, and percussive power tools, are described by equations of motion which are discontinuous. The discontinuities result from kinematic constraint changes which are difficult to foresee, especially in presence of impact. A simulation algorithm for these types of systems must be able to algorithmically predict and detect the kinematic constraint changes without any prior knowledge of the system's motion. This paper presents a rule-based approach to the prediction and detection of kinematic constraint changes between bodies with arc and line boundaries. The developed algorithm's ability to accurately and automatically detect the unpredicted changes of kinematic constraints is demonstrated with a numerical example.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.2
• /
• pp.375-383
• /
• 2016

This paper investigates an optimal consumption, portfolio, and life insurance strategies of a family when there is a borrowing constraint and risk aversion change at the time of death of the breadwinner. A CRRA utility is employed and by using the dynamic programming method, we obtain analytic expressions for the optimal strategies.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.29-43
• /
• 2021

In this paper, a new approach to solve the constrained dynamic programming is proposed by using the constraint programming. While the conventional dynamic programming scheme has the state space augmented with states on constraints, this approach, without state augmentation, represents states of constraints as domains in a contraining programming solver. It has a hybrid computational mechanism in its computation by combining solving the Bellman equation in the dynamic programming framework and exploiting the propagation and inference methods of the constraint programming. In order to portray the differences of the two approaches, this paper solves a simple version of the long-term car rental financing problem. In the conventional scheme, data structures for state on constraints are designed, and a simple inference borrowed from the constraint programming is used to the reduction of violation of constraints because no inference risks failure of a solution. In the hybrid approach, the architecture of interface of the dynamic programming solution method and the constraint programming solution method is shown. It finally discusses the advantages of the proposed method with the conventional method.