arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.04078eess.SYcs.MAcs.SY
收藏

杂乱环境下多Agent网络的分布式冲突避免覆盖控制

Distributed Coverage Control of Multi-Agent Networks with Guaranteed Collision Avoidance in Cluttered Environments

Alaa Z. Abdulghafoor, Efstathios Bakolas

摘要:

我们提出了一个分布式控制算法的多智能体网络的代理部署在一个杂乱的区域,根据随时间变化的覆盖密度函数,同时避免碰撞的所有障碍物,他们遇到的。我们的算法是建立在一个两级表征的网络。第一层将多智能体网络作为一个整体,基于其代理在空间域上的位置分布。在第二层中,网络是根据其代理人的个人位置来描述的。多智能体网络的目标是通过其智能体的局部(微观)交互(低级问题)来获得类似于参考覆盖密度函数(高级问题)的空间分布。此外,随着特工的部署,他们必须始终避免与该地区的所有障碍物发生碰撞。我们的方法利用修改后的版本的Voronoi镶嵌,它是由我们所说的障碍感知Voronoi细胞(OAVC),以使覆盖控制,同时确保避障。我们考虑两个控制问题。第一个问题,我们称之为高层次的覆盖控制问题对应的插值问题的类高斯混合物(没有避免碰撞的要求),我们解析解决。我们称之为低级覆盖控制问题的第二个问题对应于分布式控制问题(现在总是强制执行冲突避免要求),该问题通过利用Lloyd算法连同修改的Voronoi镶嵌(OAVC)和对应于高级覆盖控制问题的解决方案的时变覆盖密度函数来解决。最后,在一个杂乱的环境中的覆盖仿真结果证明了所提出的方法的有效性。

英文摘要:

We propose a distributed control algorithm for a multi-agent network whose agents deploy over a cluttered region in accordance with a time-varying coverage density function while avoiding collisions with all obstacles they encounter. Our algorithm is built on a two-level characterization of the network. The first level treats the multi-agent network as a whole based on the distribution of the locations of its agents over the spatial domain. In the second level, the network is described in terms of the individual positions of its agents. The aim of the multi-agent network is to attain a spatial distribution that resembles that of a reference coverage density function (high-level problem) by means of local (microscopic) interactions of its agents (low-level problem). In addition, as the agents deploy, they must avoid collisions with all the obstacles in the region at all times. Our approach utilizes a modified version of Voronoi tessellations which are comprised of what we refer to as Obstacle-Aware Voronoi Cells (OAVC) in order to enable coverage control while ensuring obstacle avoidance. We consider two control problems. The first problem which we refer to as the high-level coverage control problem corresponds to an interpolation problem in the class of Gaussian mixtures (no collision avoidance requirement), which we solve analytically. The second problem which we refer to as the low-level coverage control problem corresponds to a distributed control problem (collision avoidance requirement is now enforced at all times) which is solved by utilizing Lloyd's algorithm together with the modified Voronoi tessellation (OAVC) and a time-varying coverage density function which corresponds to the solution of the high-level coverage control problem. Finally, simulation results for coverage in a cluttered environment are provided to demonstrate the efficacy of the proposed approach.

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

↑