• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.4
• /
• pp.61-70
• /
• 1996

This paper deals with consciousn~s structure by means of human subjective judgement. Fuzzy structural modeling which is a modeling method for consciousness structure have the large number of pairwise comparigon by human subjective judgement, is difficplt to check the consistency index which denotes the precision for human judgement. To improve these points, we set the structure of consciousness by fuzzy structural modeling method using the concept of pairwise compariqon matrix in AHP. The efficiency of this method is showed by means of the consciousness structure graph to the qyality system construction.

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.256-265
• /
• 2013

A local map-based exploration algorithm for mobile robots is presented. Segmented frontiers and their relative transformations constitute a tree structure. By the proposed efficient frontier segmentation and a local map management method, a robot can reduce the unknown area and update the local grid map which is assigned to each frontier node. Although this local map-based exploration method uses only local maps and their adjacent node information, mapping completion and efficiency can be greatly improved by merging and updating the frontier nodes. Also, we suggest appropriate graph search exploration methods for corridor and hall environments. The simulation demonstrates that the entire environment can be represented by well-distributed frontier nodes.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.801-809
• /
• 2013

In this paper, we construct nilpotent semigroups S such that $S^n=\{0\}$, $S^{n-1}{\neq}\{0\}$ and ${\Gamma}(S)$ is a refinement of the star graph $K_{1,n-3}$ with center $c$ together with finitely many or infinitely many end vertices adjacent to $c$, for each finite positive integer $n{\geq}5$. We also give counting formulae to calculate the number of the mutually non-isomorphic nilpotent semigroups when $n=5$, 6 and in finite cases.

• Proceedings of the KIEE Conference
• /
• 2001.07b
• /
• pp.868-870
• /
• 2001

Salient pole rotor type single phase SRM(switched reluctance motor) can be use axial direction magnetic flux and radial direction magnetic flux at the same time. Then, it has higher energy density per unit volume and can be lessened the shaft length of motor or exciting magnetic force. Additionally, it's durability is good because it is simple structure and driving device. Prototype of Salient pole rotor type single phase SRM was fabricated by using parameters of three phase SRM and 3D FEM analysis. Also, driving device was fabricated for prototype. Speed and torque characteristic was confirmed through the experiments, and flux linkage, which is important parameter of SRM for generating torque, was measured. The induction emf was calculated by using ideal inductance graph and current graph. Calculated emf and measured emf was compared for confirming loss of prototype in this paper.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.996-1003
• /
• 1990

We present algebraic algorithms for collision-avoidance robot motion planning problems with planar geometric models. By decomposing the collision-free space into horizontal vertex visibility cells and connecting these cells into a connectivity graph, we represent the global topological structure of collision-free space. Using the C-space obstacle boundaries and this connectivity graph we generate exact (non-heuristic) compliant and gross motion paths of planar curved objects moving with a fixed orientation amidst similar obstacles. The gross motion planning algorithm is further extended (though using approximations) to the case of objects moving with both translational and rotational degrees of freedom by taking slices of the overall orientations into finite segments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.68-77
• /
• 2004

This paper considers the workforce assignment problem to minimize both the deviations of workloads assigned to workers and to maximize the total preference between each worker and each machine. Because of the high expense of technology education and the difficulties of firing employees, there is no part time workers in semiconductor industry. Therefore, multi-skilled workers are trained for performing various operations in several machines. The bicriteria workforce assignment problem in this paper is not easy to obtain the optimal solution considering the aisle structure and it is belong to NP-class. The proposed heuristic algorithms are developed based on the combination of spacefilling curve technique, simulated annealing technique and graph theory focusing on the multiple-row machine layout. Examples are presented for the proposed algorithms how to find a good solution.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.82-90
• /
• 2006

Reconfigurability of machine tools is one of the critical factors to realize the responsive manufacturing systems to satisfy the mass customization production. This paper presents the methods to model the reconfigurable machine tools (RMTs) on Internet in response to change in the machining requirements. Specifically, the structure and motion model of machine tools using module combination rules and connectivity graph are developed. And we developed Internet-based simulator for designing of RMTs (ISD-RMT). In response to the user requirements, various structures of RMTs can be derived using the module combination rules and connectivity graph relationships. In addition, the user can verify generating structures through the control and simulation procedures.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.329-329
• /
• 2000

In this paper, a spindle system using an electromagnetic exciter is proposed to compensate a spindle disturbance such as unbalance and machining force etc A spindle compliance can be readily varied with a disturbance which is generated by the interact ion between the spindle / workpiece structure and the cutting process dynamics. The varied compliance is one of the major constraints that deteriorates the surface quality of workpiece. This paper suggests a compliance compensation by using the EME in the proposed spindle system. To compensate the varied compliance, firstly a spindle system modeling was conducted by using the bond graph. Then the model is simulated by numerical analysis method and an optimal EME position is determined to compensate a disturbance effectively through simulation, which makes the bearing load to be minimized

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.6
• /
• pp.477-482
• /
• 2016

This paper presents a simple approximation-based design approach for consensus tracking of heterogeneous second-order nonlinear systems under a directed network. All nonlinearities of followers are assumed to be unknown and non-identical. In the controller design procedure, graph-independent error surfaces are used and an unimplementable intermediate controller for each follower is designed at the first design step. Then, by adding and subtracting a graph-based term at the second step, the actual controller for each follower is designed by using one neural network employed to estimate a lumped and distributed nonlinearity. Therefore, the proposed local controller for each follower has a simpler structure than existing approximation-based consensus tracking controllers for multi-agent systems with unmatched nonlinearities.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.3
• /
• pp.174-183
• /
• 2001

This study proposes an improved genetic algorithm (GA) to derive solutions for facility layout problems having inner walls and passages. The proposed algorithm models the layout of facilities on a flour-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities are calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared to an actual ship compartment layout.