个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职:Vice Dean of School of Control Science and Engineering
性别:男
毕业院校:大连理工大学
学位:博士
所在单位:控制科学与工程学院
学科:模式识别与智能系统. 控制理论与控制工程. 导航、制导与控制. 人工智能
办公地点:大连理工大学 创新园大厦 A611室
联系方式:办公电话:0411-84707581
电子邮箱:zhuang@dlut.edu.cn
Transmission power allocation of NCSs with Markov channel assignment
点击次数:
论文类型:期刊论文
发表时间:2017-06-01
发表刊物:JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
收录刊物:SCIE、EI、Scopus
卷号:354
期号:9
页面范围:3885-3905
ISSN号:0016-0032
摘要:This paper investigates networked control systems (NCSs) where the sensors communicate with the remote controller via a wireless fading channel. Each time the channel can accommodate just one sensor for communication and the access to the channel of the sensors is driven by a random event. When a sensor is triggered to send its measurement, it can choose to use a high power or a low power to save energy. The power level of the sensor determines the probability of successful packet reception at the controller. This paper aims to find an appropriate transmission power allocation method for the sensors jointly with a system controller so that the NCS is stabilized with a given energy budget. By introducing a Markov chain model for the medium-access constraint and modeling the packet dropout as a Bernoulli process, we derive a new model and stability conditions for the NCSs, which are given in terms of the transition probabilities of the Markov chain and different packet reception rates. An interesting power scheduling policy is obtained and two kinds of controller design schemes are given depending on whether the medium-access status of the sensors is acknowledged to the controller or not. The results are then extended to the case of large-scale systems and an optimal co-design methodology which can stabilize the whole set of systems with largest stability margin is proposed. The effectiveness of the presented method is demonstrated by numerical simulations. (C) 2016 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.