• 대한수학회지
• /
• 제42권1호
• /
• pp.1-16
• /
• 2005

This paper presents a fast factorization algorithm for confluent Cauchy-like matrices. The algorithm consists of two parts. First. a confluent Cauchy-like matrix is transformed into a Cauchy-like matrix available to pivot without changing its structure. Second. a fast partial pivoting factorization algorithm for the Cauchy-like matrix is presented. A new displacement structure cannot possibly generate all entries of a transformed matrix, which is called by 'partially reconstructible'. This paper also discusses how the proposed factorization algorithm can be generally applied to partially reconstructive matrices.

• Journal of Advanced Marine Engineering and Technology
• /
• 제32권2호
• /
• pp.351-358
• /
• 2008

This paper introduces a map building algorithm which can collect environmental information using ultrasonic sensors. And also this paper discusses a traveling algorithm using environmental information which leads to the map building algorithm. In order to accomplish the proposed traveling algorithm, this paper additionally discusses a path revision algorithm. For verifying the proposed algorithms, several experiments are executed using a mobile robot physically designed in this paper. The conclusion is that the proposed algorithm is very effective and is applicable to mobile robots especially requiring a low-cost environmental information.

• 제어로봇시스템학회논문지
• /
• 제10권11호
• /
• pp.1071-1076
• /
• 2004

It is a fuzzy controller that it is the most used method in the control of non-linear system. The most important part in the fuzzy controller is a design of fuzzy rules. Many algorithm that design fuzzy rules have proposed. And attention to the evolutionary computation is increasing in the recent days. Among them, the co-evolutionary algorithm is used in the design of optimal fuzzy rule. This paper takes advantage of a schema co-evolutionary algorithm. In order to verify the efficiency of the schema co-evolutionary algorithm, a fuzzy controller for the mobile robot control is designed by the schema co-evolutionary algorithm and it is compared with other parasitic co-evolutionary algorithm such as a virus-evolutionary genetic algorithm and a co-evolutionary method of Handa.

• Journal of Advanced Marine Engineering and Technology
• /
• 제32권1호
• /
• pp.184-191
• /
• 2008

In order for a mobile robot to move under unknown or uncertain environment, it must have an environmental information. In collecting environmental information, the mobile robot can use various sensors. In case of using ultrasonic sensors to collect an environmental information, it is able to comprise a low-cost environmental recognition system compared with using other sensors such as vision and laser range-finder. This paper proposes a map building algorithm which can collect environmental information using ultrasonic sensors. And also this paper suggests a traveling algorithm using environmental information which leads to the map building algorithm. In order to accomplish the proposed traveling algorithm, this paper additionally discusses a position revision algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.311-312
• /
• 2007

This paper proposes a new algorithm for path planning and obstacles avoidance using the ant colony optimization algorithm. The proposed algorithm is a new hybrid algorithm that composes of the ant colony algorithm method and the Maklink graph method. At first, we produce the path of a mobile robot a the static environment. And then we find midpoints of each path using the Maklink graph. Finally the ant colony optimization algorithm is adopted to get a shortest path. In this paper, we prove the performance of the proposed algorithm is better than that of the Dijkstra algorithm through simulation.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권3호
• /
• pp.158-164
• /
• 2003

This paper proposes a percentage current differential relaying algorithm for bus protection using an advanced compensating algorithm of the secondary current of current transformers (CTs). The compensating algorithm estimates the core flux at the start of the first saturation based on the value of the second-difference of the secondary current. Then, it calculates the core flux and compensates distorted currents using the magnetization curve. The algorithm Is unaffected by a remanent flux. The simulation results indicate that the proposed algorithm can discriminate internal faults from external faults when the CT saturates. This paper concludes by implementing the algorithm into a TMS320C6701 digital signal processor. The results of hardware implementation are also satisfactory. The proposed algorithm can improve not only stability of the relay in the case of an external fault but sensitivity of the relay in the case of an internal fault.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.229-232
• /
• 2001

Recently, several promising multiobjective evolutionary algorithms, e,g, SPEA, NSGA-ll, PESA, and SPEA2, have been developed. In this paper, we also propose a new multiobjective evolutionary algorithm that compares to them. In the algorithm proposed in this paper, we introduce a novel concept, "inherited age" and total algorithm is executed based on the inherited age concept. Also, we propose a new sharing algorithm, called objective classication sharing algorithm(OCSA) that can preserve the diversity of the population. We will show the superior performance of the proposed algorithm by comparing the proposed algorithm with other promising algorithms for the test functions.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권8호
• /
• pp.344-351
• /
• 2002

The proposed immune algorithm has an uncomplicated structure and memory-cell mechanism as the optimization algorithm which imitates the principle of humoral immune response. We use the proposed algorithm to solve parameter optimization problems. Up to now, the applications of immune algorithm have been optimization problems with non-varying system parameters. Therefore the usefulness of memory-cell mechanism in immune algorithm is without. This paper proposes the immune algorithm using a memory-cell mechanism which can be the application of system with nonlinear varying parameters. To verified performance of the proposed immune algorithm, the speed control of nonlinear DC motor are performed. The results of Computer simulations represent that the proposed immune algorithm shows a fast convergence speed and a good control performances under the varying system parameters.

• 대한설비공학회:학술대회논문집
• /
• 대한설비공학회 2009년도 하계학술발표대회 논문집
• /
• pp.161-166
• /
• 2009

Condensing gas boiler units may make a big role for the reduction of energy consumption in heating industries. In order to decrease the energy consumption of a boiler unit, the effective operation is necessary. In this study, the supply water temperature algorithm of a condensing gas boiler was developed. This includes the setpoint algorithm and the control algorithm of the supply water temperature. The setpoint algorithm was developed by the fuzzy logic and the control algorithm was developed by the proportional integral algorithm. In order to analyse the performance of the supply water temperature algorithm, the dynamic model of a condensing gas boiler system was used. Simulation results showed that the supply water temperature algorithm developed for this study may be practically applied for the control of the condensing gas boiler.

• 대한산업공학회지
• /
• 제23권2호
• /
• pp.433-450
• /
• 1997

In this study, a heuristic algorithm is developed to solve a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories, and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The algorithm takes advantage of the basic structure of a heuristic algorithm, called the exchange heuristic, but employs different strategies on some critical steps of the original algorithm which have significant effects on the algorithm performance. The original algorithm and the modified algorithm were compared through an experimental investigation. The modified algorithm produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time.