• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.617-622
• /
• 2000

In this paper proposed is an $H_{\ifty}$ based flow controller for the ATM networks. The round trip time-delay uncertainty is taken into account and robustness of the proposed controller is analyzed. Maximum allowable time-delay uncertainties are computed with different weightings on performance and robustness. And discussed is a time-domain implementation method of the proposed controller. Time domain simulation with realistic environment demonstrates that the performance of the proposed controller is much better than that of conventional one.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.12
• /
• pp.1196-1201
• /
• 2004

H₂ controller is proposed for networked control systems with time-varying delay. The time-varying network delay is assumed to be unknown, but its lower and upper bounds are assumed to be known. The time-varying delay is treated like a parameter variation and robust control technique is used to deal with the time-varying delay. The proposed controller can be computed by solving linear matrix inequalities. Through numerical simulations, the proposed controller is verified.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.23-25
• /
• 2005

This paper is devoted to the passivity based control in bilateral teleoperation for varying time delay. Toimprove the stability and task performance, master and slave in bilateral teleoperation must be coupled via the network through which the force and velocity are communicated. However, time delay existing in the transmission channel is a long standing impediment to bilateral control and can destabilize the system, even if the system is stable without time delay, In this paper, we investigate how the varying time delay affects the advanced teleoperation stability and results in an out-of-control status. A new approach based on passivity control has been bilaterally designed for both the master and slave sites and the simulation result will verify that our approach is better and effective for passive bilateral teleoperation.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.441-444
• /
• 2003

Network uncertainties such as data loss and time delay can vary the stability property of networked control system. Therefore, these uncertainties must be considered first in designing networked control system. In this paper, we present a new stability analysis method of networked control system with data loss and time delay. The proposed method can determine maximum allowable time delay and minimum allowable transmission rate that preserves stability performance of networked control system. The results of the simulation validate effectiveness of our stability analysis method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.78-101
• /
• 2017

High-quality industrial control is critical to ensuring production quality, reducing production costs, improving management levels and stabilizing equipment and long-term operations. WiFi-based Long Distance (WiLD) networks have been used as remote industrial control networks. Real-time performance is essential to industrial control. However, the original mechanism of WiLD networks does not minimize end-to-end delay and restricts improvement of real-time performance. In this paper, we propose two algorithms to obtain the transmitting/receiving phase cycle length for each node such that real time constraints can be satisfied and phase switching overhead can be minimized. The first algorithm is based on the branch and bound method, which identifies an optimal solution. The second is a fast heuristic algorithm. The experimental results show that the execution time of the algorithm based on branch and bound is less than that of the heuristic algorithm when the network is complex and that the performance of the heuristic algorithm is close to the optimal solution.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.121-124
• /
• 1999

In a packet-switched wireless cellular network, a packet destined to a mobile station is queued at a base station and then broadcast over the base station's cell. When an active mobile station leaves a cell, there re-main packets which are destined to the mobile and not yet delivered to it at the cell's base station. For application which are sensitive to packet losses, such back- logged packets must be forwarded to the new base station. Otherwise, an end-to-end retransmission may be required. However, an increase in packet delay is incurred by employing the packet forward scheme, since a packet may be forwarded many times before it is delivered to the destined mobile station. For an enhanced quality-of-service level, it is preferred to reduce tile packet delay time. In this paper, we develop an analytical approximation method for deriving mean packet delay times. Using the approximation and simulation methods, we investigate the effect of network parameters on the packet delay time.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• Journal of Mechanical Science and Technology
• /
• v.20 no.8
• /
• pp.1195-1208
• /
• 2006

This paper aims at presenting robustness analysis under the uncertainties of the time delay and plant parameters in symmetrically coupled dynamic systems connected through network having time delay. The delay-involved closed loop characteristic function is mathematically formulated, incorporated with active synchronization control. And the robust stability of the corresponding system is analyzed by investigating the formation of characteristic equation containing second- order terms of uncertainty variables representing delay and plant dynamics mismatches. For the two individual types of uncertainties, we elucidate details of how to compute the bounds and what they imply physically. To support the validity of the mathematical claims, numerical examples and simulations are presented.

• Journal of Advanced Navigation Technology
• /
• v.21 no.5
• /
• pp.472-478
• /
• 2017

In this paper, we deals with optimizing traffic signal timing in grid networks by using a network topology design method. Optimizing traffic signal timing includes minimizing delay time delay between departure and destination by interlocking straight traffic signal in the minimum spanning tree(MST). On the assumption that users of network abide by the paths provided in this paper, this paper shows optimizing traffic signal timing in grid networks. the paths provided in this paper is gathered by using Dijkstra algorithm used in computer networks. The results indicate minimizing delay time of passing through the grid network and interlocking traffic signal in the grid network.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.491-494
• /
• 2006

Kalman filtering (KF) is hard to be applied to the SINS (Strap-down Inertial Navigation System)/RDSS (Radio Determination Satellite Service) integrated navigation system directly because the time delay of RDSS positioning in active mode is random. BP (Back-Propagation) Neuron computing as a powerful technology of Artificial Neural Network (ANN), is appropriate to solve nonlinear problems such as the random time delay of RDSS without prior knowledge about the mathematical process involved. The new algorithm betakes a BP neural network (BPNN) and velocity feedback to aid KF in order to overcome the time delay of RDSS positioning. Once the BP neural network was trained and converged, the new approach will work well for SINS/RDSS integrated navigation. Dynamic vehicle experiments were performed to evaluate the performance of the system. The experiment results demonstrate that the horizontal positioning accuracy of the new approach is 40.62 m (1 ${\sigma}$), which is better than velocity-feedback-based KF. The experimental results also show that the horizontal positioning error of the navigation system is almost linear to the positioning interval of RDSS within 5 minutes. The approach and its anti-jamming analysis will be helpful to the applications of SINS/RDSS integrated systems.