Abstract

This paper is concerned with an optimal control framework for networked control systems in which the channel access of actuators is governed by a group random access protocol. The system is modeled as a switching Markov jump system with multiple modes according to channel-access status of the actuators, and an independent identical distribution Bernoulli process is used to describe the random packet dropouts of the channel. Then, an optimal control design methodology is addressed to satisfy the quadratic cost function by applying the well-developed theory for jump linear systems and stochastic optimal control while guaranteeing the mean-square exponential stability of networked control systems. And, finally, a numerical example is exploited to demonstrate the effectiveness of the proposed method.

Highlights

  • Control systems whose components are connected via a real-time communication network are called networked control systems (NCSs)

  • This paper is concerned with an optimal control framework for NCSs in which the channel access of actuators is controlled by a Markov group random access protocol

  • Compared with [26], this paper considers a more complicated and challenging situation in which the actuators share multiple but insufficient channels according to a group random access protocol

Read more

Summary

Introduction

Control systems whose components (e.g., sensors, actuators, and controllers) are connected via a real-time communication network are called networked control systems (NCSs). This paper is concerned with another interesting problem frequently encountered in NCSs, which is termed medium access constraint This issue arises when an NCS has a large number of nodes (sensors/actuators or subsystems) while the network has insufficient channels to accommodate them at a time. The scheduling strategy presented in [18] is of special interest because it gives an optimal control solution to address the medium access constraint problem, aside from providing a special type of hybrid static-dynamic access protocol. This paper is concerned with an optimal control framework for NCSs in which the channel access of actuators is controlled by a Markov group random access protocol. Compared with [26], this paper considers a more complicated and challenging situation in which the actuators share multiple but insufficient channels according to a group random access protocol.

Problem Formulation
Control Synthesis with Markov Actuator Assignment and Packet Dropouts
Numerical Example
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call