arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.13591cs.RO
收藏

利用多个空中机器人的全局最优覆盖控制研究

Development of global optimal coverage control using multiple aerial robots

Toyota Central R&D Labs., Inc.(丰田中央研发实验室)

Kazuki Shibata, Tatsuya Miyano, Tomohiko Jimbo

摘要:

覆盖控制被广泛应用于环境监测等移动传感器网络的构建,其中最常用的方法之一是基于Voronoi划分的Lloyd算法。然而,当使用这种方法时,结果有时会收敛到局部最优。为了克服这个问题,博弈论的覆盖控制已被提出,并发现能够随机得出的最佳部署。然而,从实际的角度来看,有必要使结果确定性地收敛到全局最优。在本文中,我们提出了一个全球最佳的覆盖控制,以及在连续空间中的碰撞避免,确保多个传感器可以确定性和顺利地移动到全球最佳部署。该方法包括一个切入算法的基础上的邻域重要性的测量和一个修改的潜在的避碰方法。所提出的算法的有效性已被证实,通过大量的仿真和一些实验,使用多个空中机器人。

英文摘要:

Coverage control has been widely used for constructing mobile sensor network such as for environmental monitoring, and one of the most commonly used methods is the Lloyd algorithm based on Voronoi partitions. However, when this method is used, the result sometimes converges to a local optimum. To overcome this problem, game theoretic coverage control has been proposed and found to be capable of stochastically deriving the optimal deployment. From a practical point of view, however, it is necessary to make the result converge to the global optimum deterministically. In this paper, we propose a global optimal coverage control along with collision avoidance in continuous space that ensures multiple sensors can deterministically and smoothly move to the global optimal deployment. This approach consists of a cut-in algorithm based on neighborhood importance of measurement and a modified potential method for collision avoidance. The effectiveness of the proposed algorithm has been confirmed through numerous simulations and some experiments using multiple aerial robots.

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

↑