Packet-based Control with Norm Bounded Uncertainties - Revision history

Shiling: /* Additional Resources */

2006-04-29T17:11:22Z

Additional Resources

← Older revision		Revision as of 17:11, 29 April 2006
Line 18:		Line 18:

	== Additional Resources ==		== Additional Resources ==
			* <p>[http://en.wikipedia.org/wiki/Almost_surely Almost Sure in Probability Theory]. This is a pretty good introduction to the notion of "Almost Surely" from wikipedia.</p>

	In case you want to explore more besides these two papers, you can find related papers through our references. And you are welcome to talk to either me or Michael for possible project ideas.		In case you want to explore more besides these two papers, you can find related papers through our references. And you are welcome to talk to either me or Michael for possible project ideas.

	<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->		<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->

Shiling: /* Additional Resources */

2006-04-29T01:06:59Z

Additional Resources

← Older revision		Revision as of 01:06, 29 April 2006
Line 18:		Line 18:

	== Additional Resources ==		== Additional Resources ==
	~~Two papers should be enough reading material for a lecture. Just in~~ case you want to explore more, you can find related papers through our references. And you are welcome to talk to either me or Michael for possible project ideas.		In case you want to explore more besides these two papers, you can find related papers through our references. And you are welcome to talk to either me or Michael for possible project ideas.

	<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->		<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->

Shiling at 01:05, 29 April 2006

2006-04-29T01:05:01Z

← Older revision		Revision as of 01:05, 29 April 2006
Line 2:		Line 2:

	<!-- Enter a 1 paragraph description of the contents of the lecture. Make sure to include any key concepts, so that the wiki search feature will pick them up -->		<!-- Enter a 1 paragraph description of the contents of the lecture. Make sure to include any key concepts, so that the wiki search feature will pick them up -->
	In this lecture, we ~~(to be filled)~~		In this lecture, we study the main issues with a packet-based control system and explore the frequently used models for such systems. In particular, we study the effect of packet drops and finite data rate on the system stability. We shall show that there are tradeoffs between packet drop rate, network data rate and system uncertainty levels for the closed loop system.

	== Lecture Materials ==		== Lecture Materials ==

Shiling: /* Additional Resources */

2006-04-29T01:00:29Z

Additional Resources

← Older revision		Revision as of 01:00, 29 April 2006
Line 18:		Line 18:

	== Additional Resources ==		== Additional Resources ==
			Two papers should be enough reading material for a lecture. Just in case you want to explore more, you can find related papers through our references. And you are welcome to talk to either me or Michael for possible project ideas.

	<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->		<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->

Shiling at 00:46, 29 April 2006

2006-04-29T00:46:16Z

← Older revision		Revision as of 00:46, 29 April 2006
Line 10:		Line 10:

	== Reading ==		== Reading ==
	* <p>[http://~~robotics~~.~~eecs~~.~~berkeley~~.edu/~~~sinopoli~~/~~tacs04~~.pdf ~~Kalman Filtering~~ with ~~Intermittent Observations~~], ~~B. Sinopoli, L. Schenato, M. Franceschetti, K. Poolla~~, M. ~~Jordan and S. Sastry~~. ~~This is the paper where all the proofs reside. Below I posted Chapter 3~~ of ~~my thesis, which is essentially~~ the ~~same, but the notation~~ is ~~more consistent with the next two lectures~~.</p>		* <p>[http://www.cds.caltech.edu/~shiling/acc06final.pdf Networked Control Systems with Norm Bounded Uncertainties: A Stability Analysis], Ling Shi, Michael Epstein and Richard M.Murray. The first half of the lecture is based on this paper.</p>

	* <p>[http://~~robotics~~.~~eecs~~.~~berkeley~~.edu/~~~sinopoli~~/~~NCS_class/optimal_estimation_lossy~~.pdf ~~Optimal Estimation in Lossy Networks~~] ~~This is chapter 3~~ of ~~my thesis. Content~~ is ~~almost the same as the~~ paper ~~above, but notation is slightly modified to be consistent with the control part~~.</p>		* <p>[http://www.cds.caltech.edu/~shiling/mtns06.pdf Towards Robust Control Over a Packet Dropping Network], Ling Shi, Michael Epstein and Richard M.Murray. The second half of the lecture is based on this paper.</p>


Line 18:		Line 18:

	== Additional Resources ==		== Additional Resources ==
	* <p>[http://www.cs.unc.edu/~welch/kalman/ The Kalman Filter], G. Welch and G. Bishop. A webpage with many links on Kalman filter.</p>

	* <p>[http://www.amazon.com/gp/product/0486439380/102-3301256-1504117?v=glance&n=283155 Optimal Filtering], B.D.O Anderson and J.B. Moore. Dover Books on Engineering, 2005. A reissue of a book from 1979. It contains a detailed mathematical presentation of filtering problems and the Kalman filter. A very good book.</p>

	<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->		<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->

Shiling at 00:40, 29 April 2006

2006-04-29T00:40:46Z

← Older revision		Revision as of 00:40, 29 April 2006
Line 7:		Line 7:
	<!-- Include links to materials that you used in your lecture. At a minimum, this should include a link to your lecture presentation. You might also include links to MATLAB scripts or other source code that students would find useful -->		<!-- Include links to materials that you used in your lecture. At a minimum, this should include a link to your lecture presentation. You might also include links to MATLAB scripts or other source code that students would find useful -->
	<!-- Sample lecture link: * [[Media:L1-1_Intro.pdf\|Lecture: Networked Control Systems: Course Overview]] -->		<!-- Sample lecture link: * [[Media:L1-1_Intro.pdf\|Lecture: Networked Control Systems: Course Overview]] -->
	* [[Media:270_2 Lecture_Ling.pdf \|Lecture: Packet-based Estimation II ]]		* [[Media:270_2 Lecture_Ling.pdf \|Lecture: Packet-based Estimation and Control II ]]

	== Reading ==		== Reading ==

Shiling at 00:39, 29 April 2006

2006-04-29T00:39:47Z

← Older revision		Revision as of 00:39, 29 April 2006
Line 7:		Line 7:
	<!-- Include links to materials that you used in your lecture. At a minimum, this should include a link to your lecture presentation. You might also include links to MATLAB scripts or other source code that students would find useful -->		<!-- Include links to materials that you used in your lecture. At a minimum, this should include a link to your lecture presentation. You might also include links to MATLAB scripts or other source code that students would find useful -->
	<!-- Sample lecture link: * [[Media:L1-1_Intro.pdf\|Lecture: Networked Control Systems: Course Overview]] -->		<!-- Sample lecture link: * [[Media:L1-1_Intro.pdf\|Lecture: Networked Control Systems: Course Overview]] -->
	* [[Media:~~L5-1_packet_based_estimation~~.pdf \|Lecture: Packet-based Estimation]]		* [[Media:270_2 Lecture_Ling.pdf \|Lecture: Packet-based Estimation II ]]

	== Reading ==		== Reading ==

Shiling at 00:34, 29 April 2006

2006-04-29T00:34:27Z

← Older revision		Revision as of 00:34, 29 April 2006
Line 2:		Line 2:

	<!-- Enter a 1 paragraph description of the contents of the lecture. Make sure to include any key concepts, so that the wiki search feature will pick them up -->		<!-- Enter a 1 paragraph description of the contents of the lecture. Make sure to include any key concepts, so that the wiki search feature will pick them up -->
	In this lecture, we ~~study the effect of data loss on the performance of the Kalman filter for discrete-time linear systems. Observations are lost according~~ to ~~a bernoulli independent process, modeling this way the presence of a lossy networks between the sensors and the estimator. We first prove that the Kalman filter is still optimal in this new scenario.~~		In this lecture, we (to be filled)
	We then provide asymptotic results on the performance of the filter. In particular, we show that a transition from boundedness to instability arises if the arrival probability is lower that a critical value, that depends on the unstable eigenvalues of the system.

	== Lecture Materials ==		== Lecture Materials ==

Shiling at 00:33, 29 April 2006

2006-04-29T00:33:29Z

New page

{{cds270-2 header}} 


In this lecture, we study the effect of data loss on the performance of the Kalman filter for discrete-time linear systems. Observations are lost according to a bernoulli independent process, modeling this way the presence of a lossy networks between the sensors and the estimator. We first prove that the Kalman filter is still optimal in this new scenario.
We then provide asymptotic results on the performance of the filter. In particular, we show that a transition from boundedness to instability arises if the arrival probability is lower that a critical value, that depends on the unstable eigenvalues of the system.

== Lecture Materials ==


* [[Media:L5-1_packet_based_estimation.pdf |Lecture: Packet-based Estimation]]

== Reading ==
* [http://robotics.eecs.berkeley.edu/~sinopoli/tacs04.pdf Kalman Filtering with Intermittent Observations], B. Sinopoli, L. Schenato, M. Franceschetti, K. Poolla, M. Jordan and S. Sastry. This is the paper where all the proofs reside. Below I posted Chapter 3 of my thesis, which is essentially the same, but the notation is more consistent with the next two lectures.

* [http://robotics.eecs.berkeley.edu/~sinopoli/NCS_class/optimal_estimation_lossy.pdf Optimal Estimation in Lossy Networks] This is chapter 3 of my thesis. Content is almost the same as the paper above, but notation is slightly modified to be consistent with the control part.



== Additional Resources ==
* [http://www.cs.unc.edu/~welch/kalman/ The Kalman Filter], G. Welch and G. Bishop. A webpage with many links on Kalman filter.

* [http://www.amazon.com/gp/product/0486439380/102-3301256-1504117?v=glance&n=283155 Optimal Filtering], B.D.O Anderson and J.B. Moore. Dover Books on Engineering, 2005. A reissue of a book from 1979. It contains a detailed mathematical presentation of filtering problems and the Kalman filter. A very good book.