-
Notifications
You must be signed in to change notification settings - Fork 209
/
MAIN.m
198 lines (146 loc) · 6.73 KB
/
MAIN.m
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
% MAIN - Pendulum
%
% Demonstrates simple swing-up for a single pendulum with a torque motor.
% This is an easy problem, used for demonstrating how to use analytic
% gradients with optimTraj.
%
clc; clear;
addpath ../../
% Physical parameters of the pendulum
p.k = 1; % Normalized gravity constant
p.c = 0.1; % Normalized damping constant
% User-defined dynamics and objective functions
problem.func.dynamics = @(t,x,u)( dynamics(x,u,p) );
problem.func.pathObj = @(t,x,u)( pathObjective(u) );
% Problem bounds
problem.bounds.initialTime.low = 0;
problem.bounds.initialTime.upp = 0;
problem.bounds.finalTime.low = 0.5;
problem.bounds.finalTime.upp = 2.5;
problem.bounds.state.low = [-2*pi; -inf];
problem.bounds.state.upp = [2*pi; inf];
problem.bounds.initialState.low = [0;0];
problem.bounds.initialState.upp = [0;0];
problem.bounds.finalState.low = [pi;0];
problem.bounds.finalState.upp = [pi;0];
problem.bounds.control.low = -5; %-inf;
problem.bounds.control.upp = 5; %inf;
% Guess at the initial trajectory
problem.guess.time = [0,1];
problem.guess.state = [0, pi; pi, pi];
problem.guess.control = [0, 0];
%%%% Switch between a variety of methods
% method = 'trapezoid';
method = 'trapGrad';
% method = 'hermiteSimpson';
% method = 'hermiteSimpsonGrad';
% method = 'chebyshev';
% method = 'rungeKutta';
% method = 'rungeKuttaGrad';
% method = 'gpops';
%%%% Method-independent options:
problem.options(1).nlpOpt = optimset(...
'Display','iter',... % {'iter','final','off'}
'TolFun',1e-3,...
'MaxFunEvals',1e4); %options for fmincon
problem.options(2).nlpOpt = optimset(...
'Display','iter',... % {'iter','final','off'}
'TolFun',1e-6,...
'MaxFunEvals',5e4); %options for fmincon
switch method
case 'trapezoid'
problem.options(1).method = 'trapezoid'; % Select the transcription method
problem.options(1).trapezoid.nGrid = 10; %method-specific options
problem.options(2).method = 'trapezoid'; % Select the transcription method
problem.options(2).trapezoid.nGrid = 25; %method-specific options
case 'trapGrad' %trapezoid with analytic gradients
problem.options(1).method = 'trapezoid'; % Select the transcription method
problem.options(1).trapezoid.nGrid = 10; %method-specific options
problem.options(1).nlpOpt.GradConstr = 'on';
problem.options(1).nlpOpt.GradObj = 'on';
problem.options(1).nlpOpt.DerivativeCheck = 'off';
problem.options(2).method = 'trapezoid'; % Select the transcription method
problem.options(2).trapezoid.nGrid = 45; %method-specific options
problem.options(2).nlpOpt.GradConstr = 'on';
problem.options(2).nlpOpt.GradObj = 'on';
case 'hermiteSimpson'
% First iteration: get a more reasonable guess
problem.options(1).method = 'hermiteSimpson'; % Select the transcription method
problem.options(1).hermiteSimpson.nSegment = 6; %method-specific options
% Second iteration: refine guess to get precise soln
problem.options(2).method = 'hermiteSimpson'; % Select the transcription method
problem.options(2).hermiteSimpson.nSegment = 15; %method-specific options
case 'hermiteSimpsonGrad' %hermite simpson with analytic gradients
problem.options(1).method = 'hermiteSimpson'; % Select the transcription method
problem.options(1).hermiteSimpson.nSegment = 6; %method-specific options
problem.options(1).nlpOpt.GradConstr = 'on';
problem.options(1).nlpOpt.GradObj = 'on';
problem.options(1).nlpOpt.DerivativeCheck = 'off';
problem.options(2).method = 'hermiteSimpson'; % Select the transcription method
problem.options(2).hermiteSimpson.nSegment = 15; %method-specific options
problem.options(2).nlpOpt.GradConstr = 'on';
problem.options(2).nlpOpt.GradObj = 'on';
case 'chebyshev'
% First iteration: get a more reasonable guess
problem.options(1).method = 'chebyshev'; % Select the transcription method
problem.options(1).chebyshev.nColPts = 9; %method-specific options
% Second iteration: refine guess to get precise soln
problem.options(2).method = 'chebyshev'; % Select the transcription method
problem.options(2).chebyshev.nColPts = 15; %method-specific options
case 'multiCheb'
% First iteration: get a more reasonable guess
problem.options(1).method = 'multiCheb'; % Select the transcription method
problem.options(1).multiCheb.nColPts = 6; %method-specific options
problem.options(1).multiCheb.nSegment = 4; %method-specific options
% Second iteration: refine guess to get precise soln
problem.options(2).method = 'multiCheb'; % Select the transcription method
problem.options(2).multiCheb.nColPts = 9; %method-specific options
problem.options(2).multiCheb.nSegment = 4; %method-specific options
case 'rungeKutta'
problem.options(1).method = 'rungeKutta'; % Select the transcription method
problem.options(1).defaultAccuracy = 'low';
problem.options(2).method = 'rungeKutta'; % Select the transcription method
problem.options(2).defaultAccuracy = 'medium';
case 'rungeKuttaGrad'
problem.options(1).method = 'rungeKutta'; % Select the transcription method
problem.options(1).defaultAccuracy = 'low';
problem.options(1).nlpOpt.GradConstr = 'on';
problem.options(1).nlpOpt.GradObj = 'on';
problem.options(1).nlpOpt.DerivativeCheck = 'off';
problem.options(2).method = 'rungeKutta'; % Select the transcription method
problem.options(2).defaultAccuracy = 'medium';
problem.options(2).nlpOpt.GradConstr = 'on';
problem.options(2).nlpOpt.GradObj = 'on';
case 'gpops'
problem.options = [];
problem.options.method = 'gpops';
problem.options.defaultAccuracy = 'high';
problem.options.gpops.nlp.solver = 'snopt'; %Set to 'ipopt' if you have GPOPS but not SNOPT
otherwise
error('Invalid method!');
end
% Solve the problem
soln = optimTraj(problem);
t = soln(end).grid.time;
q = soln(end).grid.state(1,:);
dq = soln(end).grid.state(2,:);
u = soln(end).grid.control;
% Plot the solution:
figure(1); clf;
subplot(3,1,1)
plot(t,q)
ylabel('q')
title('Single Pendulum Swing-Up');
subplot(3,1,2)
plot(t,dq)
ylabel('dq')
subplot(3,1,3)
plot(t,u)
ylabel('u')
% Plot the sparsity pattern
if isfield(soln(1).info,'sparsityPattern')
figure(3); clf;
spy(soln(1).info.sparsityPattern.equalityConstraint);
axis equal
title('Sparsity pattern in equality constraints')
end