• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1911-1916
• /
• 2003

Parameter set of an LPV system is divided into a number of subsets so that robust feedback gains may be designed for each subset of parameters. A concept of quasi-invariant set is introduced, which allows finite steps of delay in reentrance to the set. A feasible and positively invariant set with respect to a gain-scheduled state feedback control can be easily obtained from the quasi-invariant set. A receding horizon control strategy can be derived based on this feasible and invariant set.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.12
• /
• pp.991-997
• /
• 2002

The concept of feasible & invariant region plays an important role to derive closed loop stability and achie adequate performance of constrained receding horizon predictive control. In this paper, we define a complex polyhedral feasible & invariant set for all stabilizable input-constrained linear systems by using a complex transform and propose a one-norm based receding horizon control scheme using these invariant sets. In order to get a larger stabilizable set, a convex hull of invariant sets which are defined for different state feedback gains is used as a target invariant set of the constrained receding horizon control. The proposed constrained receding horizon control scheme is formulated so that it can be solved via linear programming.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.3
• /
• pp.177-182
• /
• 2013

This paper proposes an input-constrained reference tracking control of a converter model. To this end, first it is shown that the bilinear converter model can be equivalently represented by a linear uncertain model belonging to a polytopic set. Then, an input-constrained tracking control scheme for the linear uncertain model is designed based on recently proposed tracking control scheme. The control scheme yields not only a stabilizing control gain but also a feasible and invariant set for the converter model. Finally, simulation results show that the state trajectory always stays in the feasible and invariant set and that the output tracks the given reference while satisfying the input constraint.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.12 no.2
• /
• pp.7-14
• /
• 2016

In this paper presents a low power algorithm using a feasible cluster generation method considered glitch. The proposed algorithm is a method for reducing power consumption of a given circuit. The algorithm consists of a feasible cluster generation process and glitches removal process. So that glitches are not generated for the node to which the switching operation occurs most frequently in order to reduce the power consumption is a method for generating a feasible cluster. A feasible cluster generation process consisted of a node value set, dividing the node, the node aligned with the feasible cluster generation. A feasible cluster generation procedure is produced from the highest number of nodes in the output. When exceeding the number of OR-terms of the inputs of the selected node CLB prevents the signal path is varied by the evenly divided. If there are nodes with the same number of outputs selected by the first highest number of nodes in the input produces a feasible cluster. Glitch removal process removes glitches through the path balancing in the same manner as [5]. Experimental results were compared with the proposed algorithm [5]. Number of blocks has been increased by 5%, the power consumption was reduced by 3%.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.27.4-27
• /
• 2001

A stabilizing control method for linear systems with model uncertainties and hard input constraints is developed, which does not require on-line optimizations. This work is motivated by the constrained robust MPC(CRMPC) approach [3] which adopts the dual mode prediction strategy (i.e. free control moves and invariant set) and minimizes a worst case performance criterion. Based on the observation that, a feasible control sequence for a particular state can be found as a linear combination of feasible sequences for other states, we suggest a stabilizing control algorithm providing sub-optimal and feasible control sequences using pre-computed optimal sequences for some canonical states. The on-line computation of the proposed method reduces to simple matrix multiplication.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2188-2195
• /
• 2000

This paper deals with the problem of determining small-bands enclosing a given set of points on the sphere. The small-band is a spherical region, whose boundary is composed of two circles, and which does not contain any great circle. It is a kind of domains that is derived from formalizing the local accessibility problems for 3-axis NC machining into sperical containment problems so as to avoid the grouping. It also can be generated in 4- and 5-axis machine. When a set of points U and the size of a great-band are given, the methods for computing a feasible band and all feasible bands enclosing U in O(n) and O(n log n) time have been suggested, respectively. The methods can be applied into the cases of small bands since the solution region may contain holes. In this paper, we concentrate on the method for determining the smallest small-band enclosing U and suggest an O(n long n) time algorithm, where n is the number of points on the sphere.

• Korean Management Science Review
• /
• v.10 no.2
• /
• pp.11-26
• /
• 1993

This paper presents a new interactive procedure for multiple objective linear programming problem (MOLP). In practical multiple objective linear programming applications, there is usually no need for the decision maker to consider solutions which are not efficient. Therefore, the interactive procedure presented here searches only among efficient solutions and terminates with a solution that is guaranteed to be efficient. It also can converge to nonextreme efficient final solutions rather than being restricted to only extreme efficient points of the feasible set. The procedure does not require sophisticated judgements or inputs from the decision maker. One of the most attractive features of the procedure however, is that the method allows the DM to examine the efficient faces it finds. As iteration goes, the DM can explore a wide variety of efficient faces rather than efficient faces confined to only certain subregion of the feasible set of problem MOLP since the efficient faces that the procedure finds need not be adjacent. This helps the DM explore the nature of the efficient set of problem MOLP and also helps the DM have confidence with a final solution. For these reasons, I feel that the procedure offer significant promise in solving multiple objective linear programs rapidly and in a satisfying manner to the DM.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.3
• /
• pp.88-98
• /
• 1998

In many automatization applications, a rigid body is required to go forward and backward repeatedly through a set of given position/orientations precisely while a crank is rotated. Such a motion can be generated by 6 bar mechanism adding a dyad to a 4 bar mechanism. If this is the case for 3 position synthesis of the 4 bar mechanism, the feasible solution area for designing the 4 bar mechanism will be limited over the general solution area. This paper proposes a procedure to synthesize 4 bar mechanism to be used to generate the required motion. It is found that the only input crank of the 4 bar mechanism should be limited to satisfy the condition. And the feasible design area for the circle point/ center point of the input crank is identified so that design of the undesired mechanism could be avoided. The method is tested and the results are shown.

• Structural Engineering and Mechanics
• /
• v.24 no.4
• /
• pp.479-491
• /
• 2006

This paper deals with optimal fibre orientations of symmetrically laminated fibre reinforced composite structures for maximising the fundamental frequency of small-amplitude. A set of fiber orientation angles in the layers are considered as design variable. The Modified Feasible Direction method is used in order to obtain the optimal designs. The effects of number of layers, boundary conditions, laminate thicknesses, aspect ratios and in-plane loads on the optimal designs are studied.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.530-533
• /
• 1996

This paper deals with finding an initial solution and modifying search direction by the centrering force in the predictor-corrector method which is a variant of the primal-dual barrier method. These methods were tested with NETLIB problems. Initial solutions which are located close to the center of the feasible set lower the number of iterations, as they enlarge the step length. Three heuristic methods to find such initial solution are suggested. The new methods reduce the average number of iterations by 52% to at most, compared with the old method assigning 1 to initial valurs. Solutions can move closer to the central path fast by enlarging the centering force in early steps. It enlarge the step length, so reduces the number of iterations. The more effective this method is the closer the initial solution is to the boundary of the feasible set.