arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.04616cs.RO
收藏

评估书籍摆放规划中混合整数双线性规划的数据驱动性能

Evaluating Data-driven Performances of Mixed Integer Bilinear Formulations for Book Placement Planning

University of California, Los Angeles(加利福尼亚大学洛杉矶分校)

Xuan Lin, Gabriel Ikaika Fernandez, Dennis Hong

AI总结:

本文通过书籍摆放规划问题比较了混合整数双线性规划不同重构形式的数据驱动求解性能,证明数据驱动方法能显著加速求解,并为用户选择合适重构形式提供参考。

摘要:

混合整数双线性规划(MIBLPs)为解决带有正交旋转矩阵或静态力矩平衡的机器人运动规划问题提供了工具,但求解时间较长。近期利用数据驱动方法的研究显示出克服这一问题的潜力,使其能够应用于更大规模的问题。为了用数据驱动方法在线求解混合整数双线性规划,存在若干种重构形式,包括带有互补约束的数学规划(MPCC)和混合整数规划(MIP)。在本工作中,我们使用一个具有离散配置切换和双线性约束的书籍摆放问题,比较了各种MIBLP重构形式的数据驱动性能。我们比较了成功率、代价和求解时间,并与非数据驱动方法进行了对比。我们的结果表明,使用数据驱动方法加速MIBLP求解速度具有优势,并为用户选择合适的重构形式提供了参考。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑