EECI08: Distributed Protocols and CCL: Difference between revisions
From Murray Wiki
Jump to navigationJump to search
| Line 9: | Line 9: | ||
== Further Reading == | == Further Reading == | ||
* <p>E. Klavins, “A Computation and Control Language for Multi-Vehicle Systems”, Int’l Conference on Robotics and Automation, 2004. </p> | * <p>E. Klavins, “A Computation and Control Language for Multi-Vehicle Systems”, Int’l Conference on Robotics and Automation, 2004. </p> | ||
* <p>E. Klavins and R. M. Murray, “Distributed Computation for Cooperative Control”, ''IEEE | * <p>E. Klavins and R. M. Murray, “Distributed Computation for Cooperative Control”, ''IEEE Pervasive Computing'', 2004. </p> | ||
Pervasive Computing'', 2004. </p> | |||
Revision as of 01:09, 29 March 2008
| Prev: Formation Control | Course home | Next: Lattice Theory |
This lecture introduces the use of protocols and temporal logic for reasoning about logical computations in cooperative control. We focus on a specific example of a language for control of cooperative systems called CCL (Computation and Control Language). We use CCL to demonstrate how to prove stability for distributed protocols.
Lecture Materials
- Lecture slides: Distributed Computation for Cooperative Control
Further Reading
E. Klavins, “A Computation and Control Language for Multi-Vehicle Systems”, Int’l Conference on Robotics and Automation, 2004.
E. Klavins and R. M. Murray, “Distributed Computation for Cooperative Control”, IEEE Pervasive Computing, 2004.
