利用可见性图的团覆盖以少量凸集近似机器人构型空间
Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
AI总结:
本文提出一种基于采样可见性图团覆盖的方法,用少量多胞体高效近似覆盖机器人构型空间,在多种机器人系统上以更少多胞体和更短时间覆盖更大自由空间。
摘要:
如果机器人构型空间被描述为简单集合的集合,机器人学中的许多计算可以显著加速。例如,最近开发的运动规划器依赖自由空间的凸分解,利用快速凸优化来设计无碰撞轨迹。在本工作中,我们提出了一种高效方法,用少量多胞体近似覆盖复杂构型空间。该方法利用采样构建可见性图,并生成该图的团覆盖,以找到具有相互视线的样本簇。随后,这些簇被膨胀为大型、全维的多胞体。我们在多种机器人系统上评估了我们的方法,并表明与先前方法相比,它能够以更少的多胞体、在更短的时间内持续覆盖更大比例的自由构型空间。
英文摘要:
Many computations in robotics can be dramatically accelerated if the robot configuration space is described as a collection of simple sets. For example, recently developed motion planners rely on a convex decomposition of the free space to design collision-free trajectories using fast convex optimization. In this work, we present an efficient method for approximately covering complex configuration spaces with a small number of polytopes. The approach constructs a visibility graph using sampling and generates a clique cover of this graph to find clusters of samples that have mutual line of sight. These clusters are then inflated into large, full-dimensional, polytopes. We evaluate our method on a variety of robotic systems and show that it consistently covers larger portions of free configuration space, with fewer polytopes, and in a fraction of the time compared to previous methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。