• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.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.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.149-159
• /
• 2001

There have been lots of researches for providing a personalized service to a customer using one-to-one marketing and collaborative filtering techniques in E-Commerce. However, there are technical difficulties for providing the recommendation of products far users, which often involve high complexity of computation. In this paper, we have presented an integrated method of classification problem solving method and constraint based configuration techniques. This method can reduce a complexity of computation by classifying a solution domain space that has a higher complexity of composition. Thereafter, we have modeled customers constraints and the components of products to configure a complete system by passing it to constraint processing module in Constraint Satisfaction Problems. Constraint-based configuration uses the constraint propagation using the constraints of buyers and the constraints among PC components to configure a proper product for a customer. We have transformed and applied vector space modeling method in the field of information retrieval to consider a customer satisfaction in addition to the CSP. Finally, we have applied our system to test data fur evaluating a customers satisfaction and performance of the proposed system.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.445-449
• /
• 1989

Achievement of a straight line motion in the Cartesian space has a matter of great importance. Minimization of task execution time with linear interpolation in the joint space, accomplishing of a approximation of straight line motion in the Cartesian coordinate is considered as the prespecified task. Such determination yields minimum time joint-trajectory subject to input torque constraints. The applications of these results for joint-trajectory planning of a two-link manipulator with revolute joints are demonstrated by computer simulations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.617-620
• /
• 2000

In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.1-12
• /
• 2009

Iterative algorithms are proposed for the least-squares symmetric solution of AXB = E with a submatrix constraint. We characterize the linear mappings from their independent element space to the constrained solution sets, study their properties and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.1
• /
• pp.67-74
• /
• 2013

Nonlinear guidance law combined with a pseudo pursuit guidance is proposed, to perform stationary target observation mission. Multiple UAVs are considered, with waypoint constraint. The whole guidance is divided into two steps: firstly, waypoint approach, with specified incidence angle; and secondly, loitering around the stationary target. Geometric approach is used to consider the constraint on the waypoint, and a specified phase angle between the loitering UAV and the approaching UAV. In the waypoint approach step, UAVs fly to the waypoint using the pseudo pursuit guidance law. After passing the waypoint, UAVs turn around the target, using a distance error dynamics-based guidance law. Numerical simulations are performed, to verify the performance of the proposed guidance law.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.451-456
• /
• 2004

This study was performed to analyze the operation system of transfer crone to improve the reality of yard operation roles in container terminal and present the applicable method of operation rules to apply the operation priority. And we derived the procedure to estimate the maximum number of waiting truck based on the waiting of truck and the occupancy of driving lane in yard, and analyzed the constraint state of space. To solve the space constraint, we provided a multi-job principle to define the space resource and described the solution and sequence diagram for the principle.

• Journal of information and communication convergence engineering
• /
• v.15 no.2
• /
• pp.73-78
• /
• 2017

A general linearly constrained broadband adaptive array is examined in the eigenvector space with respect to the optimal weight vector and the adaptive algorithm. The optimal weight vector and the general adaptive algorithm in the eigenvector space are obtained by eigenvector matrix transformation. Their operations are shown to be the same as in the standard coordinate system except for the relevant transformed vectors and matrices. The nulling performance of the general linearly constrained broadband adaptive array depends on the gain factor such that the constraint plane is shifted perpendicularly to the origin by an increase in the gain factor. The general linearly constrained broadband adaptive array is observed to perform better than a conventional linearly constrained adaptive array in a coherent signal environment, while the former performs similarly to the latter in a non-coherent signal environment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.1
• /
• pp.133-146
• /
• 1994

Conditional constraints are frequently used to represent relations. To use these conditional constraints, it is necessary to develop an appropriate logic in which these conditional constraints can be represented and manipulated. Nevertheless, there has been little research that addresses interval-based conditional constraints. The proposed approach addresses the use of conditional constraints involving intervals in constraint networks. Two algorithms are presented: (1) a propagation algorithm for an interval-based conditional constraint, which is similar to one for an exact-value conditional constraint; (2) a propagation algorithm for interval-based conditional constraints which satisfy some conditions. The former can be applied to any conditional constraint. However, with the former algorithm, conditional constraints are usually categorized into the cases that they cannot be propagated. After investigating several methods in which most conditional constraints can be propagated, we propose the latter algorithm under certain condition that usually results in smaller resulting design space comparing to the former.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.42-51
• /
• 1992

This paper suggests a measure constraint locus which is the loci of points satisfying the necessary constraint for optimality of a measure in the configuration space. The characterization of four measures for singularity avoidance is worked out by using the measure constraint locus. It gives a global look at the performance of an inverse kinematic algorithm whien each of measures in a kinematically redundant robot is used. The invertible workspace without singularities and the topological properties both on the configuration and operational spaces are analyzed. We discuss also some limitations, based on the topological arguments of measure constraint locus, of the inverse kinematic algorithms, and compare global properties of each of measure. Therfore, a new concept called measure constraint locus gives a methodology for obtaining a conservative joint trajectory without singularities for almost entire workspace.