arXiv:2504.21113cs.MAcs.RO2025-04

NavEX通过聚类与路径规划结合,实现复杂地形下多智能体公平与热点部署。

NavEX: A Multi-Agent Coverage in Non-Convex and Uneven Environments via Exemplar-Clustering

  • 用示例聚类定义覆盖效用,支持非欧距离和可见性图路径计算。
  • 在非凸不规则环境中,实现近似最优的多智能体部署,有理论保证。
  • 适合需要公平服务或重点区域覆盖的机器人协同场景。

本文针对非凸、不规则环境中的多智能体部署问题,提出一种新型调度覆盖框架NavEX。该框架结合示例聚类与障碍物感知、可通行性感知的最短路径计算,基于子模优化提供统一解决方案。NavEX可同时处理两类关键覆盖任务:(a) 公平访问部署,通过最小化代理与目标间的距离实现服务均等;(b) 热点部署,优先覆盖高密度目标区域。其核心在于使用示例聚类作为覆盖效用度量,支持不满足三角不等式的非欧距离度量,从而可集成平面障碍环境下的可视性图进行最短路径计算,以及复杂崎岖地形下的可通行性感知RRT*算法。通过子模优化,NavEX在真实复杂环境中实现了高效、近似最优的部署方案,并具有可证明的性能保障,仿真结果验证了其有效性。

原文摘要 · Abstract (English)

This paper addresses multi-agent deployment in non-convex and uneven environments. To overcome the limitations of traditional approaches, we introduce Navigable Exemplar-Based Dispatch Coverage (NavEX), a novel dispatch coverage framework that combines exemplar-clustering with obstacle-aware and traversability-aware shortest distances, offering a deployment framework based on submodular optimization. NavEX provides a unified approach to solve two critical coverage tasks: (a) fair-access deployment, aiming to provide equitable service by minimizing agent-target distances, and (b) hotspot deployment, prioritizing high-density target regions. A key feature of NavEX is the use of exemplar-clustering for the coverage utility measure, which provides the flexibility to employ non-Euclidean distance metrics that do not necessarily conform to the triangle inequality. This allows NavEX to incorporate visibility graphs for shortest-path computation in environments with planar obstacles, and traversability-aware RRT* for complex, rugged terrains. By leveraging submodular optimization, the NavEX framework enables efficient, near-optimal solutions with provable performance guarantees for multi-agent deployment in realistic and complex settings, as demonstrated by our simulations.

多智能体路径规划覆盖部署子模优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。