Robust Finite Alphabet Control of Dynamic Networks

Details Robust Finite Alphabet Control of Dynamic Networks Robust Finite Alphabet Control of Dynamic Networks

2011-11-03

arxiv.org/abs/1111.0700v1

Mathematics

Optimization and Control

Scientific paper

In this note, we consider dynamic network problems in which the control and disturbance inputs take values in finite sets. We derive a necessary and sufficient condition for the existence of robustly control invariant sets. We show that a stronger version of this condition is sufficient to guarantee robust global attractivity, and we construct a counterexample demonstrating that it is not necessary. We conclude with two simple illustrative examples.

Affiliated with

Also associated with

No associations

Rating

Robust Finite Alphabet Control of Dynamic Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robust Finite Alphabet Control of Dynamic Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Finite Alphabet Control of Dynamic Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-700664