• 한국경영과학회지
• /
• 제37권4호
• /
• pp.67-72
• /
• 2012

In this paper a new method of handling linear constraints for the genetic algorithm is suggested. The method is designed to maintain the feasibility of offsprings during the evolution process of the genetic algorithm. In the genetic algorithm, the chromosomes are coded as the vectors in the real vector space constrained by the linear constraints. A method of handling the linear constraints already exists in which all the constraints of equalities are eliminated so that only the constraints of inequalities are considered in the process of the genetic algorithm. In this paper a new method is presented in which all the constraints of inequalities are eliminated so that only the constraints of equalities are considered. Several genetic operators such as arithmetic crossover, simplex crossover, simple crossover and random vector mutation are designed so that the resulting offspring vectors maintain the feasibility subject to the linear constraints in the framework of the new handling method.

• Journal of Information Processing Systems
• /
• 제19권5호
• /
• pp.563-575
• /
• 2023

Trajectory planning is a key technology for unmanned aerial vehicles (UAVs) to achieve complex flight missions. In this paper, a terminal constraints conversion-based Gauss pseudospectral trajectory planning optimization method is proposed. Firstly, the UAV trajectory planning mathematical model is established with considering the boundary conditions and dynamic constraints of UAV. Then, a terminal constraint handling strategy is presented to tackle terminal constraints by introducing new penalty parameters so as to improve the performance index. Combined with Gauss-Legendre collocation discretization, the improved Gauss pseudospectral method is given in detail. Finally, simulation tests are carried out on a four-quadrotor UAV model with different terminal constraints to verify the performance of the proposed method. Test studies indicate that the proposed method performances well in handling complex terminal constraints and the improvements are efficient to obtain better performance indexes when compared with the traditional Gauss pseudospectral method.

• Journal of Electrical Engineering and Technology
• /
• 제13권3호
• /
• pp.1099-1109
• /
• 2018

For practical consideration, economic dispatch (ED) problems in power system have non-smooth cost functions with equality and inequality constraints that makes the problems complex constrained nonlinear optimization problems. This paper proposes a new constraint handling method for equality and inequality constraints which is employed to solve ED problems, where the incremental rate is employed to enhance the modification process. In order to prove the applicability of the proposed method, the study cases are tested based on the classical particle swarm optimization (PSO) and differential evolution (DE) algorithm. The proposed method is evaluated for ED problems using six different test systems: 6-, 15-, 20-, 38-, 110- and 140-generators system. Simulation results show that it can always find the satisfactory solutions while satisfying the constraints.

• Korean Journal of Chemical Engineering
• /
• 제36권3호
• /
• pp.356-367
• /
• 2019

This work presents an advanced and systematic approach to analytically design the optimal parameters of a two parameter second-order internal model control (IMC) filter that satisfies operational constraints on the output process, the manipulated variable as well as rate of change of the manipulated variable, for a first-order plus dead time (FOPDT) process. The IMC parameters are designed to minimize a control objective function composed of the weighted sum of the error between the process variable and the set point, and the rate of change of the manipulated variable, and to satisfy the desired constraints. The feasible region of the constrained IMC control parameters was graphically analyzed, as the process parameters and the constraints varied. The resulting constrained IMC control parameters were also used to find the corresponding industrial proportional-integral controller parameters of a Smith predictor structure.

• Journal of Electrical Engineering and information Science
• /
• 제1권2호
• /
• pp.39-44
• /
• 1996

An efficient interacting multiple mode(IMM) approach for tracking a maneuvering target with kinematic constraints is described based on the square root information filter(SRIF). The SRIF is employed instead of the conventional Kalman filter since it exhibits more efficient features in handling the kinematic constraints and improved numerical characteristics. The kinematic constraints are considered in the filtering process as pseudomeasurements where the degree of uncertainty is represented by the magnitude of the pseudomeasurement noise variance. The Monte Carlo simulations for the constant speed, maneuvering target are provided to demonstrate the improved tracking performance of the proposed algorithm.

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

This paper aims to derive a mathematical model of the dynamics of handling tasks in field robot which stable grasping and manipulates a rigid object with some dexterity. Firstly, a set of differential equation describing dynamics of the manipulators and object together with geometric constraint of tight area-contacts is formulated by Lagrange equation. Secondly, problems of controlling both the internal force and the rotation angle of the grasped object under the constraints of area-contacts of tight area-contacts are discussed. The effect of geometric constraints of area-contacts on motion of the overall system is analyzed and a method of computer simulation for overall system of differential-algebraic equations is presented. Thirdly, simulation results are shown and the effects of geometric constraints of area-contact is discussed.

• Journal of applied mathematics & informatics
• /
• 제3권2호
• /
• pp.129-148
• /
• 1996

This paper propose the inference mechanism for handling linear polynomial constraints called consistency checking algorithm based on the feasibility checking algorithm borrowed from linear pro-gramming. in contrast with other approaches proposed algorithm can efficiently and coherented by linear polynomial forms. The developed algorithm is successfully applied to the symbolic simulation that offers a convenient means to conduct multiple simultaneous exploration of model behaviors.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• pp.870-875
• /
• 2004

Beam stiffeners have frequently been used for raising natural frequencies of base structures. In stiffener layout optimization problems, most of the previous researches considering the position and/or the length of the stiffener as design variables dealt with structures having just simple convex shapes such as a square or rectangle. The reason is concave shape structures have difficulties ill formulating geometry constraints. In this paper, a new geometry constraint handling technique, which can define both convex and concave feasible lesions and measure a degree of geometry constraint violation, is proposed. Evolution strategies (ESs) is utilized as an optimization tool. In addition, the constraint-handling technique of EVOSLINOC (EVOlution Strategy for scalar optimization with Lineal and Nonlinear Constraints) is utilized to solve constrained optimization problems. From a numerical example, the proposed geometry constraint handling technique is verified and proves that the technique can easily be applied to structures in net only convex but also concave shapes, even with a protrusion or interior holes.

• 한국시뮬레이션학회논문지
• /
• 제9권4호
• /
• pp.41-50
• /
• 2000

We have many simulation constraints to meet as a modeled system becomes large and complex. Real-time simulations are the examples in that they are constrained by certain non-function constraints (e.g., timing constraints). In this paper, an enhanced hierarchical modeling methodology is proposed to efficiently deal with constraint-simulations. The proposed modeling method enhances hierarchical modeling methods to provide multi-resolution model. A simulation model is composed by determining the optimal level of abstraction that is guaranteed to meet the given simulation constraints. Four modeling activities are defined in the proposed method: 1) Perform the logical architectural design activity to produce a multi-resolution model, 2) Organize abstraction information of the multi-resolution model with AT (Abstraction Tree) structure, 3) Formulate the given constraints based on U (Integer Programming) approach and embrace the constraints to AT, and 4) Compose a model based on the determined level of abstraction with which the multi-resolution model can satisfy all given simulation constraints. By systematically handling simulation constraints while minimizing the modeler's interventions, we provide an efficient modeling environment for constraint-simulations.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집A
• /
• pp.725-730
• /
• 2000

Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.