基于证书的闭环多智能体路径寻找与可继承分解
Certificate-Driven Closed-Loop Multi-Agent Path Finding with Inheritable Factorization
AI总结:
本文提出基于证书的闭环多智能体路径寻找方法,通过可继承分解提升密集场景下的路径规划一致性与效率。
摘要:
多智能体在自动化仓库和物流中的协调通常建模为多智能体路径寻找(MAPF)问题。闭环MAPF算法通过仅规划下一步移动并在线重规划来提高可扩展性,但这种有限时间 horizon 观点可能过于短视,难以保持全局保证并利用组合结构。本文引入证书轨迹及其关联的车队预算作为过滤闭环更新的一般机制。证书提供无冲突的后备计划和剩余成本的单调上界;仅接受改进证书的更新可保证完备性。相同的预算信息诱导出预算限制的分解,使全局、可继承的分解在时间步之间得以实现。将该框架应用于ACCBS得到证书驱动的冲突基于搜索(CDCBS)。在基准地图上的实验表明,CDCBS在密集场景中比ACCBS实现更一致的解决方案质量,同时所提出的分解减少了有效群体大小。
英文摘要:
Multi-agent coordination in automated warehouses and logistics is commonly modeled as the Multi-Agent Path Finding (MAPF) problem. Closed-loop MAPF algorithms improve scalability by planning only the next movement and replanning online, but this finite-horizon viewpoint can be shortsighted and makes it difficult to preserve global guarantees and exploit compositional structure. This issue is especially visible in Anytime Closed-Loop Conflict-Based Search (ACCBS), which applies Conflict-Based Search (CBS) over dynamically extended finite horizons but, under finite computational budgets, may terminate with short active prefixes in dense instances. We introduce certificate trajectories and their associated fleet budget as a general mechanism for filtering closed-loop updates. A certificate provides a conflict-free fallback plan and a monotone upper bound on the remaining cost; accepting only certificate-improving updates yields completeness. The same budget information induces a budget-limited factorization that enables global, inheritable decomposition across timesteps. Instantiating the framework on ACCBS yields Certificate-Driven Conflict-Based Search (CDCBS). Experiments on benchmark maps show that CDCBS achieves more consistent solution quality than ACCBS, particularly in dense settings, while the proposed factorization reduces effective group size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。