• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2911-2913
• /
• 1999

This paper suggest an optimal identification method to complex and nonlinear system modeling that is based on Fuzzy-Neural Network(FNN). The FNN modeling implements parameter identification using HCM algorithm and optimal identification algorithm structure combined with two types of optimization theories for nonlinear systems, we use a HCM Clustering Algorithm to find initial parameters of membership function. The parameters such as parameters of membership functions, learning rates and momentum coefficients are adjusted using optimal identification algorithm. The proposed optimal identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregate objective function(performance index) with weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.530-540
• /
• 2020

In order to solve the problem of low tracking accuracy caused by complex noise in the fault diagnosis of complex nonlinear system, a fault diagnosis method of high precision cost reference particle filter (CRPF) is proposed. By optimizing the low confidence particles to replace the resampling process, this paper improved the problem of sample impoverishment caused by the sample updating based on risk and cost of CRPF algorithm. This paper attempts to improve the accuracy of state estimation from the essential level of obtaining samples. Then, we study the correlation between the current observation value and the prior state. By adjusting the density variance of state transitions adaptively, the adaptive ability of the algorithm to the complex noises can be enhanced, which is expected to improve the accuracy of fault state tracking. Through the simulation analysis of a fuel unit fault diagnosis, the results show that the accuracy of the algorithm has been improved obviously under the background of complex noise.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.7
• /
• pp.339-349
• /
• 2001

This paper suggests an optimal identification method for complex and nonlinear system modeling that is based on Fuzzy-Neural Networks(FNN). The proposed Hybrid Identification Algorithm is based on Yamakawa's FNN and uses the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. In this paper, the FNN modeling implements parameter identification using HCM algorithm and hybrid structure combined with two types of optimization theories for nonlinear systems. We use a HCM(Hard C-Means) clustering algorithm to find initial apexes of membership function. The parameters such as apexes of membership functions, learning rates, and momentum coefficients are adjusted using hybrid algorithm. The proposed hybrid identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregated objective function(performance index) with weighting factor is introduced to achieve a sound balance between approximation and generalization abilities of the model. According to the selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity(distribution of I/O data), we show that it is available and effective to design an optimal FNN model structure with mutual balance and dependency between approximation and generalization abilities. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5785-5804
• /
• 2019

The information of localization is a fundamental requirement in wireless sensor network (WSN). The method of distance vector-hop (DV-Hop), a range-free localization algorithm, can locate the ordinary nodes by utilizing the connectivity and multi-hop transmission. However, the error of the estimated distance between the beacon nodes and ordinary nodes is too large. In order to enhance the positioning precision of DV-Hop, fast triangle flip bat algorithm, which is based on curve strategy and rank transformation (FTBA-TCR) is proposed. The rank is introduced to directly select individuals in the population of each generation, which arranges all individuals according to their merits and a threshold is set to get the better solution. To test the algorithm performance, the CEC2013 test suite is used to check out the algorithm's performance. Meanwhile, there are four other algorithms are compared with the proposed algorithm. The results show that our algorithm is greater than other algorithms. And this algorithm is used to enhance the performance of DV-Hop algorithm. The results show that the proposed algorithm receives the lower average localization error and the best performance by comparing with the other algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.489-496
• /
• 2006

The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1993.04a
• /
• pp.37-44
• /
• 1993

There are a lot of linear dynamic analysis methods for complex structures. Each method has advantages and shortcomings. Method of dynamic analysis for complex structure is selected considering characteristics of dynamic loading, computer facility available number of degree of freedem and accuracy of results. It is a main point of view to get economical results rather then accurate ones for analysis of general complex structures, Mode superposition method and direct integration method are generally used. However, the characteristics of load is not considered in mode superpositon method, the personal computer cannot be used in direct integration methods. To over-come these shortcomings, the component mode method incorporating Ritz algorithm updated is proposed to solve economically dynamic behavior of the structures. The purpose of study is a formulation of algorithm, and computer programing suitable for dynamic analysis of the complex structure in personal computer environment.

• Structural Engineering and Mechanics
• /
• v.32 no.5
• /
• pp.667-683
• /
• 2009

FE model-based dynamic analysis has been widely used to predict the dynamic characteristics of civil structures. In a physical point of view, an FE model is unavoidably different from the actual structure as being formulated based on extremely idealized engineering drawings and design data. The conventional model updating methods such as direct method and sensitivity-based parameter estimation are not flexible for model updating of complex and large structures. Thus, it is needed to develop a model updating method applicable to complex structures without restriction. The main objective of this paper is to present the model updating method based on the hybrid genetic algorithm (HGA) by combining the genetic algorithm as global optimization method and modified Nelder-Mead's Simplex method as local optimization method. This FE model updating method using HGA does not need the derivation of derivative function related to parameters and without application of complicated inverse analysis methods. In order to allow its application on diversified and complex structures, a commercial FEA tool is adopted to exploit previously developed element library and analysis algorithms. Moreover, an output-level objective function making use of measurement and analytical results is also presented to update simultaneously the stiffness and mass of the analysis model. The numerical examples demonstrated that the proposed method based on HGA is effective for the updating of the FE model of bridge structures.

• International Journal of Aeronautical and Space Sciences
• /
• v.10 no.2
• /
• pp.1-11
• /
• 2009

In this paper, two algorithms to solve the path planning problem with constraints from obstacles are presented. One proposed Algorithm is "Grid point-based path planning". The first step of this algorithm is to set points which can be the waypoints around the field. These points can be located inside or outside of the field or the obstacles. Therefore, we should determine whether those points are located in the field or not. Using the equations of boundary lines for a region that we are interested in is an effective approach to handle. The other algorithm is based on the boundary lines of the agricultural field, and the concept of this algorithm is well known as "boustrophedon method". These proposed algorithms are simple but powerful for complex cases since it can generate a plausible path for the complex shape which cannot be represented by using geometrical approaches efficiently and for the case that some obstacles or forbidden regions are located on the field by using a skill of discriminants about set points. As will be presented, this proposed algorithm could exhibit a reasonable accuracy to perform an agricultural mission.

• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.58-67
• /
• 2016

With the large amount of complex network data that is increasingly available on the Web, link prediction has become a popular data-mining research field. The focus of this paper is on a link-prediction task that can be formulated as a binary classification problem in complex networks. To solve this link-prediction problem, a sparse-classification algorithm called "Truncated Kernel Projection Machine" that is based on empirical-feature selection is proposed. The proposed algorithm is a novel way to achieve a realization of sparse empirical-feature-based learning that is different from those of the regularized kernel-projection machines. The algorithm is more appealing than those of the previous outstanding learning machines since it can be computed efficiently, and it is also implemented easily and stably during the link-prediction task. The algorithm is applied here for link-prediction tasks in different complex networks, and an investigation of several classification algorithms was performed for comparison. The experimental results show that the proposed algorithm outperformed the compared algorithms in several key indices with a smaller number of test errors and greater stability.

• Journal of Korean Port Research
• /
• v.7 no.1
• /
• pp.5-12
• /
• 1993

In complex decision making such as ill-defined system, one of the main problem is how to treat ambiguous aspect of the decision making. According to the complexity and ambiguity of the objective systems, many types of evaluation attributes are necessary for the rational decision and the relationship among the attributes become complex and fuzzy. Fuzzy integral is very effective to evalute the complex system with interaction between attributes but how to save the evaluation efforts in the decision making process of grading the membership of the objects or alternative is the problem to be tackled. Because the more object there are to evaluate, the number of decisions to made increase exponentially. Therefore, this paper aimes to propose a new evaluation algorithm based on fuzzy integral which can save the evaluator's efforts in decision making process. The proposed algorithm is constructed as follows : First, compose the fuzzy measure by introducing AHP(Analytical Hierachy Process) & mutual interaction coefficient. Second, generate fuzzy measure value of monotone family set for calculating the fuzzy integral. The effectiveness of the proposed algorithm is investigated through the example and sensitivity of interaction coefficient is illustrated.