双足机器人在狭窄空间协同搬运,用安全强化学习避免碰撞
Dual-Quadruped Collaborative Transportation in Narrow Environments via Safe Reinforcement Learning
- 将协作任务建模为带约束的马尔可夫博弈,用代价优势分解保障安全
- 通过约束分配机制提升整体任务成功率,实测成功率达92%
- 适合需要高精度协同搬运的复杂场景,如救灾或狭小空间作业
多机器人协同搬运负载近年来受到广泛关注。在狭窄环境中,可行区域极小,确保安全高效的机器人协作尤为困难。为此,本文提出一种基于安全强化学习的双足机器人协同搬运方法。将任务建模为完全合作的约束马尔可夫博弈,将避障转化为约束条件。提出代价-优势分解方法,使团队总约束值始终低于上限,从而在强化学习框架内保证任务安全。同时设计约束分配策略,将共享约束分派给个体机器人,以最大化整体任务奖励,促进机器人自主分工,提升协作性能。仿真与实时实验结果表明,该方法在双足机器人协同搬运中表现优于现有方法,成功率达92%。
原文摘要 · Abstract (English)
Collaborative transportation, where multiple robots collaboratively transport a payload, has garnered significant attention in recent years. While ensuring safe and high-performance inter-robot collaboration is critical for effective task execution, it is difficult to pursue in narrow environments where the feasible region is extremely limited. To address this challenge, we propose a novel approach for dual-quadruped collaborative transportation via safe reinforcement learning (RL). Specifically, we model the task as a fully cooperative constrained Markov game, where collision avoidance is formulated as constraints. We introduce a cost-advantage decomposition method that enforces the sum of team constraints to remain below an upper bound, thereby guaranteeing task safety within an RL framework. Furthermore, we propose a constraint allocation method that assigns shared constraints to individual robots to maximize the overall task reward, encouraging autonomous task-assignment among robots, thereby improving collaborative task performance. Simulation and real-time experimental results demonstrate that the proposed approach achieves superior performance and a higher success rate in dual-quadruped collaborative transportation compared to existing methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。