用分布式算法实现四足机器人安全协同运动,实时性提升超50%。
ADMM-Based Distributed MPC with Control Barrier Functions for Safe Multi-Robot Quadrupedal Locomotion
- 基于ADMM的分层优化框架,通过邻居通信实现完全去中心化
- 四机器人实验中规划耗时减少51%,性能接近集中式方案
- 适合需要高安全性和实时性的多机器人协同任务
本文提出一种完全去中心化的模型预测控制(MPC)框架,结合控制屏障函数(CBF)约束,用于多机器人足式系统中的安全关键轨迹规划。引入CBF约束导致显式的跨代理耦合,难以直接分解最优控制问题。为此,我们基于交替方向乘子法(ADMM)构建结构化分布式优化框架,采用创新的节点-边分割与一致性约束设计,将全局问题分解为可并行求解的独立节点局部和边局部二次规划,仅需邻近通信即可实现。该方法在各智能体间保持对称计算负载,同时保障安全性与动态可行性。框架集成于四足机器人的分层运动控制架构中,包含高层分布式轨迹规划、中层非线性MPC(单刚体动力学)、低层全阶机器人动力学控制。硬件实验在两台Unitree Go2机器人上验证,数值仿真涉及最多四台机器人在不确定环境、崎岖地形及外部扰动下的导航。结果表明,该分布式方案性能接近集中式MPC,四智能体情况下平均每周期规划时间缩短达51%,支持高效实时去中心化实现。
原文摘要 · Abstract (English)
This paper proposes a fully decentralized model predictive control (MPC) framework with control barrier function (CBF) constraints for safety-critical trajectory planning in multi-robot legged systems. The incorporation of CBF constraints introduces explicit inter-agent coupling, which prevents direct decomposition of the resulting optimal control problems. To address this challenge, we reformulate the centralized safety-critical MPC problem using a structured distributed optimization framework based on the alternating direction method of multipliers (ADMM). By introducing a novel node-edge splitting formulation with consensus constraints, the proposed approach decomposes the global problem into independent node-local and edge-local quadratic programs that can be solved in parallel using only neighbor-to-neighbor communication. This enables fully decentralized trajectory optimization with symmetric computational load across agents while preserving safety and dynamic feasibility. The proposed framework is integrated into a hierarchical locomotion control architecture for quadrupedal robots, combining high-level distributed trajectory planning, mid-level nonlinear MPC enforcing single rigid body dynamics, and low-level whole-body control enforcing full-order robot dynamics. The effectiveness of the proposed approach is demonstrated through hardware experiments on two Unitree Go2 quadrupedal robots and numerical simulations involving up to four robots navigating uncertain environments with rough terrain and external disturbances. The results show that the proposed distributed formulation achieves performance comparable to centralized MPC while reducing the average per-cycle planning time by up to 51% in the four-agent case, enabling efficient real-time decentralized implementation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。