• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.1-14
• /
• 2012

In this paper, the problem of determining the optimal car-deriving strategy has been examined. In order to find the optimal driving strategy, we have modified a method based on measure theory. Further, we demonstrate that the modified method is an efficient and practical algorithm for dealing with optimal control problems in a canonical formulation.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.291-301
• /
• 1999

We study an optimal control problem of the fluid flow governed by the navier-Stokes equations. The control problem is formulated with the flow in the driven cavity. Existence of an optimal solution and first-order optimality condition of the optimal control are derived. We report the numerical results for the finite eleme수 approximations of the optimal solutions.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.83-100
• /
• 2010

In this article, an optimal control problem associated with convection-diffusion equation is considered. Using Lagrange multiplier, the optimality system is obtained. The derived optimal system becomes coupled, non-symmetric partial differential equations. For discretizations and implementations, the finite element multigrid V-cycle is employed. The convergence analysis of finite element multigrid methods for the derived optimal system is shown. Some numerical simulations are performed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.3
• /
• pp.240-245
• /
• 2005

In this paper, planar waypoint guidance synthesis for UAVs using the LQ optimal impact-angle-control guidance law is proposed. We prove that the energy-optimal control problem with the constraint of passing through the waypoints is equivalent to the problem of finding the optimal pass angles on each waypoint of the optimal impact-angle-control law. The optimal pass angles can be obtained as a numerical solution of the simple pass angle optimization problem that requires neither input parameterization nor constraints. The trajectory obtained by applying the optimal impact-angle-control law with these optimal pass angles becomes energy optimal.

• Journal of the Korean Statistical Society
• /
• v.30 no.3
• /
• pp.367-385
• /
• 2001

In this paper, we characterize the smoothest density with prescribed moments. Hong and Kim(1995) proved the existence and uniqueness of such as density. we introduce the general optimal control problem and prove some theorems on the characterization of the minimizer using the optimal control problem techniques.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.234-239
• /
• 1993

Most of the control problem is for the redundant manipulators use the pseudo-inverse control, thit is, the redundancy is resolved by the pseudo-inverse of the Jacobian matrix and then the controller is designed based on this resolution. However, this pseudo-inverse control has some problems when the redundant robot repeats the cyclic tasks. This is because the pseudo-inverse resolution is a local solution that generates the different configurations of the robot arm for the same hand position. Therefore it is necessary to find the global solution that maintains the optimal configuration of the robot for the repetitive tasks. In this paper, we want to propose a redundancy resolution method by the optimal theory that uses the calculus of variation. The problem formulations are : first to convert the optimal resolution problem to an optimal control problem and then to resolve the redundancy using the necessary conditions of optimal control.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.315-328
• /
• 2005

In this paper we present a new method for designing a nozzle. In fact the problem is to find the optimal domain for the solution of a linear or nonlinear boundary value PDE, where the boundary condition is defined over an unspecified domain. By an embedding process, the problem is first transformed to a new shape-measure problem, and then this new problem is replaced by another in which we seek to minimize a linear form over a subset of linear equalities. This minimization is global, and the theory allows us to develop a computational method to find the solution by a finite-dimensional linear programming problem.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.149-159
• /
• 2009

In this paper, we introduce some approximate optimal solutions and an augmented Lagrangian function in nonlinear programming, establish dual function and dual problem based on the augmented Lagrangian function, discuss the relationship between the approximate optimal solutions of augmented Lagrangian problem and that of primal problem, obtain approximate KKT necessary optimality condition of the augmented Lagrangian problem, prove that the approximate stationary points of augmented Lagrangian problem converge to that of the original problem. Our results improve and generalize some known results.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.125-137
• /
• 1997

We are concerned with the packing policy determines the optimal packing of products with variable sizes to minimize the penalty costs for idle space and product spliting. Optimal packing problem is closely related to the optimal packet/record sizing problem in that randomly generated data stream with variable bytes are divided into a unit of packet/record for transmitting or storing. Assuming the product size and the production period are independently determined by renewal process, we can approximate the renewal process and formulate the optimization problem that minimize the expected packing cost for a production period. The problem is divided into two cases according to whether a product is allowed to split or not. Computational results for various distributions will be given to verify the approximation procedure and the resulting optimization problem.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.