• 대한전기학회논문지:전력기술부문A
• /
• 제49권7호
• /
• pp.339-344
• /
• 2000

This paper presents an improved optimal power flow algorithm, which solves an optimization problem with equality constraints with converted inequality constraints. The standard OPF and the penalty function method should do reconstructing active constraints among the inequality constraints so that the activation of the inequality constraints has been imposing an additional burden to solve OPF problem efficiently. However the proposed algorithm converts active inequality constraints into the equality constraints in order to preclude us from reconstructing the procedures. The effectiveness of the new OPF algorithm is validated by applying the IEEE 14 bus system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.486-490
• /
• 1993

In addtion to a basic motion task, redundant manipulators can achieve some additional tasks by optimizing proper performance criteria. Some of performance criteria can be transformed to inequality constraints. So the redundancy resolving problem can be reformulated as a local optimization problem with equality constraints for the end effector and inequality constraints for some performance criteria. In this article, we propose a method for solving the inverse kinematics of a manipulator with redundancy using the Kuhn-Tucker theorem to incorporate inequality constraints. With proper choice of inequality constraints, the proposed method gives a way of optimizing multiple criteria in redundant manipulators.

• Journal of Mechanical Science and Technology
• /
• 제14권6호
• /
• pp.655-665
• /
• 2000

We propose an efficient algorithm for the purpose of satisfying a wide range of design constraints represented with equality and inequality equations as well as production rules. The algorithm employs simulated-annealing and a production rule inference engine and works on design constraints represented with networks. The algorithm fulfills equality constraints through constraint satisfaction processes like variable elimination while taking into account inequality constraints and inferring production rules. It can also reduce the load of the optimization procedure if necessary. We demonstrate the implementation of the algorithm with the result on machine tool design.

• 응용통계연구
• /
• 제27권6호
• /
• pp.909-922
• /
• 2014

부등제한 조건 (>,<,=)과 관련된 베이지안 추론에서 다음의 세 가지 주제에 대하여 기존의 연구와 최근의 연구동향 그리고 추후 연구주제에 대하여 살펴보았다 : ⅰ) 모수에 대한 여러 부등제한 조건들의 비교, ⅱ) 모수에 부등제한 조건을 부여하는 것이 타당하다고 할 때 모수의 동등성에 관한 동시 다중 검정, ⅲ) 순서적 범주형 변수에 대한 분할표에서 스코어 모수에 순서적 부등제한 조건을 가정 할 때 스코어 모수의 동등성에 대한 다중 검정.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.7-9
• /
• 2000

This paper deals with optimal power flow, which is optimal problem with equality constraints and inequality constraints. An a1gorithm of changing inequality constraints problem to equality constraints problem is applied to real systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.69-72
• /
• 1996

This paper considers a global resolution of kinematic redundancy under inequality constraints as a constrained optimal control. In this formulation, joint limits and obstacles are regarded as state variable inequality constraints, and joint velocity limits as control variable inequality constraints. Necessary and sufficient conditions are derived by using Pontryagin's minimum principle and penalty function method. These conditions leads to a two-point boundary-value problem (TPBVP) with natural, periodic and inequality boundary conditions. In order to solve the TPBVP and to find a global minimum, a numerical algorithm, named two-stage algorithm, is presented. Given initial joint pose, the first stage finds the optimal joint trajectory and its corresponding minimum performance cost. The second stage searches for the optimal initial joint pose with globally minimum cost in the self-motion manifold. The effectiveness of the proposed algorithm is demonstrated through a simulation with a 3-dof planar redundant manipulator.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.777-780
• /
• 1995

Accounting for actuator nonlinearities in control loops has often been perceived as an implementation issue and usually excluded in the design of controllers. Nonlinearities treated in this paper are saturation, and they are modelled as an inequality constraint. The CRHPC(Constrained Receding Horizon Predictive Control) with inequality constraints algorithm is used to handle actuator rate and amplitude limits simultaneously or respectively. Optimum values of future control signals are obtained by quadratic programming. Simulated examples show that predictive control law with inequality constraints offers good performance as compared with input clipping.

• 한국소음진동공학회논문집
• /
• 제15권11호
• /
• pp.1255-1261
• /
• 2005

The dynamic contact model of a beam that contacts to a rigid wall in a reactor core was studied. The gap between the beam and contact wall results in dynamic contact accompanying inequality constraints. The inequality constraints can be relieved to an equality constraint problem by introducing a convex Penalty function. In this work, a beam with contact condition is formulated using quasi-convex penalty function and numerically solved. General coordinate solution is adopted to raise computational efficiency. Also nonlinearity is examined In the beam contacting to a rigid wall.

• Journal of Astronomy and Space Sciences
• /
• 제25권4호
• /
• pp.361-374
• /
• 2008

Recently, satellite formation flying has been a topic of significant research interest in aerospace society because it provides potential benefits compared to a large spacecraft. Some techniques have been proposed to design optimal formation trajectories minimizing fuel consumption in the process of formation configuration or reconfiguration. In this study, a method is introduced to build fuel-optimal trajectories minimizing a cost function that combines the total fuel consumption of all satellites and assignment of fuel consumption rate for each satellite. This approach is based on collocation and nonlinear programming to solve constraints for collision avoidance and the final configuration. New constraints of nonlinear equality or inequality are derived for final configuration, and nonlinear inequality constraints are established for collision avoidance. The final configuration constraints are that three or more satellites should form a projected circular orbit and make an equilateral polygon in the horizontal plane. Example scenarios, including these constraints and the cost function, are simulated by the method to generate optimal trajectories for the formation configuration and reconfiguration of multiple satellites.

• 한국경영과학회지
• /
• 제15권1호
• /
• pp.73-82
• /
• 1990

This paper describes two algorithms to Nonlinear programming problems with equality constraints and with equality and inequality constraints. The first method treats nonlinear programming problems with equality constraints. Utilizing the nonlinear programming problems with equality constraints. Utilizing the nonlinear parametric programming technique, the method solves the problem by imbedding it into a suitable one-parameter family of problems. The second method is to solve a nonlinear programming problem with equality and inequality constraints, by minimizing a square sum of nonlinear functions which is derived from the Kuhn-Tucker condition.