• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.155-160
• /
• 2011

In distributed source localization where sensors transmit measurements to a fusion node, we address the sensor selection problem where the goal is to find the best set of sensors that maximizes localization accuracy when quantization of sensor measurements is taken into account. Since sensor selection depends heavily upon rate assigned to each sensor, joint optimization of rate allocation and sensor selection is required to achieve the best solution. We show that this task could be accomplished by solving the problem of allocating rates to each sensor so as to minimize the error in estimating the position of a source. Then we solve this rate allocation problem by using the generalized BFOS algorithm. Our experiments demonstrate that the best set of sensors obtained from the proposed sensor selection algorithm leads to significant improvements in localization performance with respect to the set of sensors determined from a sensor selection process based on unquantized measurements.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.4
• /
• pp.160-166
• /
• 2002

Since conventional mobile robot control with one module has limitation to solve complex problems, there have been a variety of works on combining multiple modules for solving them. Recently, many researchers attempt to develop mobile robot controllers using artificial life techniques. In this paper, we develop a mobile robot controller using cellular automata based neural networks, where complex tasks are divided to simple sub-tasks and optimal neural structure of each sub-task is explored by genetic algorithm. Neural network modules are combined dynamically using the action selection mechanism, where basic behavior modules compete each other by inhibition and cooperation. Khepera mobile robot simulator is used to verify the proposed model. Experimental results show that complex behaviors emerge from the combination of low-level behavior modules.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.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
• /
• v.1 no.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.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.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.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• 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.10a
• /
• 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.10a
• /
• pp.90-103
• /
• 1995

The field of computational fluid dynamics(CFD) is rapidly approaching the stage where viscous flows over complex configurations are solved. However, the situation is not as promising when one considers a more complete configuration. CFD is not a banana, but a onion. The difficulties arise mainly because the task of generating the grids for modeling such complex geometries is tedious. The primary interest of the author is in the area of grid generation, in particular, duct flow calculations typically encountered in the internal flow. Pertinent examples will be cited to demonstrate the feasibility of solving viscous flow over practical duct configurations of current interest on grid topologies.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.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.