• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.32 no.4
• /
• pp.121-127
• /
• 1983

In this paper an efficient algorithm for Pontriagin's maximum principle is developed. Fletcher-Powell method is adopted as optimization technique which shows fast and stable convergence characteristics. Terminal constraints are alse considered by using Hestens' algorithm and penalty function method together. Control variable inequality constraints are also considered by using Gradient Projection technique combined with Flectcher-Powell method. Test experiment shows good and reliable results.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.2 s.233
• /
• pp.262-269
• /
• 2005

Optimization of a satellite structure under severe space launching environments is performed considering various design constraints. Simulate annealing, one of combinatorial optimization techniques, is used to optimize the satellite. The optimization results by the simulated annealing are compared to those by the method of modified feasible direction and genetic algorithm. Ten bar truss structure is optimized for feasibility study of the simulated annealing. Finally, the satellite structure is optimized by the simulated annealing algorithm under space environment. Weights of the satellite upper platform and propulsion module are minimized with consideration of several static and dynamic constraints. MSC/NASTRAN is used to find the static and dynamic responses. Simulated annealing has been programmed and integrated with the finite element analysis program for optimization. It is shown that the simulated annealing algorithm can be extended to the optimization of space structures.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.5
• /
• pp.73-85
• /
• 1997

An automatic transmission is an important element of automotive power systems that allows a driving convenience. Compared to a manual transmission, however, it has a few problems in efficiency, shift feel, and maintenance. To improve these, it is imperative to understand the dynamics of automatic transmissions. This paper develops a dynamically-correct model of an automatic transmission, using the bond graph method. The bond graph method is ideally suited for modeling power systems, because the method is based on generalized power variables. The bond graph method is capable of providing correct dynamic constraints and kinematic constraints, as well as the governing differential equations of motion. The bond graph method is applied to 1-4 in-gear ranges, as well as various upshifts and downshifts of an automatic transmission, which allows an accurate simulation of an automatic transmission. Conventional automatic transmission models have no dynamic constraint, which do not allow correct simulation studies.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.3
• /
• pp.485-491
• /
• 2010

Total Transfer Capability (TTC) should be pre-determined in order to estimate Available Transfer Capability (ATC). Typically, TTC is determined by considering three categories; voltage, stability and thermal limits. Among these, thermal limits are treated mainly in this paper on the evaluation of TTC due to the relatively short transmission line length of Korea Electric Power Corporation (KEPCO) system. This paper presents a new approach to evaluate the TTC using the Dynamic Line Rating (DLR) for the thermal limit. Since the approach includes not only traditional electrical constraints but also real-time environmental constraints, this paper obtains more cost-effective and exact results. A case study using KEPCO system confirms that the proposed method is useful for real-time operation and the planning of the electricity market.

• Journal of Power Electronics
• /
• v.9 no.6
• /
• pp.919-928
• /
• 2009

Microgrids (MGs) are typically comprised of distributed generators (DGs) including renewable energy sources (RESs), storage devices and controllable loads, which can operate in either interconnected or isolated mode from the main distribution grid. This paper introduces a novel dynamic programming (DP) approach to MG optimization which takes into consideration the coordination of energy supply in terms of heat and electricity. The DP method has been applied successfully to several cases in power system operations. In this paper, a special emphasis is placed on the uncontrollability of RESs, the constraints of DGs, and the application of demand response (DR) programs such as directed load control (DLC), interruptible/curtaillable (I/C) service, and/or demand-side bidding (DSB) in the deregulated market. Finally, in order to illustrate the optimization results, this approach is applied to a couple of examples of MGs in a certain configuration. The results also show the maximum profit that can be achieved.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.45-48
• /
• 1988

This paper reveals the relation hereon the robot system dynamic constraints and the VSC parameters, and analyzes the effect on the trajectory of the joint angle and the hand when the result of the relation analysis is applied to the robot system control. The result of the analysis in this paper is applied effectively to the path tracking control and the trajectory planning using the VSC method.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.185-194
• /
• 2008

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop an ant algorithm based on routing mechanism for finding the multiple shortest paths within limited time in real traffic network. The proposed ant algorithm finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn until an acceptable solution is reached. This method can consider traffic constraints easily comparing to the conventional shortest paths algorithms.

• Structural Engineering and Mechanics
• /
• v.4 no.3
• /
• pp.303-312
• /
• 1996

The dynamic behavior of an Euler beam with multiple point constraints traversed by a moving concentrated mass, a "moving-force moving-mass" problem, is analyzed and compared with the corresponding simplified "moving-force" problem. The equation of motion in matrix form is formulated using Lagrangian approach and the assumed mode method. The effects of the presence of intermediate point constraints in reducing the fluctuation of the contact force between the mass and the beam and the possible separation of the mass from the beam are investigated. The equation of motion and the numerical results are expressed in dimensionless form. The numerical results presented are therefore applicable for a large combination of system parameters.

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

In this paper, a method of generating trajectories in real time for a mobile robot in a dynamic environment is proposed. Specifically, this method is focused on soccer-playing robots that need to calculate trajectories in real time, which are constantly subject to rapidly change as targets and obstacles move. The robots also should move at the fastest available speed, while tracking the generated trajectories. The method proposed in this paper solves the geometric problem of finding a smooth curve that joins two endpoints. To have this solved, we assign five constraints to each endpoint, which are the usual x, y, theta, and curvature as well as the influence of the initial robot velocity on the path. With these five constraints, the path generated can always be physically followed by robot. Through this method, the travel time of the robot over the entire path can b optimized. Therefore it can ...

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• 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.