Real-time scheduling method for networked discrete control systems

https://doi.org/10.1016/j.conengprac.2008.10.006Get rights and content

Abstract

This paper proposes a new scheduling method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems. The proposed method is formulated in terms of linear matrix inequalities (LMI) and can give a much less conservative delay bound than the existing methods. An event based network scheduling method is presented based on the delay bound obtained through the proposed method, and it can adjust the sampling period to allocate identical utilization to each control loop. The presented method can handle sporadic emergency data, periodic data, and non-real-time data.

Introduction

In distributed control systems (DCSs), a feedback control loop is closed through a network. The DCSs with networks are called networked control systems (NCSs). In an NCS, various delays occur due to sharing a common network medium, which are called network-induced delays (Asok and Yoram, 1988, Krtolica et al., 1994). Network-induced delays can vary widely according to the transmission time of messages and the overhead time. The performance of the control system is assumed to be affected by network-induced parameters such as delays, jitters, packet losses and link failures (Vatanski, Georges, Aubrun, Rondeau, & Jamsa-Jounela, 2008). The network in the NCS should handle three types of data: sporadic emergency data, periodic data, and non-real-time message. The transmission time through the media is largely dependent on the network protocols, especially data link layer protocols of networks and data length. Hence, it is necessary to present the methods to make these network-induced delays bounded and smaller, which are called network scheduling methods for the NCS.

In general, a faster sampling rate is said to be desirable in sampled-data systems so the discrete-time control design and performance can approximate that of the continuous-time system. But in NCSs, a faster sampling rate bound can increase network load, which in turn results in longer delay of the signals. Thus finding a sampling rate that can both tolerate the network-induced delay and achieve desired system performance is important in NCS design. This certain bound is called a maximum allowable delay bound (MADB) of the NCS.

Therefore, it is necessary to find the MADB for stability of the NCS, and then to find an appropriate network scheduling method that limits the network-induced delay to less than the MADB. A network scheduling method is required to reduce network-induced delays within the MADBs, while guaranteeing real-time transmission of sporadic, periodic data, and minimizing network utilization for non-real-time message.

The MADB has been obtained from stability conditions of control systems. There have been some results on the stability of NCSs (Lian et al., 2002, Yoram and Asok, 1988). Less conservative results on the MADB in non-NCSs are reported in Li and de Souza, 1997a, Li and de Souza, 1997b and Park (1999). In these papers, the MADB is obtained using the Ricatti equation approach, which yields conservative delay bounds. A scheduling method was presented in the NCS with Fieldbus networks (Beauvais and Deplanche, 1995, Cavalieri et al., 1995). But those papers did not consider the MADB, which were important in control applications.

There have been some studies on scheduling algorithms that can be applied to the NCS (Hong, 1995, Raja et al., 1993, Walsh et al., 1999, Zhang et al., 2001). A dynamic scheduling algorithm modified from the rate monotone scheduling algorithms was presented for periodic and sporadic data in Fieldbus networks (Raja et al., 1993). A heuristic algorithm was presented for periodic tasks only (Beauvais & Deplanche, 1995), but it did not support sporadic data. The several algorithms for dynamically scheduling of NCSs were proposed (Hong and Walsh, 2001, Zuberi and Shin, 1997). It had limitations when applied to the NCS because it did not consider some characteristics of the NCS, such as the MADB and sampling periods. A scheduling algorithm that can allocate the bandwidth of a network and determine sensor data sampling periods was presented by Hong (1995). In Hong (1995), the control system had only single input and single output (SISO), only periodic data were considered, and the MADB was not obtained analytically.

A network scheduling method considering three types of data based on a multi-input and multi-output (MIMO) system was proposed by Park, Kim, Kim, and Kwon (2002). In this paper, the estimation of MADB using the Ricatti equation is too conservative, which means the estimated MADB is too small and the network scheduling method discussed is somewhat heuristic.

In Branicky, Phillips, and Zhang (2000) and Walsh and Hong (2001), calculation methods of MADBs and stability analysis of NCSs were presented. However, these results were conservative to be of practical use and still remains to be improved. Further research is needed with regard to estimation of a less conservative MADB for stability of the NCS and systematic scheduling methods for three types of data.

In Kim, Lee, Kwon, and Park (2003), a calculation method of MADBs of NCS based on continuous-time was presented in terms of linear matrix inequalities (LMI). This method gave a much less conservative delay bound than previous methods. However, a calculation method of MADBs based on continuous model and a scheduling method for three types of data remain to be improved.

This paper proposes a method to obtain the MADB guaranteeing a stability of the discrete-time NCS. Using obtained MADBs, sampling period decision and bandwidth allocation method are presented. A proposed scheduling method can adjust the sampling period to allocate the same utilization to each control loop. It can handle three types of data and guarantees real-time transmission of sporadic emergency and periodic data. It is modified earliest deadline first (EDF) scheduling method which give priority to sporadic emergency data.

This paper is organized as follows. In the following section, an discrete-time NCS model is described. The MADB for the stability of the NCS is derived by LMI formulation. In Section 3, a network scheduling method that allocates the bandwidth and determines the sampling period for the NCS is presented. In Section 4, simulation results are given to show that method is useful. Finally, the conclusions are presented in Section 5.

Section snippets

MADB for stability in a control loop

In general, NCSs can be described as Fig. 1 (Nilson, 1998, Nilson et al., 1998). A networked control loop is composed of a controller, sensors, and actuators through a common communication medium.

In Fig. 2 (Kim et al., 2003), the timing diagram illustrates the process output and sampling instants, the signal into the controller node, the signal into the actuator node and the network-induced delay.

The MADB is defined as the maximum allowable interval from the instant when sensor nodes sample

Event-based scheduling algorithm

This section describes an event-based network scheduling method using the MADB. The modified EDF algorithm is proposed to guarantee real-time transmission of sporadic emergency data. The modified EDF algorithm is that the sporadic data have a high priority than real-time periodic data. In general, a real-time periodic data has a priority higher than non-real-time data. Hence, real-time periodic data is scheduled by EDF algorithm using MADB of each loop as a deadline. After the end of

Simulation

For the simulation, a plant with three DC motors is considered. Each motor has an armature position controller with two sensors and one actuator, which are linked via the network. If the armature inductance (La) and viscous frictional coefficient (Bm) are negligible, the motor dynamics becomes (Park et al., 2002)xp(k+1)=Fpxp(k)+Gpup(k)=-KiKb/RaJ010xp(k)+Ki/RaJ0up(k),yp(k)=xp(k),where xp(k)=[ωθ]T, up(k) is applied voltage (V), and ω and θ are, respectively, the rotor angular velocity (rad/s) and

Conclusion

In this paper, the MADBs are obtained for the stability of the discrete-NCS using LMI formulation, and are used as the basic parameter for an event-based scheduling method for the NCS. The scheduling method for the NCS can schedule efficiently to guarantee real-time transmission for sporadic data. The presented sampling period decision algorithm is useful, as it provides a fair channel utilization to loops, and calculates sampling period easily. The modified EDF algorithm schedules sporadic

Acknowledgments

This work was supported by the Korea Research Foundation grant funded by the Korean government under Grant No. KRF-2007-D-00150, Korea. The authors thank the editor and anonymous reviewers for their time and efforts.

References (24)

  • D.S. Kim et al.

    Maximum allowable delay bounds of networked control system

    Control Engineering Practice

    (2003)
  • X. Li et al.

    Criteria for robust stability and stabilization of uncertain linear systems with state delays

    Automatica

    (1997)
  • R. Asok et al.

    Integrated communication and control systems: Part II—design consideration

    Journal of Dynamic Systems, Measurement, and Control

    (1988)
  • Beauvais, J. P., & Deplanche, A.-M. (1995). Heuristics for scheduling periodic complex real-time tasks in a distributed...
  • Branicky, M. S., Phillips, S. R., & Zhang, W. (2000). Stability of networked control systems: Explicit analysis of...
  • S. Cavalieri et al.

    Pre-run-time scheduling to reduce schedule length in the fieldbus environment

    IEEE Transactions on Software Engineering

    (1995)
  • S.H. Hong

    Scheduling algorithm of data sampling times in the integrated communication and control systems

    IEEE Transactions on Control Systems Technology

    (1995)
  • Y. Hong et al.

    Real-time mixed-traffic wireless networks

    IEEE Transactions on Industrial Electronics

    (2001)
  • R. Krtolica et al.

    Stability of linear feedback systems with random communication delays

    International Journal of Control

    (1994)
  • X. Li et al.

    Delay-dependent robust stability and stabilization of uncertain linear delay systems: A linear matrix inequality approach

    IEEE Transactions on Automatic Control

    (1997)
  • F.-L. Lian et al.

    Network design consideration for distributed control systems

    IEEE Transactions on Control Systems Technology

    (2002)
  • Lorenz, P., & Mammeri, Z. (1995). Real-time software architecture: Application to FIP fieldbus. In Proceedings of AARTC...
  • Cited by (47)

    • Real-time message scheduling for ISA100.11a networks

      2015, Computer Standards and Interfaces
      Citation Excerpt :

      In addition, ISA100.11a also uses the CSMA-CA mechanism used by the original IEEE 802.15.4 standard for contending transmissions. In ISA100.11a, as well as networked systems in general, real-time scheduling is one of the most important tasks [11,12]. In Ref. [5], the authors described a scheduling method of wireless control networks using IEEE 802.15.4 networks.

    • H<inf>∞</inf> fault detection for nonlinear networked systems with multiple channels data transmission pattern

      2013, Information Sciences
      Citation Excerpt :

      For networked systems, at each sampling time k, due to the bandwidth constraint of the wireless/wire network, only some of these sensors or packets signal can be transmitted successfully. In this note, if we regard every sensors or packets as one information channel, then multi-input and multi-output [9], medium access constraint [5,10,13] and multiple packets transmission [6,16,23] can be described validly by multiple channels transmission framework. On the other hand, modeling is one of the most important issues in networked control systems which has received an ever increasing research attention [4–10,14,16,23,24].

    View all citing articles on Scopus
    View full text