-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
588 lines (492 loc) · 26.3 KB
/
main.py
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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
import pydrake
import matplotlib.pyplot as plt
import numpy as np
import copy
import control
from pydrake.all import DiagramBuilder, LinearQuadraticRegulator, Simulator, plot_system_graphviz
from pydrake.all import (MultibodyPlant, Parser, DiagramBuilder,
PlanarSceneGraphVisualizer, SceneGraph, TrajectorySource,
SnoptSolver, MultibodyPositionToGeometryPose, PiecewisePolynomial, GetInfeasibleConstraints,
MathematicalProgram, JacobianWrtVariable, eq, le, ge, gt, lt, IpoptSolver, DirectCollocation, AddDirectCollocationConstraint, DirectCollocationConstraint,
InputPortIndex, Demultiplexer, Adder, Gain, FirstOrderTaylorApproximation)
from pydrake.autodiffutils import autoDiffToValueMatrix
from quadrotor2d import Quadrotor2D
from ball2d import Ball2D
from visualization import Visualizer
from ltv_controller import LTVController
from collisions import CalcClosestDistanceQuadBall, CalcPostCollisionStateQuadBall, CalcPostCollisionStateBallQuad, CalcPostCollisionStateQuadBallResidual, CalcPostCollisionStateBallQuadResidual
import matplotlib.animation as animation
n_quadrotors = 2
n_balls = 2
Q = np.diag([100000, 100000, 100000, 10000, 10000, 10000*(0.25 / 2. / np.pi)])
R = np.array([[0.1, 0.05], [0.05, 0.1]])
def QuadrotorLQR(plant):
context = plant.CreateDefaultContext()
context.SetContinuousState(np.zeros([6, 1]))
context.SetContinuousState(np.array([0.0, 0.0, 0.0, 0.0, 0.0, 0.0]))
context.FixInputPort(0, plant.mass * plant.gravity / 2. * np.array([1, 1]))
Q = np.diag([100000, 100000, 100000, 10000, 10000, 10000*(plant.length / 2. / np.pi)])
R = np.array([[0.1, 0.05], [0.05, 0.1]])
return LinearQuadraticRegulator(plant, context, Q, R)
def getPosIndices():
# Return state indices corresponding to positions of balls and quads
indices = []
for i in range(n_quadrotors):
base_ind = 6*i
indices.extend([base_ind, base_ind+1, base_ind+2])
for i in range(n_balls):
base_ind = 6*n_quadrotors + 4*i
indices.extend([base_ind, base_ind+1])
return indices
def getVelIndices():
# Return state indices corresponding to velocities of balls and quads
indices = []
for i in range(n_quadrotors):
base_ind = 6*i + 3
indices.extend([base_ind, base_ind+1, base_ind+2])
for i in range(n_balls):
base_ind = 6*n_quadrotors + 4*i + 2
indices.extend([base_ind, base_ind+1])
return indices
def collatePosAndVel(q, qd):
# Collate positions of quads and balls and velocities of quads and balls into a single state representation
# Ordered as [q0, qd0, q1, qd1, q2, qd2, ...] where all quads appear first followed by all balls
# TO DO: Right now, assumes that q and qd are 2-dimensional array. If needed, should expand to 1-d case
assert q.shape == qd.shape, 'Error: dimension mismatch'
x = np.zeros((q.shape[0], 2*q.shape[1]))
for i in range(n_quadrotors):
base_ind_q = 3*i
base_ind_x = 6*i
x[:, base_ind_x:base_ind_x+3] = q[:,base_ind_q:base_ind_q+3]
x[:, base_ind_x+3:base_ind_x+6] = qd[:,base_ind_q:base_ind_q+3]
for i in range(n_balls):
base_ind_q = 3*n_quadrotors + 2*i
base_ind_x = 6*n_quadrotors + 4*i
x[:, base_ind_x:base_ind_x+2] = q[:,base_ind_q:base_ind_q+2]
x[:, base_ind_x+2:base_ind_x+4] = qd[:,base_ind_q:base_ind_q+2]
return x
def makeDiagram(n_quadrotors, n_balls, use_visualizer=False,trajectory_u=None, trajectory_x=None, trajectory_K = None):
builder = DiagramBuilder()
# Setup quadrotor plants and controllers
quadrotor_plants = []
quadrotor_controllers = []
for i in range(n_quadrotors):
new_quad = Quadrotor2D(n_quadrotors=n_quadrotors-1, n_balls=n_balls)
new_quad.set_name('quad_' + str(i))
plant = builder.AddSystem(new_quad)
quadrotor_plants.append(plant)
# Setup ball plants
ball_plants = []
for i in range(n_balls):
new_ball = Ball2D(n_quadrotors=n_quadrotors, n_balls=n_balls-1)
new_ball.set_name('ball_' + str(i))
plant = builder.AddSystem(new_ball)
ball_plants.append(plant)
# Connect all plants so that each object (quadrotor or ball) has access to all other object states as inputs
for i in range(n_quadrotors):
for j in range(n_quadrotors):
if i == j:
continue
k = j if j < i else j-1
builder.Connect(quadrotor_plants[j].get_output_port(0), quadrotor_plants[i].GetInputPort('quad_'+str(k)))
for j in range(n_balls):
builder.Connect(ball_plants[j].get_output_port(0), quadrotor_plants[i].GetInputPort('ball_'+str(j)))
for i in range(n_balls):
for j in range(n_quadrotors):
builder.Connect(quadrotor_plants[j].get_output_port(0), ball_plants[i].GetInputPort('quad_'+str(j)))
for j in range(n_balls):
if i == j:
continue
k = j if j < i else j-1
builder.Connect(ball_plants[j].get_output_port(0), ball_plants[i].GetInputPort('ball_'+str(k)))
# Setup visualization
if use_visualizer:
visualizer = builder.AddSystem(Visualizer(n_quadrotors=n_quadrotors, n_balls=n_balls))
visualizer.set_name('visualizer')
for i in range(n_quadrotors):
builder.Connect(quadrotor_plants[i].get_output_port(0), visualizer.get_input_port(i))
for i in range(n_balls):
builder.Connect(ball_plants[i].get_output_port(0), visualizer.get_input_port(n_quadrotors + i))
# Setup trajectory source
if trajectory_x is not None and trajectory_u is not None and trajectory_K is not None:
demulti_u = builder.AddSystem(Demultiplexer(2*n_quadrotors, 2))
demulti_u.set_name('feedforward input')
demulti_x = builder.AddSystem(Demultiplexer(6*n_quadrotors, 6))
demulti_x.set_name('reference trajectory')
demulti_K = builder.AddSystem(Demultiplexer(12*n_quadrotors, 12))
demulti_K.set_name('time-varying K')
for i in range(n_quadrotors):
ltv_lqr = builder.AddSystem(LTVController(6,2))
ltv_lqr.set_name('LTV LQR ' + str(i))
builder.Connect(demulti_x.get_output_port(i), ltv_lqr.get_input_port(0))
builder.Connect(quadrotor_plants[i].get_output_port(0), ltv_lqr.get_input_port(1))
builder.Connect(demulti_u.get_output_port(i), ltv_lqr.get_input_port(2))
builder.Connect(demulti_K.get_output_port(i), ltv_lqr.get_input_port(3))
builder.Connect(ltv_lqr.get_output_port(0), quadrotor_plants[i].get_input_port(0))
source_u = builder.AddSystem(TrajectorySource(trajectory_u))
source_u.set_name('source feedforward input trajectory')
source_x = builder.AddSystem(TrajectorySource(trajectory_x))
source_x.set_name('source reference trajectory')
demulti_source_x = builder.AddSystem(Demultiplexer([6*n_quadrotors, 4*n_balls]))
demulti_source_x.set_name('quad and ball trajectories')
source_K = builder.AddSystem(TrajectorySource(trajectory_K))
source_K.set_name('source time-varying K')
builder.Connect(source_u.get_output_port(0), demulti_u.get_input_port(0))
builder.Connect(source_x.get_output_port(0), demulti_source_x.get_input_port(0))
builder.Connect(demulti_source_x.get_output_port(0), demulti_x.get_input_port(0))
builder.Connect(source_K.get_output_port(0), demulti_K.get_input_port(0))
else:
demulti_u = builder.AddSystem(Demultiplexer(2*n_quadrotors, 2))
demulti_u.set_name('quadrotor input')
for i in range(n_quadrotors):
builder.Connect(demulti_u.get_output_port(i), quadrotor_plants[i].get_input_port(0))
builder.ExportInput(demulti_u.get_input_port(0))
diagram = builder.Build()
return diagram
def solveOptimization(state_init, t_impact, impact_combination, T, u_guess = None, x_guess = None, h_guess = None):
prog = MathematicalProgram()
h = prog.NewContinuousVariables(T, name='h')
u = prog.NewContinuousVariables(rows=T+1, cols = 2*n_quadrotors, name = 'u')
x = prog.NewContinuousVariables(rows=T+1, cols= 6*n_quadrotors+4*n_balls, name='x')
dv = prog.decision_variables()
prog.AddBoundingBoxConstraint([h_min] * T, [h_max] * T, h)
for i in range(n_quadrotors):
sys = Quadrotor2D()
context = sys.CreateDefaultContext()
dir_coll_constr = DirectCollocationConstraint(sys, context)
ind_x = 6*i
ind_u = 2*i
for t in range(T):
impact_indices = impact_combination[np.argmax(np.abs(t - t_impact)<=1)]
quad_ind, ball_ind = impact_indices[0], impact_indices[1]
if quad_ind == i and np.any(t == t_impact): # Don't add Direct collocation constraint at impact
continue
elif quad_ind == i and (np.any(t == t_impact - 1) or np.any(t == t_impact + 1)):
prog.AddConstraint(eq(x[t+1, ind_x:ind_x+3], x[t, ind_x:ind_x+3] + h[t] * x[t+1, ind_x+3:ind_x+6])) # Backward euler
prog.AddConstraint(eq(x[t+1, ind_x+3:ind_x+6], x[t, ind_x+3:ind_x+6])) # Zero-acceleration assumption during this time step. Should maybe replace with something less naive
else:
AddDirectCollocationConstraint(dir_coll_constr, np.array([[h[t]]]), x[t,ind_x:ind_x+6].reshape(-1,1), x[t+1,ind_x:ind_x+6].reshape(-1,1), u[t,ind_u:ind_u+2].reshape(-1,1), u[t+1,ind_u:ind_u+2].reshape(-1,1), prog)
for i in range(n_balls):
sys = Ball2D()
context = sys.CreateDefaultContext()
dir_coll_constr = DirectCollocationConstraint(sys, context)
ind_x = 6*n_quadrotors+4*i
for t in range(T):
impact_indices = impact_combination[np.argmax(np.abs(t - t_impact)<=1)]
quad_ind, ball_ind = impact_indices[0], impact_indices[1]
if ball_ind == i and np.any(t == t_impact): # Don't add Direct collocation constraint at impact
continue
elif ball_ind == i and (np.any(t == t_impact - 1) or np.any(t == t_impact + 1)):
prog.AddConstraint(eq(x[t+1, ind_x:ind_x+2], x[t, ind_x:ind_x+2] + h[t] * x[t+1, ind_x+2:ind_x+4])) # Backward euler
prog.AddConstraint(eq(x[t+1, ind_x+2:ind_x+4], x[t, ind_x+2:ind_x+4] + h[t] * np.array([0,-9.81])))
else:
AddDirectCollocationConstraint(dir_coll_constr, np.array([[h[t]]]), x[t,ind_x:ind_x+4].reshape(-1,1), x[t+1,ind_x:ind_x+4].reshape(-1,1), u[t,0:0].reshape(-1,1), u[t+1,0:0].reshape(-1,1), prog)
# Initial conditions
prog.AddLinearConstraint(eq(x[0,:], state_init))
# Final conditions
prog.AddLinearConstraint(eq(x[T,0:14], state_final[0:14]))
# Quadrotor final conditions (full state)
for i in range(n_quadrotors):
ind = 6*i
prog.AddLinearConstraint(eq(x[T,ind:ind+6], state_final[ind:ind+6]))
# Ball final conditions (position only)
for i in range(n_balls):
ind = 6*n_quadrotors + 4*i
prog.AddLinearConstraint(eq(x[T,ind:ind+2], state_final[ind:ind+2]))
# Input constraints
for i in range(n_quadrotors):
prog.AddLinearConstraint(ge(u[:,2*i],-20.0))
prog.AddLinearConstraint(le(u[:,2*i], 20.0))
prog.AddLinearConstraint(ge(u[:,2*i+1],-20.0))
prog.AddLinearConstraint(le(u[:,2*i+1], 20.0))
# Don't allow quadrotor to pitch more than 60 degrees
for i in range(n_quadrotors):
prog.AddLinearConstraint(ge(x[:,6*i+2],-np.pi/3))
prog.AddLinearConstraint(le(x[:,6*i+2],np.pi/3))
# Ball position constraints
# for i in range(n_balls):
# ind_i = 6*n_quadrotors + 4*i
# prog.AddLinearConstraint(ge(x[:,ind_i],-2.0))
# prog.AddLinearConstraint(le(x[:,ind_i], 2.0))
# prog.AddLinearConstraint(ge(x[:,ind_i+1],-3.0))
# prog.AddLinearConstraint(le(x[:,ind_i+1], 3.0))
# Impact constraint
quad_temp = Quadrotor2D()
for i in range(n_quadrotors):
for j in range(n_balls):
ind_q = 6*i
ind_b = 6*n_quadrotors + 4*j
for t in range(T):
if np.any(t == t_impact): # If quad i and ball j impact at time t, add impact constraint
impact_indices = impact_combination[np.argmax(t == t_impact)]
quad_ind, ball_ind = impact_indices[0], impact_indices[1]
if quad_ind == i and ball_ind == j:
# At impact, witness function == 0
prog.AddConstraint(lambda a: np.array([CalcClosestDistanceQuadBall(a[0:3], a[3:5])]).reshape(1,1), lb=np.zeros((1,1)), ub=np.zeros((1,1)), vars=np.concatenate((x[t,ind_q:ind_q+3], x[t,ind_b:ind_b+2])).reshape(-1,1))
# At impact, enforce discrete collision update for both ball and quadrotor
prog.AddConstraint(CalcPostCollisionStateQuadBallResidual, lb=np.zeros((6,1)), ub=np.zeros((6,1)), vars=np.concatenate((x[t,ind_q:ind_q+6], x[t,ind_b:ind_b+4], x[t+1, ind_q:ind_q+6])).reshape(-1,1))
prog.AddConstraint(CalcPostCollisionStateBallQuadResidual, lb=np.zeros((4,1)), ub=np.zeros((4,1)), vars=np.concatenate((x[t,ind_q:ind_q+6], x[t,ind_b:ind_b+4], x[t+1, ind_b:ind_b+4])).reshape(-1,1))
# rough constraints to enforce hitting center-ish of paddle
prog.AddLinearConstraint(x[t,ind_q]-x[t,ind_b] >= -0.01)
prog.AddLinearConstraint(x[t,ind_q]-x[t,ind_b] <= 0.01)
continue
# Everywhere else, witness function must be > 0
prog.AddConstraint(lambda a: np.array([CalcClosestDistanceQuadBall(a[ind_q:ind_q+3], a[ind_b:ind_b+2])]).reshape(1,1), lb=np.zeros((1,1)), ub=np.inf*np.ones((1,1)), vars=x[t,:].reshape(-1,1))
# Don't allow quadrotor collisions
# for t in range(T):
# for i in range(n_quadrotors):
# for j in range(i+1, n_quadrotors):
# prog.AddConstraint((x[t,6*i]-x[t,6*j])**2 + (x[t,6*i+1]-x[t,6*j+1])**2 >= 0.65**2)
# Quadrotors stay on their own side
# prog.AddLinearConstraint(ge(x[:, 0], 0.3))
# prog.AddLinearConstraint(le(x[:, 6], -0.3))
###############################################################################
# Set up initial guesses
initial_guess = np.empty(prog.num_vars())
# # initial guess for the time step
prog.SetDecisionVariableValueInVector(h, h_guess, initial_guess)
x_init[0,:] = state_init
prog.SetDecisionVariableValueInVector(x, x_guess, initial_guess)
prog.SetDecisionVariableValueInVector(u, u_guess, initial_guess)
solver = SnoptSolver()
print("Solving...")
result = solver.Solve(prog, initial_guess)
# print(GetInfeasibleConstraints(prog,result))
# be sure that the solution is optimal
assert result.is_success()
print(f'Solution found? {result.is_success()}.')
#################################################################################
# Extract results
# get optimal solution
h_opt = result.GetSolution(h)
x_opt = result.GetSolution(x)
u_opt = result.GetSolution(u)
time_breaks_opt = np.array([sum(h_opt[:t]) for t in range(T+1)])
u_opt_poly = PiecewisePolynomial.ZeroOrderHold(time_breaks_opt, u_opt.T)
# x_opt_poly = PiecewisePolynomial.Cubic(time_breaks_opt, x_opt.T, False)
x_opt_poly = PiecewisePolynomial.FirstOrderHold(time_breaks_opt, x_opt.T) # Switch to first order hold instead of cubic because cubic was taking too long to create
#################################################################################
# Create list of K matrices for time varying LQR
context = quad_plant.CreateDefaultContext()
breaks = copy.copy(time_breaks_opt)#np.linspace(0, x_opt_poly.end_time(), 100)
K_samples = np.zeros((breaks.size, 12*n_quadrotors))
for i in range(n_quadrotors):
K = None
for j in range(breaks.size):
context.SetContinuousState(x_opt_poly.value(breaks[j])[6*i:6*(i+1)])
context.FixInputPort(0,u_opt_poly.value(breaks[j])[2*i:2*(i+1)])
linear_system = FirstOrderTaylorApproximation(quad_plant,context)
A = linear_system.A()
B = linear_system.B()
try:
K, _, _ = control.lqr(A, B, Q, R)
except:
assert K is not None, "Failed to calculate initial K for quadrotor " + str(i)
print ("Warning: Failed to calculate K at timestep", j, "for quadrotor", i, ". Using K from previous timestep")
K_samples[j, 12*i:12*(i+1)] = K.reshape(-1)
K_poly = PiecewisePolynomial.ZeroOrderHold(breaks, K_samples.T)
return u_opt_poly, x_opt_poly, K_poly, h_opt
def getReoptimizationBreakPoint(t_impacts, impact_combination):
quad_collision_list = []
t_opt_break = None
for i in range(impact_combination.shape[0]):
if impact_combination[i, 0] not in quad_collision_list:
quad_collision_list.append(impact_combination[i, 0])
else:
t_opt_break = (t_impacts_i[i-1] + t_impacts_i[i])//2
i_increment = i
break
if t_opt_break is None:
t_opt_break = t_impacts_i[-1]
i_increment = impact_combination.shape[0]
return t_opt_break, i_increment
def simulateUntil(t, state_init, u_opt_poly, x_opt_poly, K_poly):
##################################################################################
# Setup diagram for simulation
diagram = makeDiagram(n_quadrotors, n_balls, use_visualizer=True, trajectory_u = u_opt_poly, trajectory_x=x_opt_poly, trajectory_K = K_poly)
simulator = Simulator(diagram)
integrator = simulator.get_mutable_integrator()
integrator.set_maximum_step_size(0.01) # Reduce the max step size so that we can always detect collisions
context = simulator.get_mutable_context()
context.SetAccuracy(1e-4)
context.SetTime(0.)
context.SetContinuousState(state_init)
simulator.Initialize()
simulator.AdvanceTo(t)
return context.get_continuous_state_vector().CopyToVector()
diagram = makeDiagram(n_quadrotors, n_balls, use_visualizer=False)
# plt.figure(figsize=(20, 10))
# plot_system_graphviz(diagram)
# plt.show()
###
context = diagram.CreateDefaultContext()
T_total = 500 #Number of breakpoints
t_impacts = np.array([100, 105, 200, 205, 300, 305, 400, 405])
impact_combination = np.array([[0,0],[1,1],[0,1],[1,0],[0,0],[1,1],[0,1],[1,0]]) #[quad,ball]
h_min = 0.005/2
h_max = 0.02/2
state_init = np.array([1.5, -1.5, 0.0, 0.0, 0.0, 0.0, -1.5, -1.5, 0.0, 0.0, 0.0, 0.0, 1.5, 1.0, 0.0, 0.0, -1.5, 1.0, 0.0, 0.0])
state_final = np.array([1.5, -1.5, 0.0, 0.0, 0.0, 0.0, -1.5, -1.5, 0.0, 0.0, 0.0, 0.0, -1.5, 1.0, 0.0, 0.0, 1.5, 1.0, 0.0, 0.0])
i = 0
while i < len(t_impacts):
if i == 0:
# Two quads and one ball
t_init = 0
state_init_i = copy.copy(state_init)
t_impacts_i = np.concatenate((t_impacts,np.array([T_total])))
impact_combination_i = copy.copy(impact_combination)
T_i = T_total
# Set up initial guesses
quad_plant = Quadrotor2D()
h_init = h_max
pos_indices = getPosIndices()
q_init_poly = PiecewisePolynomial.FirstOrderHold([0, T_i * h_init], np.column_stack((state_init[pos_indices], state_final[pos_indices])))
qd_init_poly = q_init_poly.derivative()
u_init_poly = PiecewisePolynomial.ZeroOrderHold([0, T_i * h_init], 0.5*quad_plant.mass*quad_plant.gravity*np.ones((2*n_quadrotors,2)))
u_init = np.hstack([u_init_poly.value(t * h_init) for t in range(T_i + 1)]).T
q_init = np.hstack([q_init_poly.value(t * h_init) for t in range(T_i + 1)]).T
qd_init = np.hstack([qd_init_poly.value(t * h_init) for t in range(T_i + 1)]).T
x_init = collatePosAndVel(q_init, qd_init)
x_init[0,:] = state_init_i
h_init = [h_init]*T_i
else:
t_init = t_opt_break
# Set up initial guesses based on previous solution
state_init_i = copy.copy(state_sim_i)
t_impacts_i = t_impacts_i[i_increment:] - t_init
impact_combination_i = impact_combination_i[i_increment:,:]
T_i = T_i - t_init
# Set up initial guesses based on ?
# h_init = h_max
# pos_indices = getPosIndices()
# q_init_poly = PiecewisePolynomial.FirstOrderHold([0, T_i * h_init], np.column_stack((state_init[pos_indices], state_final[pos_indices])))
# qd_init_poly = q_init_poly.derivative()
# u_init_poly = PiecewisePolynomial.ZeroOrderHold([0, T_i * h_init], 0.5*quad_plant.mass*quad_plant.gravity*np.ones((2*n_quadrotors,2)))
# u_init = np.hstack([u_init_poly.value(t * h_init) for t in range(T_i + 1)]).T
# q_init = np.hstack([q_init_poly.value(t * h_init) for t in range(T_i + 1)]).T
# qd_init = np.hstack([qd_init_poly.value(t * h_init) for t in range(T_i + 1)]).T
# x_init = collatePosAndVel(q_init, qd_init)
# x_init[0,:] = state_init_i
# h_init = [h_init] * T_i
h_init = h_opt_remaining
t_offset = u_opt_remaining.start_time()
u_init = np.hstack([u_opt_remaining.value(t_offset + np.sum(h_init[0:t])) for t in range(T_i + 1)]).T
x_init = np.hstack([x_opt_remaining.value(t_offset + np.sum(h_init[0:t])) for t in range(T_i + 1)]).T
x_init[0,:] = state_init_i
u_opt_poly_i, x_opt_poly_i, K_poly_i, h_opt = solveOptimization(state_init = state_init_i,
t_impact = t_impacts_i[:-1],
impact_combination = impact_combination_i,
T = T_i,
u_guess = u_init,
x_guess = x_init,
h_guess = h_init)
t_opt_break, i_increment = getReoptimizationBreakPoint(t_impacts_i, impact_combination_i)
t_sim = x_opt_poly_i.get_segment_times()[t_opt_break]
# print('SIM t_sim',t_sim)
state_sim_i = simulateUntil(t_sim, state_init_i, u_opt_poly_i, x_opt_poly_i, K_poly_i)
# print('SIM state_sim',state_sim_i)
# print('###################################################')
if i == 0:
u_opt_poly_all, x_opt_poly_all, K_poly_all = u_opt_poly_i.slice(0,t_opt_break), x_opt_poly_i.slice(0,t_opt_break), K_poly_i.slice(0,t_opt_break)
else:
if i == len(t_impacts)-1:
t_opt_break = T_i
u_slice = u_opt_poly_i.slice(0,t_opt_break)
x_slice = x_opt_poly_i.slice(0,t_opt_break)
K_slice = K_poly_i.slice(0,t_opt_break)
u_slice.shiftRight(u_opt_poly_all.end_time())
x_slice.shiftRight(x_opt_poly_all.end_time())
K_slice.shiftRight(K_poly_all.end_time())
u_opt_poly_all.ConcatenateInTime(u_slice)
x_opt_poly_all.ConcatenateInTime(x_slice)
K_poly_all.ConcatenateInTime(K_slice)
if t_opt_break < u_opt_poly_i.get_number_of_segments():
u_opt_remaining = u_opt_poly_i.slice(t_opt_break, u_opt_poly_i.get_number_of_segments() - t_opt_break)
x_opt_remaining = x_opt_poly_i.slice(t_opt_break, x_opt_poly_i.get_number_of_segments() - t_opt_break)
h_opt_remaining = np.array(h_opt[t_opt_break:])
i += i_increment
##################################################################################
# Setup diagram for simulation
diagram = makeDiagram(n_quadrotors, n_balls, use_visualizer=True, trajectory_u = u_opt_poly_all , trajectory_x = x_opt_poly_all , trajectory_K = K_poly_all )
###################################################################################
# Animate
# plt.figure(figsize=(20, 10))
# plot_system_graphviz(diagram)
# plt.show()
# Set up a simulator to run this diagram
simulator = Simulator(diagram)
integrator = simulator.get_mutable_integrator()
integrator.set_maximum_step_size(0.01) # Reduce the max step size so that we can always detect collisions
context = simulator.get_mutable_context()
context.SetAccuracy(1e-4)
##############################################3
# # Simulate
duration = x_opt_poly_all.end_time()
# context.SetTime(0.)
# context.SetContinuousState(state_init)
# simulator.Initialize()
# simulator.AdvanceTo(duration)
t_arr = np.linspace(0,duration,100)
context.SetTime(0.)
context.SetContinuousState(state_init)
simulator.Initialize()
simulator.set_target_realtime_rate(1.0)
visualizer = diagram.GetSubsystemByName('visualizer')
visualizer.start_recording()
# Plot
q_opt = np.zeros((100,6*n_quadrotors+4*n_balls))
q_actual = np.zeros((100,6*n_quadrotors+4*n_balls))
for i in range(100):
t = t_arr[i]
simulator.AdvanceTo(t_arr[i])
q_opt[i,:] = x_opt_poly_all.value(t).flatten()
q_actual[i,:] = context.get_continuous_state_vector().CopyToVector()
ani = visualizer.get_recording_as_animation()
Writer = animation.writers['ffmpeg']
writer = Writer(fps=15, metadata=dict(artist='Me'), bitrate=1800)
ani.save('animation.mp4', writer=writer)
#plotting
for i in range(n_quadrotors):
ind_i = 6*i
ind_f = ind_i + 3
plt.figure(figsize=(6, 3))
plt.plot(t_arr, q_opt[:,ind_i:ind_f])
# plt.figure(figsize=(6, 3))
plt.plot(t_arr, q_actual[:,ind_i:ind_f])
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, q_actual[:,ind_i:ind_f]-q_opt[:,ind_i:ind_f])
# ind_i = 6*i + 3
# ind_f = ind_i + 3
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, q_opt[:,ind_i:ind_f])
ind = 6*i
# plt.figure(figsize=(6, 3))
# plt.plot(q_opt[:,ind], q_opt[:,ind+1])
for i in range(n_balls):
# ind_i = 6*n_quadrotors + 4*i
# ind_f = ind_i + 2
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, q_opt[:,ind_i:ind_f])
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, q_actual[:,ind_i:ind_f])
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, q_actual[:,ind_i:ind_f]-q_opt[:,ind_i:ind_f])
# ind_i = 6*n_quadrotors + 4*i + 2
# ind_f = ind_i + 2
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, q_opt[:,ind_i:ind_f])
ind = 6*n_quadrotors + 4*i
plt.figure(figsize=(6, 3))
plt.plot(q_opt[:,ind], q_opt[:,ind+1])
# plt.figure(figsize=(6, 3))
plt.plot(q_actual[:,ind], q_actual[:,ind+1])
# dist = []
# for t in range(t_arr.size):
# dist.append(CalcClosestDistanceQuadBall(q_opt[t, 0:3], q_opt[t, 6:8]))
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, dist)
# if n_quadrotors >= 2:
# plt.figure()
# plt.figure(figsize=(6, 3))
# plt.plot(t_arr, np.linalg.norm(q_actual[:,0:2] - q_actual[:,6:8], axis=1))
plt.show()