AI News HubLIVE
原文2 min read

Multi-Agent Next-Best-View Optimization for Risk-Averse Planning

This paper proposes a distributed, risk-aware multi-agent NBV framework where each robot maintains a private local 3D Gaussian Splatting map and jointly maximizes expected information gain via Consensus ADMM, reducing communication by orders of magnitude while maintaining mapping quality and safety.

SourcearXiv RoboticsAuthor: Amirhossein Mollaei Khass, Vivek Pandey, Guangyi Liu, Athanasios Cosse, Emrah Bayrak, Nader Motee

[2606.04158] Multi-Agent Next-Best-View Optimization for Risk-Averse Planning

[Submitted on 2 Jun 2026]

Title:Multi-Agent Next-Best-View Optimization for Risk-Averse Planning

View a PDF of the paper titled Multi-Agent Next-Best-View Optimization for Risk-Averse Planning, by Amirhossein Mollaei Khass and 5 other authors

View PDF HTML (experimental)

Abstract:Multi-agent Next-Best-View (NBV) selection for safe path planning in uncertain and unknown environments requires informative, safety-aware, and efficient coordination. Centralized approaches rely on sharing raw sensor data or significant communication overhead, resulting in limited scalability. We propose a distributed, risk-aware multi-agent NBV framework in which each robot maintains a private local 3D Gaussian Splatting map and the team jointly maximizes expected information gain (EIG) restricted to masked zones along planned trajectories. The resulting distributed objective is solved by Consensus ADMM (C-ADMM) over a communication graph, with each robot exchanging only candidate viewpoints, planned trajectory descriptors, and scalar EIG contributions. Collision risk along each trajectory is modeled via Average Value-at-Risk (AV@R) over the local 3DGS map and used both to shape the masking radius and to score planned paths. Experiments in Gibson environments at multiple team sizes show that the distributed formulation approaches the centralized baseline in mapping quality and trajectory safety while reducing communication by orders of magnitude.

Comments: 8 pages, 5 figures. Submitted to IROS 2026

Subjects:

Robotics (cs.RO)

Cite as: arXiv:2606.04158 [cs.RO]

(or arXiv:2606.04158v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2606.04158

arXiv-issued DOI via DataCite

Submission history

From: Amirhossein Mollaei Khass [view email] [v1] Tue, 2 Jun 2026 19:23:23 UTC (4,266 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Multi-Agent Next-Best-View Optimization for Risk-Averse Planning, by Amirhossein Mollaei Khass and 5 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.RO

new | recent | 2026-06

Change to browse by:

cs

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)