• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.5
• /
• pp.526-532
• /
• 2014

In this paper, we present and analyze a LQ (Linear Quadratic) inverse optimal state-consensus protocol for continuous-time multi-agent systems with undirected graph topology. By Lyapunov analysis of the state-consensus error dynamics, we show the sufficient conditions on the algebraic connectivity of the graph to guarantee LQ inverse optimality and closed-loop stability. A more relaxed stability condition is also provided in terms of the algebraic connectivity. Finally, a formation control protocol for multiple mobile robots is proposed based on the target LQ inverse optimal consensus protocol, and the simulation results are provided to verify the performance of the proposed LQ inverse formation control method.

• 전기의세계
• /
• v.21 no.3
• /
• pp.31-40
• /
• 1972

This study intends to investigate the optimal switching modes of a double-capacitive thermal system under different constraints on the state and the control variable, by the application of the Pontryagin's Minimum Principle. Throughout the development, the control effort is assumed to have two modes of state: M or zero and the terminal times being fixed. In the first part of this study, the Principle is discussed under various conditions for this particular problem, with different criterion functions and in the same time imposing a certain constraints; i) on the terminal states, ii) on functions of the terminal states. Depending upon the upper bound value of the control vector, possible driving modes of the states are studied from which particular optimal driving modes are extracted so as to meet the specified constraints and boundary conditions imposed in the problem. Numerical solutions are evaluated for an over0damped, double-capacitive thermal plant and the optimal solutions: the switching mode, the optimal switching time, and the control effort are compared with the analytical results, in the second part of this work, to confirm the development.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.2
• /
• pp.176-184
• /
• 2000

Possible representation methods for the product structure have been compared and analyzed to determine optimal disassembly path of a product. Petri net is selected as the most optimal method to represent disassembly path of the product. In this method, a reachability tree for the product is generated and disassembly time for each path is calculated. A path with the smallest disassembly time is selected as the optimal path. A software far DPN(Disassembly Petri Net) has been developed and applied to search the optimal disassembly path for a ballpoint pen disassembly process as an example.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.3
• /
• pp.545-557
• /
• 1997

This paper deals with dynamic optimal pricing for new products by a firm which maximizes the discounted profit stream of it's own in a duopoly. The problem is constructed as differential games and dynamic optimization theory. Cost is assumed to decline as time goes on. A modified customer's choice model is formulated as a diffusion model and we solve a dynamic optimization problem by adopting the diffusion model. Since this paper focus on deriving real prices not showing a time trend, we formulate recursive form equations of costate variables(shadow price) and a simultaneous equation of price. Hence we derive a dynamic optimal pricing model for using in real market. In particular, we construct a dynamic optimal pricing model in the case that there are benefits from not only new subscribers but also previous subscribers. We analyze instant camera market in U.S.A(1976-1985) by utilizing the above model.

• IE interfaces
• /
• v.24 no.4
• /
• pp.295-303
• /
• 2011

This paper presents a discrete time optimal asset buying problem with a predetermined final deadline where an available budget is limited. A cost is paid to search for assets called the search cost. A seller who shows up offers a price for the asset and then the buyer decides whether or not to buy the asset by comparing the offered price to his optimal selection threshold. When the budget becomes less than the search cost or the price of the asset the buyer can get a necessary loan with some interests. We clarify the properties of the buyer's optimal selection threshold in order to maximize the expected value of budget which is left after paying all the search costs and the price of the asset at that point in time.

• Journal of Korean Society for Quality Management
• /
• v.31 no.3
• /
• pp.185-192
• /
• 2003

In this paper, the properties on the optimal replacement policies for the general failure model are developed. In the general failure model, two types of system failures may occur : one is Type I failure (minor failure) which can be removed by a minimal repair and the other, Type II failure (catastrophic failure) which can be removed only by complete repair. It is assumed that, when the unit fails, Type I failure occurs with probability 1-p and Type II failure occurs with probability p, $0\leqp\leq1$. Under the model, the system is minimally repaired for each Type I failure, and it is repaired completely at the time of the Type II failure or at its age T, whichever occurs first. We further assume that the repair times are non-negligible. It is assumed that the minimal repair times in a renewal cycle consist of a strictly increasing geometric process. Under this model, we study the properties on the optimal replacement policy minimizing the long-run average cost per unit time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.147-161
• /
• 1996

Generally the Multiprocessor Scheduling (MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm (GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and GP/MISF (Critical Path/Most Immediate Successors First). An efficient genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with GA to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• Journal of Distribution Science
• /
• v.15 no.2
• /
• pp.15-20
• /
• 2017

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

• Journal of Astronomy and Space Sciences
• /
• v.16 no.2
• /
• pp.167-176
• /
• 1999

The optimal initial inclination for minimizing the variation of the Local Time of Ascending Node(LTAN) during the three year mission of the KOMPSAT is investigated. At first, the analytical equation for the inclination change by the Sun is derived and the optimal initial inclination by analytical method is derived. Then the analytically derived optimal inclination is checked by the numerical orbit propagation with including all major perturbations. Four different cases of the initial orbital elements are used for monitoring the LTAN variation of the LTAN. Therefore, a new optimal initial inclination by numerical orbit propagation for the KOMPSAT is found. In addition, the variations of the mean and osculating semi-major axis are investigated with the different atmospheric density values. The mean eccentricity vs. argument of perigee diagram for the frozen orbit is obtained.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.220-229
• /
• 1995

Generally the Multiprocessor Scheduling(MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm(GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and CP/MISF(Critical Path/Most Immediate Successors First). A new genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with Ga to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.