• 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.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.7-8
• /
• 2007

In this paper, an efficient routing algorithm for the heterogeneous home network in which IEEE 802.15.4 compensates for limitations of PLC based home networks. The efficient routing algorithm changes the broadcast period of routing information frame according to the mobility of the node. We implemented the routing algorithm and built a test-bed.

• Journal of Advanced Marine Engineering and Technology
• /
• v.29 no.4
• /
• pp.369-376
• /
• 2005

In recent years, AGVs(Automated Guided Vehicles) have received growing attention as a subsystem of the integrated container operating system which enables unmanned control. improvement of job reliability, accuracy and productivity. Therefore, a number of works have been done to enhance the performance AGVs. In this paper. job deployment and a dynamic routing control system composed of supervisor, traffic controller. motion controller and routing table are discussed. A simple job deployment scheme and an efficient dynamic routing algorithm incorporating with the deadlock prediction and avoidance algorithm are investigated.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.199-206
• /
• 2016

This paper describes a simple routing control system. We propose achieving high-speed data transmission without modifying the data frame configuration. To add a routing control signal, called the "labeling signal" in this paper, to the data frame, we use a frequency modulation technique on the transmitted frame. This means you need not change the data frame when you transmit additional signals. Using a prototype system comprising a field-programmable gate array and discrete elements, we investigate the system performance and devise a method to achieve high resolution. A three-channel routing control for a 10 Gb/s data frame was achieved, which confirms the advantages of the proposed system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.35-46
• /
• 1999

The introduction of general purpose machining centers and the information system based on computer network has added a new control problem to the classical job shop control problems: a routing problem. A routing problem is to determine the machine on which a part will be processed. The modern manufacturing systems are given much system status information including the arrival time of the future parts via the computer network for automation. This paper presents and tests the performance of a routing procedure, LARP(Look-Ahead Routing Procedure) which uses look-ahead information on the future arrival of parts in the system. The manufacturing system considered in this paper has multi-stations which consists of general purpose machines and processes parts of different types. The application of LARP under many operating conditions shows that the reduction of part flow time and tardiness from the cases without using this information is up to 8% for flow time and 21% for tardiness. The procedure introduced here can be used for many highly automated systems such as an FMS and a semi-conductor fabrication system for routing where the arrivals of parts in the near future are known.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.2
• /
• pp.53-69
• /
• 2010

This paper proposes an ant-based routing algorithm, Ant System-Routing in wireless Senor Networks(AS-RSN), for wireless sensor networks. Using a transition rule in Ant System, sensors can spread data traffic over the whole network to achieve energy balance, and consequently, maximize the lifetime of sensor networks. The transition rule advances one of the original Ant System by re-defining link cost which is a metric devised to consider energy-sufficiency as well as energy-efficiency. This metric gives rise to the design of the AS-RSN algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. Therefore, AS-RSN is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: Direct Communication Approach, Minimum Transmission Energy, and Self-Organized Routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.79-97
• /
• 1997

Many dispatching rules have been developed for the on-line control of product flow in a job shop. The introduction of a flexible manufacturing system (FMS) has added a new requirement to classical job shop control problem : the selection of machines by parts of different types. An FMS can keep a great deal of information on the status of the system, such as information on what is scheduled in the near future, with great accuracy. For example, the knowledge of the time when the next part will arrive at each machine can be neneficial for the routing. This paper tests the effects of the use of this knowledge for part routing on the parts flow time (sum of the time for waiting and service) under a simple routing procedure- a look-ahead routing procedure. A test under many operating conditions shows that the reduction of part flow time from the cases without using this information is between 1% and 11%, which justifies more study on this routing procedure at real production sites when machine capacity is a critical issue. The test results of this paper are also valid for other highly automated systems such as the semi-conductor fabrication plants for routing when the arrivals of parts in the near future are known.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.11-12
• /
• 2006

An algorithm to improve the efficiency of the hierarchical routing in ZigBee Networks is proposed. By forwarding the data to the nearest neighbor in the hierarchy, more efficient path can be achieved without any control and memory overhead. Simulation results shows the proposed algorithm provides about 20% shorter path.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.45-47
• /
• 2009

Wireless Sensor Network(WSN) has been very popular in unattended surveillance systems recently. For Applying WSN into Building Automation system(BAS), a novel hierarchial network structure and static routing algorithm which eliminates the scalability limitation of Zigbee are proposed in this paper. The static routing algorithm relying on the hierarchial network address reduces the computational complexity to a great extent and has a real-time performance which satisfies urgent applications well.