arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.08185cs.ROcs.SYeess.SY
收藏

最小转弯覆盖规划的非凸环境最优划分

Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning

University of Waterloo(滑铁卢大学);Avidbots Corp.(Avidbots公司)

Megnath Ramesh, Frank Imeson, Baris Fidan, Stephen L. Smith

摘要:

在本文中,我们解决的问题,规划一个最佳的覆盖路径的机器人在室内工作。许多现有的方法试图通过沿着最少数量的覆盖线覆盖环境来阻止路径中的转弯,即,直线路径。这是因为转弯不仅会减慢机器人的速度,而且还会对覆盖质量产生负面影响,例如,像照相机和清洁附件这样的工具通常在转弯时性能较差。然而,最小化覆盖线的问题通常使用不保证最优性的算法来解决。在这项工作中,我们提出了一个转弯最小化覆盖规划方法,计算的最佳数量的轴平行(水平/垂直)的覆盖线的环境中的多项式时间。我们这样做,制定一个线性规划(LP),最佳分割成轴平行的行列(宽度等于工具宽度的非相交矩形)的环境。然后,我们生成一组真实世界的室内环境的覆盖路径,并与国家的最先进的覆盖方法的结果进行比较。

英文摘要:

In this paper, we tackle the problem of planning an optimal coverage path for a robot operating indoors. Many existing approaches attempt to discourage turns in the path by covering the environment along the least number of coverage lines, i.e., straight-line paths. This is because turning not only slows down the robot but also negatively affects the quality of coverage, e.g., tools like cameras and cleaning attachments commonly have poor performance around turns. The problem of minimizing coverage lines however is typically solved using heuristics that do not guarantee optimality. In this work, we propose a turn-minimizing coverage planning method that computes the optimal number of axis-parallel (horizontal/vertical) coverage lines for the environment in polynomial time. We do this by formulating a linear program (LP) that optimally partitions the environment into axis-parallel ranks (non-intersecting rectangles of width equal to the tool width). We then generate coverage paths for a set of real-world indoor environments and compare the results with state-of-the-art coverage approaches.

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

↑