• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.178-187
• /
• 2009

Six Sigma emphasizes KPI and establishes the present level as well as the goal level through statistical calculation and tries to achieve management innovation through process improvement. But in the area of new product development or service, sufficient data for statistical measurement may not be secured. On the other side, looking for contradictions through problem analysis, TRIZ is a methodology that stresses the process of solving these problems. TRIZ also has its own problems: it is hard to define its initial task, to objectify the measurement of effect, and to optimize the drawn out idea. The purpose of this report is to give a comprehensive understanding about each methodology (Sigma Six and TRIZ) through its analysis, to confirm the need of linking both methodologies, and to suggest a model for this linking process. Also, they will be verified through examples, and the synergy effect will be discussed.

• Transactions on Control, Automation and Systems Engineering
• /
• 제1권2호
• /
• pp.147-152
• /
• 1999

It is an interesting area in the field of artifical intelligence to find an analytic model of cooperative structure for multiagent system accomplishing a given task. Usually it is difficult to design controllers for multi-agent systems without a comprehensive knowledge about the system. One of the way to overcome this limitation is to implement an evolutionary approach to design the controllers. This paper introduces the use of a genetic algorithm to discover a fuzzy logic controller with rules that govern emergent agents solving a pursuit problem in a continuous world. Simulation results indicate that, given the complexity of the problem, an evolutionary approach to find the fuzzy logic controller seems to be promising.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권6호
• /
• pp.347-353
• /
• 2003

In models of imperfect competition of deregulated electricity markets, the key task is to find the Nash equilibrium(NE). The approaches for finding the NE have had two major bottlenecks: computation of mixed strategy equilibrium and treatment of multi-player games. This paper proposes a payoff matrix approach that resolves these bottlenecks. The proposed method can efficiently find a mixed strategy equilibrium in a multi-player game. The formulation of the m condition for a three-player game is introduced and a basic computation scheme of solving nonlinear equalities and checking inequalities is proposed. In order to relieve the inevitable burden of searching the subspace of payoffs, several techniques are adopted in this paper. Two example application problems arising from electricity markets and involving a Cournot and a Bertrand model, respectively, are investigated for verifying the proposed method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.307-309
• /
• 2002

This paper proposes an expert system, which is able to determine the problem-solving strategy for diversity events occurred on the distribution system. The events include events related to the fault, scheduled outage and optimal operating task such as feeder line fault, line scheduled outage, line overload, system load balancing, system loss minimization, main transformer fault, main transformer scheduled outage, main transformer overload, main transformer protection control. The expert system enhances the reliability of software designed by the integrated concept for the diversity events.

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

The new approach of homogeneous robust control systems synthesis, both linear, and nonlinear and non-stationary is offered. The control is carried out, providing the given phase constrains varied in acceptable limits, in view of constrains on its value and incompleteness of the information about functioning disturbances. The approach is based on introduction of auxiliary integral surfaces, on which the initial moving is projected. As a result the reduced equivalent moving is forming, described by the scalar equation which in many important cases can be integrated directly. On the basis of the obtained equation solving of a synthesis task is carried out and can be reduced to algebraic or integral inequalities. The final relations defined for linear equivalent moving are presented.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 1995년도 추계 학술대회논문집
• /
• pp.90-103
• /
• 1995

최근 전산 유체 역학은 Navier-Stokes 방정식을 보다 복잡한 유동장 형상에 대해 풀 수 있을 만큼 발달해 왔으나 아직도 유동장 형상이 복잡할 때는 많은 애로를 느끼고 있다. 특히 격자 구성 문제에 있어서 많은 시간과 노력을 기울이고 있으며 심지어 격자 구성 문제를 해결하지 못해 유동해석을 하지 못하는 경우가 많은 실정이다. 따라서 본 연구에서는 주로 내부 유동인 변형 도관를 예로 유동장 형상에 따라 격자구성이 어떻게 달라지는가를 살펴 보았다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.683-686
• /
• 2000

A new approach to the task of aligning a robot using camera is presented in this paper. We apply an elitist GA to find the joints angles of manipulator to reach target position instead of using nonlinear least error method. Since it employs parallel search and have good performance in solving optimization problems. In order to improve convergence speed, the floating coding method and geometry constraint conditions are used. Experiments are carried out to exhibit the effectiveness of vision-based control using elitist genetic algorithm.

• 한국정밀공학회지
• /
• 제15권4호
• /
• pp.111-117
• /
• 1998

In order to increase productivity of an assembly system composed of multiple robots along a conveyer line, an efficient sequence planning is necessary because the assembly time is dependent upon the assembly sequence. In this paper, a two-robot assembly system is considered in which two robots operate simultaneously and transfer parts from the part feeders to the workpiece on the conveyer one by one. In this case, the distance from the feeder to the workpiece varies with time because the workpiece moves at a constant speed on the conveyer. Hence, the sequence programming is not a trivial problem. Also, the two robots may interfere with each other kinematically and dynamically due to the simultaneous operation, so the sequence should be programmed to avoid the interferences. In this paper, the task sequence optimization problem is formulated and is solved by employing the simulated annealing which has been shown to be effective for solving large combinatorial optimizations.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.40-47
• /
• 1994

In this paper, Micro-Genetic algorithms($\mu$-GAs) is proposed on a minimum-time path planning for robot manipulator. which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can`t often find the optimaul values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimul values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권3호
• /
• pp.1287-1300
• /
• 2018

Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.