融合规划与安全强化学习,实现多智能体长程安全导航
Safe Multi-Agent Navigation guided by Goal-Conditioned Safe Reinforcement Learning
- 用目标条件安全RL学习导航策略,自动生成带安全评估的路径图
- 通过重放缓冲区构建图结构,自动剪枝危险边并生成分段导航点
- 结合冲突搜索算法支持多智能体协同,适用于复杂高危环境
在危险环境中,自主系统需确保安全导航。传统规划方法擅长长程任务,但依赖预设图结构和固定距离度量;而安全强化学习虽能学习复杂行为且无需人工启发,却难以解决长程目标导向及多智能体场景下的导航问题。本文提出一种新方法,融合规划与安全强化学习优势:利用目标条件强化学习与安全强化学习共同训练导航策略,同时通过自训练算法从学习的价值函数中估计累积距离与安全水平。基于经验回放缓冲区中的状态构建图,自动剪除不安全边,生成基于路标的规划路径,引导智能体持续前行直至抵达目标,有效平衡速度与安全性。该统一高层图与共享低层目标条件安全策略可扩展至多智能体场景,结合冲突基础搜索(CBS)为多个智能体生成分段规划路径,实现长程安全协同导航。大量基准测试表明,本方法在复杂危险环境中能安全达成距离目标,显著优于现有先进方法。代码与更多细节见https://safe-visual-mapf-mers.csail.mit.edu/。
原文摘要 · Abstract (English)
Safe navigation is essential for autonomous systems operating in hazardous environments. Traditional planning methods excel at long-horizon tasks but rely on a predefined graph with fixed distance metrics. In contrast, safe Reinforcement Learning (RL) can learn complex behaviors without relying on manual heuristics but fails to solve long-horizon tasks, particularly in goal-conditioned and multi-agent scenarios. In this paper, we introduce a novel method that integrates the strengths of both planning and safe RL. Our method leverages goal-conditioned RL and safe RL to learn a goal-conditioned policy for navigation while concurrently estimating cumulative distance and safety levels using learned value functions via an automated self-training algorithm. By constructing a graph with states from the replay buffer, our method prunes unsafe edges and generates a waypoint-based plan that the agent follows until reaching its goal, effectively balancing faster and safer routes over extended distances. Utilizing this unified high-level graph and a shared low-level goal-conditioned safe RL policy, we extend this approach to address the multi-agent safe navigation problem. In particular, we leverage Conflict-Based Search (CBS) to create waypoint-based plans for multiple agents allowing for their safe navigation over extended horizons. This integration enhances the scalability of goal-conditioned safe RL in multi-agent scenarios, enabling efficient coordination among agents. Extensive benchmarking against state-of-the-art baselines demonstrates the effectiveness of our method in achieving distance goals safely for multiple agents in complex and hazardous environments. Our code and further details about or work is available at https://safe-visual-mapf-mers.csail.mit.edu/.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。