for more information, see https://pre-commit.ci

for more information, see https://pre-commit.ci

run-clang-tidy-6.0.py -header-filter='.*' -checks='llvm-header-guard' -fix

Extend code to handle arbitrary number of generators per contact. Minor improvements here and there.

[MAJOR IMPROVEMENTS] When using qpOases in DLP check for large negative objective value, which suggests likely unboundedness of the problem. Change signature of most methods of StaticEquilibrium class so that they return true if operation succeeded, false otherwise. Add tests of LP formulations against polytope projection. Add ifdef CLP_FOUND everywhere in the code so that solver CLP is now optional (still to fix the cmakelist though). Add documentation.

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.

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).