arXiv (All)
open access
Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation
Efficient coordination under limited communication remains a key challenge in decentralized multi-robot exploration. While centralized approaches benefit from global information sharing, they are often impractical in large-scale or communication-constrained environments. Existing Monte Carlo Tree Se
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers#794183
- Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers#790164
- Region Based SLAM-Aware Exploration: Efficient and Robust Autonomous Mapping Strategy That Can Scale#1155033
- A Schema Bounded Language Model for Refining Robot Policies Without Destabilizing Local Learning#972082
- Communication-Aware Heterogeneous Graph Learning for Decentralized Multi-Human Multi-Robot Task Allocation#1117647
Record · ID 1037409
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive