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

Donipolo Ghimire, Carlos Nieto-Granda, Solmaz S. Kia
4/29/2025
cs.MAcs.RO

No official code found. Best implementation: donipologhimire/NavEx (0 stars, last commit 2025-05-01).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

00Python, Jupyter NotebookMar 4, 20251 years ago

Similar Papers

Cite this paper

@article{ghimire2025navex,
  title  = {NavEX: A Multi-Agent Coverage in Non-Convex and Uneven Environments via Exemplar-Clustering},
  author = {Donipolo Ghimire and Carlos Nieto-Granda and Solmaz S. Kia},
  year   = {2025},
  eprint = {2504.21113},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.21113v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.21113.svg)](https://codeofpaper.com/paper/2504.21113)

Discussion