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

编程作为机器人中基于路径优化的通用解决方法:原理、最佳实践和应用

Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications

Rutgers, the State University of New Jersey(罗格斯新泽西州立大学)

Shuai D. Han, Jingjin Yu

摘要:

机器人编程(IP)已被证明是非常有效的解决许多基于路径的优化问题的机器人。然而,IP的应用程序通常是在一个特设的,具体问题的方式。在这项工作中,在研究了广泛的基于路径的优化问题后,我们描述了这些问题的IP解决方案方法,该方法既易于应用(在两个简单的步骤中),又在计算时间和实现的最优性方面具有高性能。我们通过应用于三个具有挑战性的基于路径的优化问题:多机器人路径规划(MPP),最小约束去除(MCR),和奖励收集问题RCP),证明了我们的方法的通用性。相关的实验表明,该方法可以有效地产生(近)最优解的问题与大的状态空间,复杂的约束条件,复杂的目标函数。结合IP方法的命题,我们介绍了两个新的和实际的机器人问题:多机器人最小约束去除(MMCR)和多机器人路径规划(MPP)与部分解决方案,这可以快速有效地解决使用我们提出的IP解决方案管道。

英文摘要:

Integer programming (IP) has proven to be highly effective in solving many path-based optimization problems in robotics. However, the applications of IP are generally done in an ad-hoc, problem specific manner. In this work, after examined a wide range of path-based optimization problems, we describe an IP solution methodology for these problems that is both easy to apply (in two simple steps) and high-performance in terms of the computation time and the achieved optimality. We demonstrate the generality of our approach through the application to three challenging path-based optimization problems: multi-robot path planning (MPP), minimum constraint removal (MCR), and reward collection problems RCPs). Associated experiments show that the approach can efficiently produce (near-)optimal solutions for problems with large state spaces, complex constraints, and complicated objective functions. In conjunction with the proposition of the IP methodology, we introduce two new and practical robotics problems: multi-robot minimum constraint removal (MMCR) and multi-robot path planning (MPP) with partial solutions, which can be quickly and effectively solved using our proposed IP solution pipeline.

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

↑