analiza aiqbench
This research proposes an entropy-gated coordination mechanism for decentralized multi-agent systems, optimizing communication by delaying belief fusion during high-entropy exploration phases to preserve coverage diversity. The study demonstrates that this strategy significantly outperforms standard unconditional fusion methods in intermittent communication environments while maintaining robustness against joint-Bayesian baselines.
Entropy-Gated Belief Coordination for Decentralized Multi-Agent Search Under Intermittent Communication
arXiv:2610.07432v1 Announce Type: new Abstract: We study decentralized multi-agent target search where homogeneous agents communicate intermittently at Poisson-distributed times. Standard unconditional belief fusion wastes communication opportunities by synchronizing agents during high-entropy exploration, when diverse independent beliefs provide better coverage than a premature consensus. We introduce \emph{entropy-gated belief coordination}, in which agents skip fusion while their collective entropy ratio exceeds a threshold~\(\theta\) and merge only during exploitation, consistent with the bifurcation structure of nonlinear opinion dynamics and the submodular structure of the per-step information gain objective. We further derive \(\Istep(\alpha,\beta)\), the expected mutual information per observation step between two agents' binary sensors, as an interpretable, communication-free measure of sensor informativeness that motivates the gating design and guides system-level analysis. Experiments across 103{,}680 trials (nine grid sizes up to \(100{\times}100\), Poisson communication timing, four target movement patterns) show that the Entropy-Gated Trust-Decay Planner (\textsc{EG-TDP}), which adds a detection-probability planner switch in exploitation mode, achieves mean belief quality \(\bar{Q}=0.300\) (mean belief mass at the true target cell, averaged across all trials and steps), a \(58.9\%\) gain over arithmetic mean and a \(37.4\%\) gain over visit-weighted fusion. On representative configurations, EG-TDP also outperforms a joint-Bayesian reference that uses all agents'~observations at every step, despite operating under random intermittent contact only.
Abstract:We study decentralized multi-agent target search where homogeneous agents communicate intermittently at Poisson-distributed times. Standard unconditional belief fusion wastes communication opportunities by synchronizing agents during high-entropy exploration, when diverse independent beliefs provide better coverage than a premature consensus. We introduce \emph{entropy-gated belief coordination}, in which agents skip fusion while their collective entropy ratio exceeds a threshold~\(\theta\) and merge only during exploitation, consistent with the bifurcation structure of nonlinear opinion dynamics and the submodular structure of the per-step information gain objective. We further derive \(\Istep(\alpha,\beta)\), the expected mutual information per observation step between two agents' binary sensors, as an interpretable, communication-free measure of sensor informativeness that motivates the gating design and guides system-level analysis. Experiments across 103{,}680 trials (nine grid sizes up to \(100{\times}100\), Poisson communication timing, four target movement patterns) show that the Entropy-Gated Trust-Decay Planner (\textsc{EG-TDP}), which adds a detection-probability planner switch in exploitation mode, achieves mean belief quality \(\bar{Q}=0.300\) (mean belief mass at the true target cell, averaged across all trials and steps), a \(58.9\%\) gain over arithmetic mean and a \(37.4\%\) gain over visit-weighted fusion. On representative configurations, EG-TDP also outperforms a joint-Bayesian reference that uses all agents'~observations at every step, despite operating under random intermittent contact only.
Robotics (cs.RO)
arXiv:2610.07432 [cs.RO]
(or arXiv:2610.07432v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2610.07432 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Text integral sub licența deschisă a publicației · 294 cuvinte
Subiecte conexe
HEROIC: Heterogeneous Evidential Reasoning for Open-Vocabulary Identification and Cross-Robot Collaboration
arXiv · 18 sept. 2026

News
Quantum Computing Report · 7 iun. 2026

Why do models task game?
AI Alignment Forum · 6 aug. 2026
Diffusing to Coordinate: Efficient Online Multi-Agent Diffusion Policies
arXiv · 11 iun. 2026