arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.01015cs.CGcs.DScs.RO
收藏

模块化机器人的碰撞检测——易引发碰撞且难以避免

Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them

University of Warwick(华威大学);Utrecht University(乌得勒支大学);University of Liverpool(利物浦大学);Paderborn University(帕德博恩大学)

Siddharth Gupta, Marc van Kreveld, Othon Michail, Andreas Padalkin

AI总结:

该研究针对网格上的方形模块化可重构机器人,分析了扩张收缩操作下碰撞检测的计算复杂度,给出连续时间模型下碰撞可能性判定的多种时间复杂度算法,并证明碰撞可避免性问题在不同模型和限制下的NP难/完全性或多项式可解性。

摘要:

我们研究模块化可重构机器人的几何碰撞检测问题。假设节点(模块)是网格上相连的正方形,我们探究在执行一组扩张和收缩操作时,判定碰撞是否可能发生或能否避免的复杂度。我们研究了离散时间和连续时间两种模型,并允许操作被耦合为单个并行组。对于具有n个节点的模块化机器人,在连续时间模型下,我们的碰撞可能性判定算法运行时间为O(n²log²n)、O(n²)或O(nlog²n),具体取决于耦合操作的存在与否及其类型。在碰撞能否避免的判定问题上,我们证明一个受限极强的版本在离散时间模型中已是NP完全问题,而同一问题在连续时间模型中是多项式时间可解的;受限稍弱的版本在连续时间模型中是NP难的。

英文摘要:

We consider geometric collision-detection problems for modular reconfigurable robots. Assuming the nodes (modules) are connected squares on a grid, we investigate the complexity of deciding whether collisions may occur, or can be avoided, if a set of expansion and contraction operations is executed. We study both discrete- and continuous-time models, and allow operations to be coupled into a single parallel group. Our algorithms to decide if a collision may occur run in $O(n^2\log^2 n)$ time, $O(n^2)$ time, or $O(n\log^2 n)$ time, depending on the presence and type of coupled operations, in a continuous-time model for a modular robot with $n$ nodes. To decide if collisions can be avoided, we show that a very restricted version is already NP-complete in the discrete-time model, while the same problem is polynomial in the continuous-time model. A less restricted version is NP-hard in the continuous-time model.

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

↑