TY - JOUR
T1 - MACIM
T2 - Multi-Agent Collaborative Implicit Mapping
AU - Deng, Yinan
AU - Tang, Yujie
AU - Yang, Yi
AU - Wang, Danwei
AU - Yue, Yufeng
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2024/5/1
Y1 - 2024/5/1
N2 - 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.
AB - 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.
KW - Distributed optimization
KW - euclidean signed distance field
KW - implicit mapping
KW - multi-agent collaborative
UR - http://www.scopus.com/inward/record.url?scp=85188460783&partnerID=8YFLogxK
U2 - 10.1109/LRA.2024.3379839
DO - 10.1109/LRA.2024.3379839
M3 - Article
AN - SCOPUS:85188460783
SN - 2377-3766
VL - 9
SP - 4369
EP - 4376
JO - IEEE Robotics and Automation Letters
JF - IEEE Robotics and Automation Letters
IS - 5
M1 - 10476626
ER -