Abstract
Collaborative mapping aids agents in achieving an efficient and comprehensive understanding of their environment. Recently, there has been growing interest in using neural networks as maps to represent functions that implicitly define the geometric features of a scene. However, existing implicit mapping algorithms are constrained to single-agent scenarios, thus restricting mapping efficiency. In this letter, we present MACIM, a Multi-Agent Collaborative Implicit Mapping algorithm to construct implicit Euclidean Signed Distance Field (ESDF) maps, formulated as a distributed optimization task. In our formulation, each agent independently maintains its own local data and neural network. At each iteration, agents train networks using local data and network weights from their peers. Subsequently, they transmit the latest version of network weights to their neighbors, thus keeping the local network weights of all agents continuously consistent. When optimizing the network model, the agents use not raw but in-grid fused sensor data to prevent training data conflicts. In addition, we constrain the signed distance values of unobserved regions by Small Batch Euclidean Distance Transform (SBEDT) to mitigate reconstruction artifacts. The verification results on multiple scenes demonstrate that MACIM builds more accurate ESDFs and meshes than single-agent strategy and some distributed optimization methods.
Original language | English |
---|---|
Article number | 10476626 |
Pages (from-to) | 4369-4376 |
Number of pages | 8 |
Journal | IEEE Robotics and Automation Letters |
Volume | 9 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1 May 2024 |
Keywords
- Distributed optimization
- euclidean signed distance field
- implicit mapping
- multi-agent collaborative