Hi, nice to meet you!
I’m using OSQP Solver for my autonomous driving project. First of all, OSQP Solver is very cool!
I’m developing QP based Path Planning logic.
I developed QP-based path generation logic with quadprog of MATLAB, and I am currently developing logic using OSQP in C environment.
However, while applying the OSQP Solver to my algorithm, a question arose. That is, I am not sure if the OSQP solver is working properly.
If you look at the picture below, you can see that the Objective cost increases with iteration. In my opinion, the objective value should decrease, but it is strange that it increases. Above all, it is strange that the increase in Ojbective is ultimately judged as Solved. If you look at the contents of this console, can you see that the optimization has been performed normally?
When I visualize the optimized result (path), it doesn’t seem like the optimization was performed properly. And looking at the console contents, I can’t tell if it’s been optimized properly. can you help me?