Issues in Optimal Control of Dynamic DESs

Download Report

Transcript Issues in Optimal Control of Dynamic DESs

Issues in Optimal Control of
Dynamic DESs
Lenko Grigorov and Karen Rudie
Queen’s University
Kingston, Canada
Dynamic
Discrete-Event Systems
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
2
Dynamic
Discrete-Event Systems
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
3
Dynamic
Discrete-Event Systems
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
4
Dynamic
Discrete-Event Systems
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
5
Online Control
Online Controller
Control
options
Events
Discrete-Event System
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
6
Look-ahead tree
5
2
1
6
3
4
July, 2005
7
controllable
uncontrollable
8
Lenko Grigorov and Karen Rudie,
Queen's University
7
Simple Optimal Algorithm


1
2
6
3
4
July, 2005
5
7
8
Value: v(x)
v(5)= v+v
v(2)=max(v(5),v(6))
v(3)=max(v(7),v(8))
v(1)=min(v(3),v(4))
Lenko Grigorov and Karen Rudie,
Queen's University
8
Issues with Optimal Control


Insufficient information vs.
Overspecialization
Long-term planning vs. Greediness
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
9
Example system
Small truck, 10 logs
Big truck, 10 or 20 logs
Photo courtesy of Daniel Janzen
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
Photo by Patrick Higgins
10
Values of events
v(goS)
v(goB)
v(fetch10)
v(fetch20)
July, 2005
= -100
= -150
= 500
= 1000
Lenko Grigorov and Karen Rudie,
Queen's University
11
Specifications

Different number and types of trucks
available.

We can rent only one truck at a time.

We need 40 logs.
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
12
Insufficient information
Depth = 1
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
13
Overspecialization
Time 0
Depth = 4
Future
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
14
Overspecialization



Real situation:
T0:
T2:
T4:
Algorithmic solution (v=1600):
T0:
T2:
T4:
Best solution (v=1650):
T0:
T2:
T4:
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
15
Long-term planning vs.
Greediness
Depth = 3
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
16
Discussion

Optimal control for static systems is
not suitable for dynamic systems


July, 2005
Less emphasis on strings far in
the future
Greedy approach
Lenko Grigorov and Karen Rudie,
Queen's University
17
Current research

Online control with normalization
Loss of optimality
Tree depth
July, 2005
Speedup
Tree depth
Lenko Grigorov and Karen Rudie,
Queen's University
18
Queen’s University
July, 2005
Lenko Grigorov and Karen Rudie,
Queen's University
19