Professional Documents
Culture Documents
Trabalho Final Apresentacao
Trabalho Final Apresentacao
2. Problem Statement
4. Conclusions
• Three degrees of
freedom.
• Two actuated wheels.
• Nonlinear Model.
• Linearization through
a desired trajectory
(Time-Varying Linear
Model)
∑{
N−1 }
min J = x̃a (K)′ Qˆ
ˆ ˆ ′ Rũ(K)
x̃a (K) + ũ(K) ˆ x̃a (N)′ Lˆ
+ˆ x̃a (N)
û
K=1
subject to:
b
x = Pû + Gx̃a (K),
bmin ≤ u
u b≤u
bmax ,
b
xmin ≤ b
x≤b
xmax .
For ωr = 0,
min J = α1 J1 + α2 J2
b
u
subject to:
b
xi = P(Ai )û + Gx̃a (K), ∀i = 1, 2,
bmin ≤ u
u b≤u
bmax ,
b
xmin ≤ b
xi ≤ b
xmax , ∀i = 1, 2.
Epsilon
Dominance
Algorithm
Distance α1 α2 Distance α1 α2
0.3965 0.13 0.87 0.4661 0.58 0.42
0.3156 0.22 0.78 0.4952 0.86 0.14
0.4622 0.30 0.70 0.5585 0.97 0.03
0.4604 0.50 0.50 0.5134 0.71 0.29
0.5204 0.71 0.29 0.4652 0.49 0.51
0.5318 0.84 0.16 0.4474 0.28 0.72
0.5164 0.61 0.39 0.3158 0.22 0.78
0.4920 0.44 0.56 0.3965 0.13 0.87
0.4216 0.27 0.73 0.3156 0.22 0.78
0.3166 0.22 0.78 0.4622 0.30 0.70
0.3964 0.13 0.87 0.4604 0.50 0.50
0.3157 0.22 0.78 0.5204 0.71 0.29
0.4759 0.37 0.63 - - -
Objective
To define preferences based on directed graphs.
∑
3
Pj (ai , ak ) = G[cj (ai ) − cj (ak )], wj Pj (ai , ak )
0, if x ≤ 0 P(ai , ak ) =
j=1
,
G(x) = x/p, if 0 < x ≤ p ∑
3
1, wj
if x > p, j=1
p ≜ max{cj (a)} − min{cj (a)}. ϕ(ai ) ≜ ϕ+ (ai ) − ϕ− (ai ).