扫线覆盖下多机器人护卫的优化配置
Optimal Allocation of Many Robot Guards for Sweep-Line Coverage
摘要:
我们研究了在已知的二维环境中分配多个移动机器人执行预定义的扫描计划的问题,应用于搜索和救援,覆盖,监视,监控,追捕逃避,等等。移动机器人(或代理)被假定为具有一维的感知能力,随着感知距离的增加,概率保证恶化。在解决这样的任务,机器人的时间参数化分布沿扫描边界必须计算,与目标,以尽量减少用于实现一些所需的覆盖质量保证的机器人的数量,或最大限度地提高概率保证给定数量的机器人。我们提出了一个基于最大流的算法来解决分配任务,它建立在工作空间的分解技术作为一个推广的著名的boustrophedon分解。我们提出的算法有一个非常低的多项式运行时间,并在两秒内完成多边形环境超过$10^5$顶点。仿真实验进行了随机生成的障碍物的不同形状,大小和空间分布的三个现实的用例,这证明了我们所提出的方法的适用性和可扩展性。
英文摘要:
We study the problem of allocating many mobile robots for the execution of a pre-defined sweep schedule in a known two-dimensional environment, with applications toward search and rescue, coverage, surveillance, monitoring, pursuit-evasion, and so on. The mobile robots (or agents) are assumed to have one-dimensional sensing capability with probabilistic guarantees that deteriorate as the sensing distance increases. In solving such tasks, a time-parameterized distribution of robots along the sweep frontier must be computed, with the objective to minimize the number of robots used to achieve some desired coverage quality guarantee or to maximize the probabilistic guarantee for a given number of robots. We propose a max-flow based algorithm for solving the allocation task, which builds on a decomposition technique of the workspace as a generalization of the well-known boustrophedon decomposition. Our proposed algorithm has a very low polynomial running time and completes in under two seconds for polygonal environments with over $10^5$ vertices. Simulation experiments are carried out on three realistic use cases with randomly generated obstacles of varying shapes, sizes, and spatial distributions, which demonstrate the applicability and scalability our proposed method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。