• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.1117-1123
• /
• 2005

This paper deals with a new automated guided vehicle (AGV) control system for distributed control. Proposed AGV control system adapts the multi-agent technology. The system is composed of two types of controller: routing and order. The order controller is in charge of assignment of orders to AGVs. Through the bidding-based negotiation with routing controllers, the order controller assigns a new order to the proper AGV. The order controller announces order information to the routing controllers. Then the routing controllers generate a routing schedule for the order and make a bid according to the routing schedule. If the routing schedule conflicts with other AGV's one, the routing controller makes an alternative through negotiation with other routing controllers. The order controller finally evaluates bids and selects one. Each controller consists of a set of agents: negotiation agent, decision making agent and communication agent. We focus on the agent architecture and negotiation-based AGV scheduling algorithm. Proposed system is validated through an exemplary scenario.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.1
• /
• pp.22-28
• /
• 2018

In case of developing a combined system by a number of distributed resources with storage device, a number of application suggests a huge capacity can derive operational flexibility both power supply issues or when unexpected situation imposed. However, it is important to determine a resonable energy capacity because the device have many controversial cost issues in current power system industry. An ESS application which focusing essentially required points can induce appropriate storage capacity that required in economic operation. In this paper, a curtailment supporting algorithm based on storage device is introduced, and applied in the capacity calculation method. The main algorithm pursues handling minor exceeding quantities which can cause mechanical load at blade; This paper tries to include it for configuring hybrid algorithm with pitch control. Several fluctuating conditions are utilized in simulation to reflect critical situation. The analyzing process focuses on the control feasibility with applied capacity and control method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1167-1178
• /
• 1991

In this paper, we review the characteristics of battle field, consider required properties of mobile radio network, and design network control architecture proper to battle field network. Also we design distributed algorithm which constructs network control architecture and transmission schedule. For the information of network connectivity and the immediate reconfiguration caused by failure, loss, or movement of nodes, configuration and transmission schedule, algorithms are to be executed periodically and for entire network reliability, algorithms must to be executed fully distributedly. At the time of loss or failure of primary local control node, we suggest the method which diminishes transmission delay. We explain the operation of network with examples. Finally designed algorithms are verified and analized by computer simulation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1545-1551
• /
• 1995

As the modern industrial processes become more complex, it is getting more difficult to model and control the processes. Naturally, an advanced type of DCS(Distributed Control System) with higher level functions is being sought. Advanced DCS is a DCS with advanced functions such as fault diagnosis, GPC(Generalized Predictive Control), NN(Neural Network), and Fuzzy Control. In this thesis, we have studied a fuzzy control algorithm for realizing an advanced DCS. Its algorithm is implemented in a form of function code which is a process control language, being used by the industrial engineers. To verify the realized function code of the fuzzy control, the function code is applied to a continuous casting process of the Pohang Iron & Steel Works in Kwangyang. The rules of the fuzzy control were collected via interviews of the field operators and their operation documents. Finally under a real-time operating system environment, usability of the function code of the fuzzy control is shown via simulation for the continuous casting process.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.101.4-101
• /
• 2001

Evolutionary algorithm has been receiving a remarkable attention due to the model-free and population-based parallel search attributes and much successful results are coming out. However, there are some problems in most of the evolutionary algorithms. The critical one is that it takes much time or large generations to search the global optimum in case of the objective function with multimodality. Another problem is that it usually cannot search all the local optima because it pays great attention to the search of the global optimum. In addition, if the objective function has several global optima, it may be very difficult to search all the global optima due to the global characteristics of the selection methods. To cope with these problems, at first we propose a preprocessing process, grid-filtering algorithm(GFA), and propose a new distributed evolutionary ...

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.951-958
• /
• 2019

For the power grid-connection of distributed generation, the output voltage of the distributed generation must be synchronized with the grid voltage before the grid-connection. In this paper, a vector control based synchronization algorithm was developed for grid linkage of three-phase inverters. A three-phase voltage inverter was designed and fabricated to verify the effectiveness of the developed algorithm. The main controller of the three-phase inverter was developed based on DSP, and the electrical level of the system was set to an electrical level that can be tested in the laboratory. Throughout the experiments, it was confirmed that the proposed algorithm could be used as a synchronization algorithm for grid-connection by showing that the output voltage of the three-phase inverter is synchronized with the grid voltage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.323-325
• /
• 2014

The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the information sharing delay in the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff between these two performances according to node's coverage. In this paper, we present a method of coverage control that minimizes consensus time according to network scale.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1649-1665
• /
• 2021

In view of the low accuracy of the traditional FunkSVD algorithm, and in order to improve the computational efficiency of the algorithm, this paper proposes a parallel algorithm of improved FunkSVD based on Spark (SP-FD). Using RMSProp algorithm to improve the traditional FunkSVD algorithm. The improved FunkSVD algorithm can not only solve the problem of decreased accuracy caused by iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, thereby achieving the effect of improving the accuracy of the algorithm. And using the Spark big data computing framework to realize the parallelization of the improved algorithm, to use RDD for iterative calculation, and to store calculation data in the iterative process in distributed memory to speed up the iteration. The Cartesian product operation in the improved FunkSVD algorithm is divided into blocks to realize parallel calculation, thereby improving the calculation speed of the algorithm. Experiments on three standard data sets in terms of accuracy, execution time, and speedup show that the SP-FD algorithm not only improves the recommendation accuracy, shortens the calculation interval compared to the traditional FunkSVD and several other algorithms but also shows good parallel performance in a cluster environment with multiple nodes. The analysis of experimental results shows that the SP-FD algorithm improves the accuracy and parallel computing capability of the algorithm, which is better than the traditional FunkSVD algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.92-101
• /
• 2012

In this paper, we propose a distributed transmit power control algorithm for optimal end-to-end throughput in wireless multihop networks. Considering a solidarity property of link rates consisting of a multihop link and the fact that the multihop end-to-end throughput is determined by the minimum link rate, the proposed scheme controls the transmit power to make all link rates be equal and so maximizes the end-to-end throughput of multihop link. In addition, in the proposed scheme the transmit node calculates its transmit power autonomously in a distributed manner just through the information sharing with its neighbor nodes and so decreases the information sharing overhead. Simulation results show that the proposed scheme achieves significant improvements in terms of end-to-end throughput and power consumption compared with the conventional maximum equal power allocation scheme.