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

Swarm-Gen:快速生成多样可行的群体行为

Swarm-Gen: Fast Generation of Diverse Feasible Swarm Behaviors

University of Tartu(塔尔图大学);IIIT Hyderabad(印度信息技术学院海得拉巴分校);RRC(区域研究中心)

Simon Idoko, B. Bhanu Teja, K. Madhava Krishna, Arun Kumar Singh

AI总结:

本文结合生成模型与安全过滤器,通过CVAE和VQ-VAE采样轨迹并投影至可行集,实现了在几十毫秒内快速生成多样且可行的多模态机器人群体行为。

摘要:

机器人群体中的协调行为本质上具有多模态特性。也就是说,机器人群体可以通过多种方式避免智能体间的碰撞并到达各自的目标。然而,以可扩展的方式生成多样且可行的群体行为问题在很大程度上仍未得到解决。在本文中,我们通过将生成模型与安全过滤器(SF)相结合来填补这一空白。具体而言,我们从学习到的生成模型中采样多样的轨迹,随后使用SF将其投影到可行集上。我们试验了两种生成模型的选择,即:条件变分自编码器(CVAE)和向量量化变分自编码器(VQ-VAE)。我们强调了这两种模型在计算时间和轨迹多样性方面提供的权衡。我们为SF开发了一个定制的求解器,并为其配备了一个预测特定上下文初始化的神经网络。该初始化网络以自监督方式进行训练,利用了SF求解器的可微性。我们提供了两组实证结果。首先,我们证明了可以在几十毫秒内生成大量多模态、可行的轨迹,模拟多样的群体行为。其次,我们表明与其他替代启发式方法相比,我们的初始化网络为SF求解器提供了更快的收敛速度。

英文摘要:

Coordination behavior in robot swarms is inherently multi-modal in nature. That is, there are numerous ways in which a swarm of robots can avoid inter-agent collisions and reach their respective goals. However, the problem of generating diverse and feasible swarm behaviors in a scalable manner remains largely unaddressed. In this paper, we fill this gap by combining generative models with a safety-filter (SF). Specifically, we sample diverse trajectories from a learned generative model which is subsequently projected onto the feasible set using the SF. We experiment with two choices for generative models, namely: Conditional Variational Autoencoder (CVAE) and Vector-Quantized Variational Autoencoder (VQ-VAE). We highlight the trade-offs these two models provide in terms of computation time and trajectory diversity. We develop a custom solver for our SF and equip it with a neural network that predicts context-specific initialization. Thecinitialization network is trained in a self-supervised manner, taking advantage of the differentiability of the SF solver. We provide two sets of empirical results. First, we demonstrate that we can generate a large set of multi-modal, feasible trajectories, simulating diverse swarm behaviors, within a few tens of milliseconds. Second, we show that our initialization network provides faster convergence of our SF solver vis-a-vis other alternative heuristics.

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

↑