Original Summary

A bounded-suboptimal Multi-Agent Path Finding (MAPF) solver built on CBS. CARBS combines MDD conflict prioritization, conflict bypassing, and focal search with true-distance low-level space-time A* to deliver agile, adaptive search with strict w-bounded suboptimality guarantees.

  • 情报分类：技术学习与提效
  • 分类依据：内容涉及技术、AI、软件工具或工程实践
  • 信息来源：GitHub · AI 新项目
  • 发布时间：2026/9/27 21:25:56