arXiv:2508.17173math.OCcs.RO2025-08被引 1

多机器人协同在线学习,实现随机障碍物下的安全避障与稳定跟踪。

Collaborative-Online-Learning-Enabled Distributionally Robust Motion Control for Multi-Robot Systems

  • 基于狄利克雷过程混合模型的协同在线学习,从分散数据中提取运动分布信息。
  • 构建可压缩的模糊集,结合半定规划生成概率安全轨迹,计算效率高。
  • 理论证明了碰撞规避与长期跟踪性能,适用于动态障碍场景的多机协同系统。

本文提出一种新型协同在线学习(COOL)驱动的多机器人运动控制框架,用于在部分可观测随机移动障碍物环境中避免碰撞。针对遮挡导致的数据获取难题,提出基于狄利克雷过程混合模型的COOL方法,通过机器人间交换精选学习结构,高效提取运动分布信息。利用COOL获得的细粒度局部矩信息,构建基于数据流的障碍物运动模糊集。进一步提出一种模糊集传播方法,理论上可由障碍物当前位置及运动模糊集推导出整个预测时域内的位置模糊集。同时设计了一种带安全保证的压缩方案,通过在度量空间中聚合相近的基本模糊集,自动调节其复杂度与粒度,在控制性能与计算时间间取得良好平衡。最终通过分布鲁棒优化生成概率无碰撞轨迹,并基于压缩模糊集等价重构分离超平面,采用可解的半定规划求解。最后建立了所提框架的概率碰撞规避与长期跟踪性能保障。数值仿真验证了该方法相比现有先进方法的优越性。

原文摘要 · Abstract (English)

This paper develops a novel COllaborative-Online-Learning (COOL)-enabled motion control framework for multi-robot systems to avoid collision amid randomly moving obstacles whose motion distributions are partially observable through decentralized data streams. To address the notable challenge of data acquisition due to occlusion, a COOL approach based on the Dirichlet process mixture model is proposed to efficiently extract motion distribution information by exchanging among robots selected learning structures. By leveraging the fine-grained local-moment information learned through COOL, a data-stream-driven ambiguity set for obstacle motion is constructed. We then introduce a novel ambiguity set propagation method, which theoretically admits the derivation of the ambiguity sets for obstacle positions over the entire prediction horizon by utilizing obstacle current positions and the ambiguity set for obstacle motion. Additionally, we develop a compression scheme with its safety guarantee to automatically adjust the complexity and granularity of the ambiguity set by aggregating basic ambiguity sets that are close in a measure space, thereby striking an attractive trade-off between control performance and computation time. Then the probabilistic collision-free trajectories are generated through distributionally robust optimization problems. The distributionally robust obstacle avoidance constraints based on the compressed ambiguity set are equivalently reformulated by deriving separating hyperplanes through tractable semi-definite programming. Finally, we establish the probabilistic collision avoidance guarantee and the long-term tracking performance guarantee for the proposed framework. The numerical simulations are used to demonstrate the efficacy and superiority of the proposed approach compared with state-of-the-art methods.

多机器人避障控制分布鲁棒在线学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。