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

有限感知能力下的分布式动态覆盖策略

Distributed Strategies for Dynamic Coverage with Limited Sensing Capabilities

Marco Fabris, Angelo Cenedese

摘要:

在这项工作中,它提出了一种新的分布式算法执行机器人覆盖,集群和调度周围的静态障碍结构化环境中的事件,而不依赖于度量信息的发展。具体而言,其目的是考虑到本地通信之间的权衡,通过轴承安装在每个代理的可见性传感器,在封闭的未知场景中的最佳部署和一组代理的关注点。本研究的具体目标可以概括为1.计算,在某些拓扑假设下,所需代理的数量的下限,这是由一个现实的几何模型(例如圆形),以强调物理限制; 2.在连接的通信图上保持分布式方法的节点和链路的数量的最小化; 3.识别由每个代理感测到的具有径向减小强度的事件周围的激活簇; 4.试图通过最小化加权等周泛函来向场景中最密集的点发送属于集群的代理。

英文摘要:

In this work, it is presented the development of a novel distributed algorithm performing robotic coverage, clustering and dispatch around an event in static-obstacle structured environments without relying on metric information. Specifically, the aim is to account for the trade-off between local communication given by bearing visibility sensors installed on each agent involved, optimal deployment in closed unknown scenarios and focus of a group of agents on one point of interest. The particular targets of this study can be summarized as 1. the computation, under certain topological assumptions, of a lower bound for the number of required agents, which are provided by a realistic geometric model (e.g. a round shape) to emphasize physical limitations; 2. the minimization of the number of nodes and links maintaining a distributed approach over a connected communication graph; 3. the identification of an activation cluster around an event with a radial decreasing intensity, sensed by each agent; 4. the attempt to send the agents belonging to the cluster towards the most intense point in the scenario by minimizing a weighted isoperimetric functional.

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

↑