- Jan 29, 2019
-
-
Guilhem Saurel authored
-
Guilhem Saurel authored
-
- Mar 08, 2017
-
-
Steve Tonneau authored
-
Steve Tonneau authored
-
Steve Tonneau authored
-
- Nov 04, 2015
-
-
andreadelprete authored
-
- Oct 30, 2015
-
-
andreadelprete authored
Implement LP solver using qpOases. Implement a more efficient primal formulation of the LP to compute robustness of a given CoM position (LP2 in the code). Even this formulation sometimes gives wrong results with coin-or solver, but not with qpOases. Implement first performance tests: qpOases seems faster than coin-or solver and fastest formulation seems to be the dual LP (about 0.1 ms for 32 generators). PP algorithm is instead very slow, much slower than in Steve's code, but it's not clear why.
-
- Oct 28, 2015
-
-
andreadelprete authored
Implement LP solver using coin-or LP. Add in test_LP_solver some small LP tests. Implement primal and dual LP algorithm to compute robustness of a given com position. Test algorithm against PP: primal works always, while dual works only sometimes (need to investigate).
-
- Oct 26, 2015
-
-
andreadelprete authored
-