arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.04461cs.RO

MoboTSP: Solving the Task Sequencing Problem for Mobile Manipulators

HP-NTU Digital Manufacturing Corporate Lab(惠普-南洋理工大学数字制造企业实验室);Nanyang Technological University(南洋理工大学)

Nicholas Adrian, Quang-Cuong Pham

英文摘要:

We introduce a new approach to tackle the mobile manipulator task sequencing problem. We leverage computational geometry, graph theory and combinatorial optimization to yield a principled method to segment the task-space targets into clusters, analytically determine reachable base pose for each cluster, and find task sequences that minimize the number of base movements and robot execution time. By clustering targets first and by doing so from first principles, our solution is more general and computationally efficient when compared to existing methods.

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

↑