arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.05798cs.RO
收藏

面向通信感知的多机器人协调:在线学习与连通性维持的融合

Integrating Online Learning and Connectivity Maintenance for Communication-Aware Multi-Robot Coordination

University of North Carolina at Charlotte(北卡罗来纳大学夏洛特分校);Carnegie Mellon University(卡内基梅隆大学)

Yupeng Yang, Yiwei Lyu, Yanze Zhang, Ian Gao, Wenhao Luo

AI总结:

针对现有多机器人连通性维持方法依赖预设通信模型、难匹配真实场景的问题,提出融合CBF与GP的数据驱动连通性屏障证书及DCM算法,结合在线学习与双层优化保障全局连通性,经20台机器人仿真验证有效。

摘要:

本文提出了一种新颖的数据驱动控制策略,用于维持网络化多机器人系统的连通性。现有方法通常依赖预先确定的通信模型,该模型根据成对机器人的相对距离指定它们是否能够通信,以此指导连通性感知控制设计,但这类模型可能无法反映真实世界的通信条件。为放宽这一假设,我们提出了数据驱动连通性屏障证书(Data-driven Connectivity Barrier Certificates)的概念,它利用控制屏障函数(Control Barrier Functions, CBF)和高斯过程(Gaussian Processes, GP),基于在线观测到的通信性能来刻画成对机器人的容许控制空间。这使得机器人在运动过程中能够维持令人满意的成对通信质量(以接收信号强度衡量)。随后我们提出了数据驱动连通性维持(Data-driven Connectivity Maintenance, DCM)算法,该算法结合了(1)通信信号强度的在线学习,以及(2)面向机器人团队的双层优化控制框架,以保障真实多机器人通信图的全局连通性,并最小化与任务相关运动的偏离。我们提供了理论证明来验证算法的性质,并通过最多包含20个机器人的仿真实验证明了其有效性。

英文摘要:

This paper proposes a novel data-driven control strategy for maintaining connectivity in networked multi-robot systems. Existing approaches often rely on a pre-determined communication model specifying whether pairwise robots can communicate given their relative distance to guide the connectivity-aware control design, which may not capture real-world communication conditions. To relax that assumption, we present the concept of Data-driven Connectivity Barrier Certificates, which utilize Control Barrier Functions (CBF) and Gaussian Processes (GP) to characterize the admissible control space for pairwise robots based on communication performance observed online. This allows robots to maintain a satisfying level of pairwise communication quality (measured by the received signal strength) while in motion. Then we propose a Data-driven Connectivity Maintenance (DCM) algorithm that combines (1) online learning of the communication signal strength and (2) a bi-level optimization-based control framework for the robot team to enforce global connectivity of the realistic multi-robot communication graph and minimally deviate from their task-related motions. We provide theoretical proofs to justify the properties of our algorithm and demonstrate its effectiveness through simulations with up to 20 robots.

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

↑