通过嵌套分支限界法进行联合任务协助规划(扩展版)
Joint Task Assistance Planning via Nested Branch and Bound (Extended Version)
AI总结:
本文提出嵌套分支限界法解决机器人联合任务协助规划问题,通过分层探索路径空间,实现高效计算并显著提升性能。
摘要:
我们引入并研究了联合任务协助规划问题,该问题扩展了以往在机器人协作中优化协助的工作。在该设定中,两个机器人在预定义的路线上操作,每个路线表示为对应其配置空间的图。一个机器人(任务机器人)必须执行定时任务,而另一个机器人(协助机器人)提供基于传感器的支持,其依赖于两者空间关系。目标是计算两个机器人路径,以最大化总协助时间。解决该问题具有挑战性,因为可能的路径组合存在组合爆炸,同时问题具有时间性质(需要考虑时间因素)。为此,我们提出了一种嵌套分支限界框架,以分层方式高效探索机器人路径空间。我们通过实证评估我们的算法,并展示了与基线方法相比,速度提升高达两个数量级。
英文摘要:
We introduce and study the Joint Task Assistance Planning problem which generalizes prior work on optimizing assistance in robotic collaboration. In this setting, two robots operate over predefined roadmaps, each represented as a graph corresponding to its configuration space. One robot, the task robot, must execute a timed mission, while the other, the assistance robot, provides sensor-based support that depends on their spatial relationship. The objective is to compute a path for both robots that maximizes the total duration of assistance given. Solving this problem is challenging due to the combinatorial explosion of possible path combinations together with the temporal nature of the problem (time needs to be accounted for as well). To address this, we propose a nested branch-and-bound framework that efficiently explores the space of robot paths in a hierarchical manner. We empirically evaluate our algorithm and demonstrate a speedup of up to two orders of magnitude when compared to a baseline approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。