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

In recent years, distributed control systems(DCS) using fieldbus such as CAN have been being applied to process systems but it is very difficult to design the DCS in order to guarantee the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of ...

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1243-1258
• /
• 2017

A new medical materials scheduling system and its modeling method for the complex rescue are presented. Different from other similar system, first both the BeiDou Satellite Communication System (BSCS) and the Special Fiber-optic Communication Network (SFCN) are used to collect the rescue requirements and the location information of disaster areas. Then all these messages will be displayed in a special medical software terminal. After that the bipartite graph models are utilized to compute the optimal scheduling of medical materials. Finally, all these results will be transmitted back by the BSCS and the SFCN again to implement a fast guidance of medical rescue. The sole drug scheduling issue, the multiple drugs scheduling issue, and the backup-scheme selection issue are all utilized: the Kuhn-Munkres algorithm is used to realize the optimal matching of sole drug scheduling issue, the spectral clustering-based method is employed to calculate the optimal distribution of multiple drugs scheduling issue, and the similarity metric of neighboring matrix is utilized to realize the estimation of backup-scheme selection issue of medical materials. Many simulation analysis experiments and applications have proved the correctness of proposed technique and system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.4
• /
• pp.346-352
• /
• 2006

In a networked control system (NCS), time delays which are larger than one sampling period can change the control period. As a result, it may cause system instability. This paper presents a control method for an NCS using the controller area network (CAN), where time delays arise in the control loop. Specifically, a simple yet efficient method is proposed to improve control performance in the presence of time delays. The proposed method, which can be regarded as a gain scheduling method, selects a suitable LQ control gain among several gains to deal with the problems due to the change of control period. It is found that the gain can be scheduled in terms of the relation between the gain and the sampling period, which is represented by first-order algebraic equations. The proposed method is evaluated with an inverted cart pendulum system where the actuator and sensors are connected through the CAN. Experiment results are presented to show the efficiency of the proposed method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1143-1152
• /
• 1999

A Mobile computing environment is a new paradigm which provides users with the access to information irrespective of users' location. A transaction scheduling method for the mobile computing environment must be designed so that database consistency is maintained with considering the limited performance of mobile hosts and the narrow bandwidth of a wireless network. The scheduling method using a lock has some problems: the high message overhead between a server and a mobile host for maintaining a lock and the high abort ratio of the mobile transactions owing to violating the serializability when a mobile host uses a cache. So, in this paper, we propose an efficient transaction management method using timestamp to resolve these problems. The proposed method is used in the environment under which a mobile host uses a cache having two versions for each cached data item and a server maintains several versions for each data item. So, even though a mobile transaction is executed during several broadcasting interval, can be committed. As a result, the proposed method can improve the commit ratio of the mobile transactions by maintaining multiversion for each data item and does not require the additional message exchange to schedule transactions by using timestamp.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.89-99
• /
• 2000

This paper deals with a heuristic algorithm for the vehicle routing-scheduling problem to minimize the total travel distance and the total cost. Because the aim of the Clarke-Wright method, one of famous heuristic methods, is to minimize the total travel distance of vehicles, it cannot consider the cost if the cost and the travel distance is not proportional. In the Clarke-Wright method, the route of each vehicle is found by using the saving matrix which is made by an assumption that the vehicle comes back to the starting point. The problem dealt with in the paper, however, does not need the vehicle to come back because each vehicle has its hoping-start-points and hoping-destination-points. Therefore we need a different saving matrix appropriate to this occasion. We propose a method to find an initial solution by applying network simplex method after transforming the vehicle routing-scheduling problem into the minimum cost problem. Moreover, we propose a method to minimize the total travel distance by using the modified saving matrix which is appropriate to no-return occasion and the method for the case of plural types of vehicles and freights.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.34-34
• /
• 2000

One of the basic goals, when considering networks for communication in industrial control applications, is the reduction of complexity of related wiring harnesses. In addition, the networking offers the advantages for industrial control applications, such as ease of cabling, ease of changes in the cabling, ease of adding controller modules, etc. CAN (Controller Area Network) is generally applied in car networking in order to reduce the complexity of the related wiring harnesses. These traditional CAN application techniques are modified to achieve the real time communication for the industrial control applications. In this paper, we propose the method of CAN Identifier assignment for Real-Time network system. This method is can be used to scheduling messages on CAN for Real-Time network system. And also, the real-time network system is developed and the proposed moth(Ids are verified experimentally.

• Journal of the Korea Institute of Building Construction
• /
• v.18 no.6
• /
• pp.595-602
• /
• 2018

Network-based scheduling methods can be classified into CPM method and PERT method. In the network scheduling chart, critical path can be estimated by performing the forward calculation and the backward calculation though the paths in the network chart. In PERT method, however, it is unreasonable to simply estimate the critical path by adding the sum of the activity durations in a specific path, since it does not incorporate probabilistic concept of PERT. The critical path of a PERT network can change according to the target period and deviation, and in some cases, the expected time of the critical path may not be the path with longest expected time. Based on this concept, this study proposes a technique to derive the most-likely critical path by comparing the sum of estimated time with the target time. It also proposes a method of systematically deriving all alternate paths for a network of repetitive activities. Case studies demonstrated that the most-likely critical path is not a fixed path and may vary according to the target period and standard deviation. It is expected that the proposed method of project duration forecasting will be useful in construction environment with varying target date situations.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.73-81
• /
• 2011

The WBAN(Wireless Body Area Network) technology is a short distance wireless network which provides each device's interactive communication by connecting devices inside and outside of body located within 3 meters. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. The The WBAN servides consists of both medical and non-medical applications. The medical application service uses the sensor that transfer the periodic traffic and have different data rates. It uses GTS method to guarantee QoS. In this paper, a new method is proposed, which are suitable design for MAC Protocol. Firstly, MAC frame structure and a primitive based on the WBAN are proposed. Secondly, we proposed the GTS algorithm improved the channel utilization based on the WFQ(Weighted Fair Queuing). The proposed scheduling method is improved channel utilization compared with i-Game(Round Robin scheduling method).

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.915-927
• /
• 2008

Networked control systems(NCSs) have gained increasing attention in recent years due to their advantages and potential applications. The network Quality-of-Service(QoS) in NCSs always fluctuates due to changes of the traffic load and available network resources. To handle the network QoS variations problem, this paper presents an intelligent scheduling control method for NCSs, where the sampling period and the control parameters are simultaneously scheduled to compensate the effect of QoS variation on NCSs performance. For NCSs with network-induced delays and packet dropouts, a discrete-time switch model is proposed. By defining a sampling-period-dependent Lyapunov function and a common quadratic Lyapunov function, the stability conditions are derived for NCSs in terms of linear matrix inequalities(LMIs). Based on the obtained stability conditions, the corresponding controller design problem is solved and the performance optimization problem is also investigated. Simulation results are given to demonstrate the effectiveness of the proposed approaches.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.