search

hungpham2511 / toppra

robotic motion planning library
https://hungpham2511.github.io/toppra/index.html
MIT License
612 stars 169 forks source link

LP solve efficiency #170

Closed SHIXIAOLI022048 closed 3 years ago

SHIXIAOLI022048 commented 3 years ago

Hi,

Here is my question. Now there are three solvers provided for C++ API, is the Seidel solver the fastest one to solve LP problems?

Thanks!

hungpham2511 commented 3 years ago

In my experience, Seidel solver is the simplest and thus it often is the fastest.

SHIXIAOLI022048 commented 3 years ago

Thanks a lot!!

发件人：Hung Pham (Phạm Tiến Hùng) @.> 发送时间：2021年4月25日(星期日) 16:15 收件人：hungpham2511/toppra @.> 抄　送：史晓立 @.>; State change @.> 主　题：Re: [hungpham2511/toppra] LP solve efficiency (#170)

In my experience, Seidel solver is the simplest and thus it often is the fastest. — You are receiving this because you modified the open/close state. Reply to this email directly, view it on GitHub, or unsubscribe.

xbaosong commented 2 years ago

The Seidel solver is reported 10 times faster than simplex method for low-dimension LP(< 10).

This is mentioned here: SDLP