• 대한수학회보
• /
• 제23권2호
• /
• pp.141-148
• /
• 1986

In [1], M. Guignard considered a constraint set in a Banach space, which is similar to that in [2] and gave a first order necessary optimality condition which generalized the Kuhn-Tucker conditions [3]. Sufficiency is proved for objective functions which is either pseudoconcave [5] or quasi-concave [6] where the constraint sets are taken pseudoconvex. In this note, we consider a psedoconvex programming problem in a Hilbert space. Constraint set in a Hillbert space being pseudoconvex and the objective function is restrained by an operator equation. Then we use the methods similar to that in [1] and [6] to obtain a necessary and sufficient optimality condition.

• 전자공학회논문지B
• /
• 제28B권10호
• /
• pp.761-770
• /
• 1991

This paper suggests a measure constraint locus for characterization of the performance of a subtask for a redundant robot. The measure constraint locus are the loci of points satisfying the necessary constraint for optimality of measure in the joint configuration space. To uniquely obtain an inverse kinematic solution, one must consider both measure constraint locus and self-motion manifolds which are set of homogeneous solutions. Using measure constraint locus for maniqulability measure, the invertible workspace without singularities and the topological property of the configuration space for linding equilibrium configurations are analyzed. We discuss some limitations based on the topological arguments of measure constraint locus, of the inverse kinematic algorithm for a cyclic task. And the inverse kinematic algorithm using global maxima on self-motion manifolds is proposed and its property is studied.

• 제어로봇시스템학회논문지
• /
• 제5권1호
• /
• pp.62-68
• /
• 1999

The attitude of a vehicle can be precisely determined using GPS carrier phase measurements from more than two antennas attached to a vehicle and an efficient integer ambiguity resolution technique. Many methods utilizing the known baseline length as a constraint of independent elements of integer ambiguities are proposed to resolve integer ambiguity at real time. Three-dimensional search space is reduced to two-dimensional search space with this constraint. Thus the true integer ambiguity can be easily determined with less computational burden and fewer number of measurements. But there are still strong requirements for the real time integer ambiguity resolution, which uses single epoch measurement of long baseline. In this paper, a new constraint from the geometry of multiple baselines is derived. With this new constraint, two-dimensional search space is further reduced to one-dimensional search space. It makes possible to determine integer ambiguity with single epoch measurement. The proposed method is applied to real data to show its effectiveness.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2011년도 제43차 동계학술발표논문집 19권1호
• /
• pp.59-62
• /
• 2011

A new method is proposed for stereo vision where solution to disparity map is presented in terms of Line constraint and Reliability space -- the first constraint proposes a progressive framework for stereo matching which applies local area pixel-values from corresponding lines in the left and right image pairs. The second states that reliability space based on corresponding points records the disparity and then we are able to apply the median filter in order to reduce the noises which occur in the process. A coarse to fine result is presented after the median filtering, which improves the final result qualitatively. Experiment is evaluated by rectified stereo matching images pairs from Middlebury datasets and has proved that those two adopted strategies yield good matching quantitative results in terms of fast running speed.

• 대한지리학회지
• /
• 제30권2호
• /
• pp.120-131
• /
• 1995

이동행태를 분석하기 위해 시.공간이론 중 3가지 제약조건인 능력제약, 조합제약, 권위제약이 공간특성에 따라 성별, 연령이 이동에 어느 정도 영향을 주는지를 분석하고 적 정 이동군집수를 결정하고자 한다. 이중 권위제약은 사회적 제약조건으로서 도시시설물이나 교통수단의 이용에 있어 사회적 신분이나 규약에 의해 이동영역이 통제되는 것을 의미한다. 공간특성에 의한 이동의 통제는, 도시와 농촌으로 구분하였을 때 도시지역 사람들은 농촌지 역 사람들에 비해 첨두시간대의 이동 참여율이 높으며, 이동군집수 결정에 있어서도 여러 연령층이 유사한 이동행태를 지니고 있음을 알 수 있다. 도시지역 사람들은 공간특성상에 따른 이동의 다양성이 군집수 결정에 상관되었으며, 이는 공간특성에 따라 이동행태가 달라 질 수 있다고 볼 수 있다. 성별 및 연령에 의한 통제 역시 사회적 제약조건으로서 이동행태 에 영향이 있음을 알 수 있다.

• Journal of information and communication convergence engineering
• /
• 제15권3호
• /
• pp.137-142
• /
• 2017

A general linearly constrained narrowband adaptive array is examined in the eigenvector space. The optimum weight vector in the eigenvector space is shown to have the same performance as in the standard coordinate system, except that the input signal correlation matrix and look direction steering vector are replaced with the eigenvalue matrix and transformed steering vector. It is observed that the variation in gain factor results in the variation in the distance between the constraint plane and the origin in the translated weight vector space such that the increase in gain factor decreased the distance from the constraint plane to the origin, thus affecting the nulling performance. Simulation results showed that the general linearly constrained adaptive array performed better at an optimal gain factor compared with the conventional linearly constrained adaptive array in a coherent signal environment and the former showed similar performance as the latter in a noncoherent signal environment.

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

• Journal of information and communication convergence engineering
• /
• 제12권3호
• /
• pp.140-144
• /
• 2014

A general linearly constrained adaptive array is examined in the weight vector space to illustrate the array performance with respect to the gain factor. A narrowband linear adaptive array is implemented in a coherent signal environment. It is shown that the gain factor in the general linearly constrained adaptive array has an effect on the linear constraint gain of the conventional linearly constrained adaptive array. It is observed that a variation of the gain factor of the general linearly constrained adaptive array results in a variation of the distance between the constraint plane and the origin in the translated weight vector space. Simulation results are shown to demonstrate the effect of the gain factor on the nulling performance.

• 한국항공우주학회지
• /
• 제40권2호
• /
• pp.101-107
• /
• 2012

본 연구에서는 CFEM을 이용하여 구속조건이 있는 다물체의 운동방정식해석 프로그램을 개발하였다. 다양한 구속조건을 다루기 위하여 7개의 구속모델이 적용되었다. 구속조건으로 보안된 운동방정식은 높은 정확도를 위해 4차의 Runge-Kutta 방법을 사용하여 해석하였다. 다양한 구속조건이 있는 문제에 대하여 개발된 프로그램을 적용하고, 발표된 결과와 비교함으로써 개발 프로그램을 검증하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.61.1-61
• /
• 2001

This paper describes an efficient ambiguity searching method using additional constraints in 3-dimentional attitude finding GPS receiver design. For determining the integer ambiguity, the baseline length constraint, the angle constraint, the velocity constraint and the attitude constraint can be used for reducing the searching space. This paper describes the searching space algebraically and graphically. It is confirmed that the described restrictions are reasonable and the speed and the probability of ambiguity fixing are improved when the restricted searching spaces are applied Moreover, it is possible to design receivers of better quality by applying the method proposed in this paper.