Just to make sure I understood the documentation right:
N = number of collocation nodes
t0 = starting time for optimization
tf = final time for optimization
delta = (t0 - tf) / (N-1)
state_variables = [x, y, ux, uy], so
n = len(state_variables)
then the sequence in initial_guess is this:
initial_guess = [ x[t0], x[t0 + delta], ....., x[tf], y[t0]....,, y[tf], ....., uy[tf], same for input_trajectories, unknown parameters ]
, and same sequence in free.
Just to make sure I understood the documentation right:
N = number of collocation nodes t0 = starting time for optimization tf = final time for optimization delta = (t0 - tf) / (N-1) state_variables = [x, y, ux, uy], so n = len(state_variables)
then the sequence in initial_guess is this: initial_guess = [ x[t0], x[t0 + delta], ....., x[tf], y[t0]....,, y[tf], ....., uy[tf], same for input_trajectories, unknown parameters ] , and same sequence in free.
Is my understanding correct? Thanks!