Dear all
I am currently trying out Knitro to solve motion planning problems: a holonomic vehicle moves from A to B and has to avoid all (moving) obstacles in the environment, while respecting its velocity bounds and minimizing its motion time.
Since the environment may change, I solve the problem with a receding horizon. So after the vehicle has moved for a specific time (being the time step), the information about the vehicle position, obstacle positions, velocities,... is updated. This leads to a new problem, which is very similar to the previous one since the main difference is that the starting point has shifted a bit. Therefore, the previous trajectory is used as an initial guess.
I am currently solving this NLP with Knitro with the following options (based on:
https://groups.google.com/forum/#!topic/knitro/pNLLVsh9BmI):
bar_initpt=2
honorbnds=0
scale=1 (they suggest scale=0, but with scaling works better for me)
With these options I could decrease the computation time for an easy example with a factor 2.5, compared to IPOPT.
Now I have two questions:
1) I tried to change more things, but I am a bit lost in the big amount of options which can be set. Therefore, I was wondering if you have any further advice which options I could try to further decrease the computation time?
2) Because the subsequent problems are very similar I was thinking that the active set method should work best. Although, for my example the interior point method is still faster... Therefore, I was wondering if it is possible to give an initial guess of the active set? Normally the active set over subsequent problems will be (almost) the same, so I guess passing the active set will make things faster.
Thanks in advance!
Kind regards,
Tim