• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.441-446
• /
• 2010

Each robot decides and behaviors themselves surrounding circumstances in the swarm robot system. Robots have to conduct tasks allowed through cooperation with other robots. Therefore each robot should have the ability to learn and evolve in order to adapt to a changing environment. In this paper, we proposed learning based on Q-learning algorithm and evolutionary using Harmony Search algorithm and are trying to improve the accuracy using Harmony Search Algorithm, not the Genetic Algorithm. We verify that swarm robot has improved the ability to perform the task.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.215-221
• /
• 2003

Generally, we want to be searched the newest as well as some appropriate personalized information from the internet resources. However, it is a complex and repeated procedure to search some appropriate information. Moreover, because the user's interests are changed as time goes, the real time modeling of a user's interests should be necessary. In this paper, I propose PREA system that can search and filter documents that users are interested from the World Wide Web. And then it constructs the user's interest model by a modified spreading neural network. Based on this network, PREA can easily produce some queries to search web documents, and it ranks them. The conventional spreading neural network does not have a visualization function, so that the users could not know how to be configured his or her interest model by the network. To solve this problem, PREA gives a visualization function being shown how to be made his interest user model to many users.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.233-238
• /
• 2003

Living creatures maintain their variety through speciation, which helps them to have more fitness for an environment. So evolutionary algorithm based on biological evolution must maintain variety in order to adapt to its environment. In this paper, we utilize the concept of speciation. Each individual of population creates their offsprings using mutation, and next generation consists of them. Each individual explores search space determined by mutation. Useful search space is extended by differentiation, then population explorers whole search space very effectively. If evolvable hardware evolves through mutation, it is useful way to explorer search space because of less varying inner structure. We verify the effectiveness of the proposed method by applying it to two optimization problems.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.206-211
• /
• 2011

In this paper, the evolutionary algorithm was specifically formulated for optimization with continuous parameter space. The proposal was motivated by the fact that the genetic algorithms have been most intensively reported for parameter identification problems with continuous search space. The difference of primary characteristics between genetic algorithms and the proposed algorithm, discrete or continuous individual representation has made different areas to which the algorithms should be applied. Results obtained by optimization of some well-known test functions indicate that the proposed algorithm is superior to genetic algorithms in all the performance, computation time and memory usage for continuous search space problems.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.290-293
• /
• 1996

This paper proposes a scheme of initial cluster center selection in FCM algorithm using the genetic algorithms. The FCM algorithm often fails in the search for global optimum because it is local search techniques that search for the optimum by using hill-climbing procedures. To solve this problem, we search for a hypersphere encircling each clusters whose parameters are estimated by the genetic algorithms. Then instead of a randomized initialization for fuzzy partition matrix in FCM algorithm, we initialize each cluster center by the center of a searched hypersphere. Our experimental results show that the proposed initializing scheme has higher probabilities of finding the global or near global optimal solutions than the traditional FCM algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.146-149
• /
• 2000

In this paper, Computer Colour Matching and Kitchen System (CCMKS) is developed on the basis of delphi package and one-chip processor with fuzzy-PID control. CCMKS will be widely used in the colour dyeing industry as an integrated colour matching and dispensing system which have more advantages than the conventional matching or dispensing system, when controlling the real dyeing processes. Delphi is utilized in making database and search/matching routes. The developed matching function reduces the search and matching time to about one third. One-chip processor is designed and manufactured for the distributed control of three-phase induction motors. Fuzzy-PID control is applied to the speed control of three-phase induction motors for a very precise weight of colour at CCMKS. The developed kitchen function decreases the dispensing time to about one twentieth. The experimental results show CCMKS has more excellent search time, more precise weight and much high fidelity than conventional colour matching or dispensing system, in the performance.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.4
• /
• pp.260-263
• /
• 2008

In this paper we propose Personal Information Management System for Library Database. It manages personal search pattern for the given user and provide specific book list for library book search system. With the proposed system, the conventional overlap searching time will be decreased with personalized information and search history. This system manages the individual data according to personal searching pattern, sequence and usability. Therefore, the user can locate necessary book information more accurately with their distinct interest and search history.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.699-702
• /
• 2000

The Internet has become widely used in many countries. In particular, a new emerging technology, the WWW (World Wide Web), which has become a major application of the Internet, has been rapidly developed. As a result, there are hundreds of millions of URLs (Uniform Resource Locators) on the WWW, and the total number of URLs is still explosively increasing. To get information from the WWW, we generally use Internet search engines. However, we cannot always get the actual information we want. Accordingly, we have solved this problem by constructing a prototype system based on agents by programming language Java for constructing a more effective search engine. This so-called “intelligent agent system on WWW” deletes redundant HTML (Hyper Text Markup Language) files and exchanges information about the existence of URLs. And we found that our prototype system is more powerful and effective than conventional search engines.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.686-691
• /
• 2011

This study is concerned with the identification of fuzzy models. To address the optimization of fuzzy model, we proposed an improved space search evolutionary algorithm (ISSA) which is realized with the combination of space search algorithm and Gaussian mutation. The proposed ISSA is exploited here as the optimization vehicle for the design of fuzzy models. Considering the design of fuzzy models, we developed a hybrid identification method using information granulation and the ISSA. Information granules are treated as collections of objects (e.g. data) brought together by the criteria of proximity, similarity, or functionality. The overall hybrid identification comes in the form of two optimization mechanisms: structure identification and parameter identification. The structure identification is supported by the ISSA and C-Means while the parameter estimation is realized via the ISSA and weighted least square error method. A suite of comparative studies show that the proposed model leads to better performance in comparison with some existing models.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.418-424
• /
• 2005

For the safety and cost reduction of the navigation in the sea, we need automatic and intelligent system for the ship. For the ship automation, we need a route planning based on GPS and the nautical chart. In this paper, we propose a route planning technique using point of contact of the obstacle and treecreation technique. The efficiency of the proposed technique is proved by comparing with A* search technique that is the most famous search technique for route planning from the optimal point of view.