Decentralized event‐triggered control of networked interconnected systems under round‐robin protocol: A noncooperative case

Abstract This paper investigates the noncooperative decentralized event‐triggered control problems for networked interconnected systems. To decrease the transmission burden of the S/C (sensor/controller) network, the Round‐Robin protocol (RRP) is introduced to schedule which sensor occupies the S/C network and transmits its information to the controller at each sampling instant. On the other hand, to relieve the transmission frequency of the C/A (controller/actuator) network, the event‐triggered (ET) mechanism is adopted in the C/A network so that the control signal is transmitted to the actuator only when the predefined ET condition is satisfied. The introduction of the RRP and ET strategy helps to save the network bandwidth and energy. However, due to the presence of RRP and ET strategy, it is difficult to obtain the accurate value of each subsystem's cost function. As an alternative, this paper provides a certain upper bound for every individual cost function for each subsystem. By using the method of completing the square, noncooperative decentralized controller gains are designed to minimize the derived upper bound at each instant. At the end of this paper, a numerical example is presented to verify the usefulness of the derived results.