• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.137-143
• /
• 2005

Autonomous mobile robot has an ability to navigate using both map in known environment and sensors for detecting obstacles in unknown environment. In general, autonomous mobile robot navigates by global path planning on the basis of already made map and local path planning on the basis of various kinds of sensors to avoid abrupt obstacles. This paper provides a global path planning method using self-organizing feature map which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.817-822
• /
• 2004

This paper provides a global path planning method using self-organizing feature map which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1468-1473
• /
• 2005

In this paper, I proposed the INTelligent Agent System by Kohonen's Self Organizing Neural Network (INTAS). INTAS creates each user's profile from the information. Based on it, learning community grouping suitable to each individual is automatically executed by using unsupervised learning algorithm. In INTAS, grouping and learning are automatically performed on real time by multiagents, regardless of the number of learners. A new framework has been proposed to generate multiagents, and it is a feature that efficient multiagents can be executed by proposing a new negotiation mode between multiagents..

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.681-686
• /
• 1991

In this paper, a novel self-organizing fuzzy plus PID control algorithm is proposed and analyzed by extensive computer simulations and experiments with an inverted pendulum. Specifically, the proposed self-organizing fuzzy controller consists of a typical fuzzy reasoning part and self organizing part in which both on-line and off-line algorithms are employed to modify the 'then' part of the fuzzy rules and to decide how much fuzzy rules are to be modified after evaluating the control performance, respecfively. And the fuzzy controller is replaced by a PID controller in a prespecified region near by the set point for good settling actions.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.191-196
• /
• 1998

A new Fuzzy Logic Controller(FLC) called a Gradient-Descent Based Self-Organizing Controller is presented. The Self-Organizing Controller(SOC) has two inputs such as error and change of error, and updates control rules with monitoring a performance measure. There are many works in the SOC which concentrate on the self-organizing ability in control rule base, but have a few research on the performance measure which is akin to sliding mode control. With this procedure, we can get a robust performance measure on the SOC. To verify the perfomance of proposed controller, we have performed for the cart-pole system which is one of the well-known benchmark problem in the control literature.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.2
• /
• pp.162-170
• /
• 2002

Detecting straight lines in an image is frequently required for various machine vision applications such as restoring CAD drawings from scanned images and object recognition. The standard Hough transform has been dominantly used to that purpose. However, massive storage requirement and low precision in estimating line parameters due to the quantization of parameter space are the major drawbacks of the Hough transform technique. In this paper, to overcome the drawbacks, an iterative algorithm based on a self-organizing map is presented. The self-organizing map can be adaptively learned such that image points are clustered by prominent lines. Through the procedure of the algorithm, a set of lines are sequentially detected one at a time. The algorithm can produce highly precised estimates of line parameters using very small amount of storage memory. Computational results for synthetically generated images are given. The promise of the algorithm is also demonstrated with its application to two natural images of inserts.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.5
• /
• pp.533-540
• /
• 1992

The Self Creating and Organizing (SCO) is a new architecture and one of the unsupervized learning algorithm for the artificial neural network. SCO begins with only one output node which has a sufficiently wide response range, and the response ranges of all the nodes decrease automatically whether adapting the weights of existing node or creating a new node. It is compared to the Kohonen's Self Organizing Feature Map (SOFM). The results show that SCONN has lots of advantages over other competitive learning architecture.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.18-21
• /
• 1995

In this paper we describe a new method for multimodal function optimization using genetic algorithms(GAs). We propose adaptation rules for GA parameters such as population size, crossover probability and mutation probability. In the self organizing genetic algorithm(SOGA), SOGA parameters change according to the adaptation rules. Thus, we do not have to set the parameters manually. We discuss about SOGA and those of other approaches for adapting operator probabilities in GAs. The validity of the proposed algorithm will be verified in a simulation example of system identification.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.303-311
• /
• 1999

The amount of financial information in today's sophisticated large data bases is huge and makes comparisons between company performance difficult or at least very time consuming. The purpose of this paper is to investigate whether neural networks in the form of self-organizing maps can be used to manage the complexity in large data bases. This paper structures and analyzes accounting numbers in a large data base over several time periods. By using self-organizing maps, we overcome the problems associated with finding the appropriate underlying distribution and the functional form of the underlying data in the structuring task that is often encountered, for example, when using cluster analysis. The method chosen also offers a way of visualizing the results. The data base in this study consists of annual reports of more than 80 Korean companies with data from the year 1998.