Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.04616 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917738257055744 |
|---|---|
| author | Lin, Xuan Fernandez, Gabriel Ikaika Hong, Dennis |
| author_facet | Lin, Xuan Fernandez, Gabriel Ikaika Hong, Dennis |
| contents | Mixed integer bilinear programs (MIBLPs) offer tools to resolve robotics motion planning problems with orthogonal rotation matrices or static moment balance, but require long solving times. Recent work utilizing data-driven methods has shown potential to overcome this issue allowing for applications on larger scale problems. To solve mixed-integer bilinear programs online with data-driven methods, several re-formulations exist including mathematical programming with complementary constraints (MPCC), and mixed-integer programming (MIP). In this work, we compare the data-driven performances of various MIBLP reformulations using a book placement problem that has discrete configuration switches and bilinear constraints. The success rate, cost, and solving time are compared along with non-data-driven methods. Our results demonstrate the advantage of using data-driven methods to accelerate the solving speed of MIBLPs, and provide references for users to choose the suitable re-formulation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_04616 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Evaluating Data-driven Performances of Mixed Integer Bilinear Formulations for Book Placement Planning Lin, Xuan Fernandez, Gabriel Ikaika Hong, Dennis Robotics Mixed integer bilinear programs (MIBLPs) offer tools to resolve robotics motion planning problems with orthogonal rotation matrices or static moment balance, but require long solving times. Recent work utilizing data-driven methods has shown potential to overcome this issue allowing for applications on larger scale problems. To solve mixed-integer bilinear programs online with data-driven methods, several re-formulations exist including mathematical programming with complementary constraints (MPCC), and mixed-integer programming (MIP). In this work, we compare the data-driven performances of various MIBLP reformulations using a book placement problem that has discrete configuration switches and bilinear constraints. The success rate, cost, and solving time are compared along with non-data-driven methods. Our results demonstrate the advantage of using data-driven methods to accelerate the solving speed of MIBLPs, and provide references for users to choose the suitable re-formulation. |
| title | Evaluating Data-driven Performances of Mixed Integer Bilinear Formulations for Book Placement Planning |
| topic | Robotics |
| url | https://arxiv.org/abs/2406.04616 |