Download - SUPERVISORY CONTROL THEORY
![Page 1: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/1.jpg)
1
SUPERVISORY CONTROL THEORY
MODELS AND METHODS
W.M. WonhamSystems Control Group
ECE DepartmentUniversity of Toronto
Workshop on Discrete-Event Systems Control
Eindhoven 2003.06.24
![Page 2: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/2.jpg)
2
WHAT’S BEEN ACCOMPLISHED?
• Formal control theory
• Basis – simple ideas about control and observation
• Some esthetic appeal
• Amenable to computation
• Admits architectural composition
• Handles real industrial applications
![Page 3: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/3.jpg)
3
WHAT MORE SHOULD BE ACCOMPLISHED?
• Flexibility of model type
• Flexibility of model architecture
• Transparency of model structure (how to view and understand a complex DES?)
• ...
Accepting that most of the interesting problems are exponentially hard!
![Page 4: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/4.jpg)
4
MODEL FLEXIBILITY
For instance
Automata versus Petri nets
batrakhomuomakhia
or
![Page 5: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/5.jpg)
5
![Page 6: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/6.jpg)
6
![Page 7: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/7.jpg)
7
COMPUTATION OF SIMSUP
1. FMS = Sync (M1,M2,R) (20,34)
2. SPEC = Allevents (FMS) (1,8)
3. SUPER(.DES) = Supcon (FMS,SPEC) (15,24)
4. SUPER(.DAT) = Condat (FMS,SUPER)
5. SIMSUP = Supreduce (FMS,SUPER,SUPER) (computes control congruence on SUPER) (4,16)
![Page 8: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/8.jpg)
8
![Page 9: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/9.jpg)
9
![Page 10: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/10.jpg)
10
COMPUTATION OF MONITORS
Based on “theory of regions”
1. Work out reachability graph of PN (20 reachable markings, 15 coreachable)
2. Find the 6 “dangerous markings”
3. Solve the 6 “event/state separation” problems (each a system of 15 linear integer inequalities)
4. Implement the 3 distinct solutions as monitors
![Page 11: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/11.jpg)
11
![Page 12: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/12.jpg)
12
![Page 13: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/13.jpg)
13
![Page 14: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/14.jpg)
14
![Page 15: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/15.jpg)
15
MODEL WITH THE BEST OF BOTH WORLDS ?
Q1 Q2 · · · Qm k l
(Algebraically) hybrid state set
Qi for (an unstructured) automaton component
for a naturally additive component (buffer...)
for a naturally boolean component (switch...)
![Page 16: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/16.jpg)
16
![Page 17: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/17.jpg)
17
WHAT ABOUT LARGE SYSTEMS?
For architecture, need algebraic “laws” for basic objects and operators
_____ DES G nonblocking if Lm(G) = L(G). Suppose G = G1 G2.
_____ ____________
Lm(G) Lm(G1) Lm(G2) (computationally intensive!) _____ _____ =? Lm(G1) Lm(G2) = L(G1) L(G2) = L(G)
E.g. languages, prefix-closure, synchronous product
![Page 18: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/18.jpg)
18
![Page 19: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/19.jpg)
19
TOP-DOWN MODELLING BY STATE TREES
• Adaptation of state charts to supervisory control • Transparent hierarchical representation of complex systems
• Amenable to efficient control computation via BDDs
![Page 20: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/20.jpg)
20
![Page 21: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/21.jpg)
21
![Page 22: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/22.jpg)
22
![Page 23: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/23.jpg)
23
![Page 24: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/24.jpg)
24
![Page 25: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/25.jpg)
25
![Page 26: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/26.jpg)
26
AIP CONTROL SPECIFICATIONS
• Normal production sequencing
Type1 workpiece: I/O AS1 AS2 I/O Type2 workpiece: I/O AS2 AS1 I/O
• AS3 backup operation if AS1 or AS2 down
• Conveyor capacity bounds, ...
• Nonblocking
![Page 27: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/27.jpg)
27
AIP COMPUTATION
• Equivalent “flat” model ~ 1024 states, intractable by extensional methods
• BDD controller ~ 7 104 nodes
• Intermediate node count < 21 104
• PC with Athlon cpu, 1GHz, 256 MB RAM
• Computation time ~ 45 min
![Page 28: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/28.jpg)
28
![Page 29: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/29.jpg)
29
![Page 30: SUPERVISORY CONTROL THEORY](https://reader033.vdocument.in/reader033/viewer/2022042511/56813b2a550346895da3ed40/html5/thumbnails/30.jpg)
30
CONCLUSIONS
• Base model flexibility, architectural variations among topics of current importance
• Symbolic computation to play major role
• Other topics: p.o. concurrency models, causality, lattice-theoretic ideas, ...
• There is steady progress
• There is lots to do