论文标题
书架组织问题的基准结果作为混合整数非线性程序与模式开关和避免碰撞的结果
Benchmark Results for Bookshelf Organization Problem as Mixed Integer Nonlinear Program with Mode Switch and Collision Avoidance
论文作者
论文摘要
混合整数凸面和非线性程序MICP和MINLP具有表现力，但需要较长的解决时间。结合了数据驱动方法的求解器启发式方法的最新工作表明，有可能克服此问题，从而可以在更大规模的实际问题上进行应用。为了通过数据驱动的方法在线求解混合企业双线性程序，存在几种配方，包括具有互补约束（MPCC），混合智能编程（MIP）的数学编程。在这项工作中，我们将这些数据驱动方案的性能基于具有离散模式开关和避免碰撞限制的书架组织问题的性能。将成功率，最佳成本和解决时间与非DATA驱动方法进行比较。我们提出的方法被证明是用于书架问题的机器人臂的高级计划者。
Mixed integer convex and nonlinear programs, MICP and MINLP, are expressive but require long solving times. Recent work that combines data-driven methods on solver heuristics has shown potential to overcome this issue allowing for applications on larger scale practical problems. To solve mixed-integer bilinear programs online with data-driven methods, several formulations exist including mathematical programming with complementary constraints (MPCC), mixed-integer programming (MIP). In this work, we benchmark the performances of those data-driven schemes on a bookshelf organization problem that has discrete mode switch and collision avoidance constraints. The success rate, optimal cost and solving time are compared along with non-data-driven methods. Our proposed methods are demonstrated as a high level planner for a robotic arm for the bookshelf problem.
