Cart (Loading....) | Create Account
Close category search window

Control Over Noisy Forward and Reverse Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

We consider the problem of remotely controlling a continuous-time linear time-invariant system driven by Brownian motion process, when communication takes place over noisy memoryless discrete- or continuous-alphabet channels. What makes this class of remote control problems different from most of the previously studied models is the presence of noise in both the forward channel (connecting sensors to the controller) and the reverse channel (connecting the controller to the plant). For stability of the closed-loop system, we look for the existence of an invariant distribution for the state, for which we show that it is necessary that the entire control space and the state space be encoded, and that the reverse channel be at least as reliable as the forward channel. We obtain necessary conditions and sufficient conditions on the channels and the controllers for stabilizability. Using properties of the underlying sampled Markov chain, we show that under variable-length coding and some realistic channel conditions, stability can be achieved over discrete-alphabet channels even if the entire state and control spaces are to be encoded and the number of bits that can be transmitted per unit time is strictly bounded. For control over continuous-alphabet channels, however, a variable rate scheme is not necessary. We also show that memoryless policies are rate-efficient for Gaussian channels.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 5 )

Date of Publication:

May 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.