nals to identify where robots’ trajectories are close. WiFi
is an electromagnetic wave, and thus the receiving robot
can locally derive the direction or Angle of Arrival (AOA)
to the transmitting robot from the phase information [9].
Similarly, commercial UWB devices measure time-of-flight to
estimate distance. Importantly, sensing through the commu-
nication signal has wide applicability in this setting since it
passes through obstacles and thus works in non line-of-sight
situations [10], and it doesn’t require the robots to identify
each other through vision-based methods, e.g. using Apriltags
[11]. Our method solely uses spatial information and thus it
can work seamlessly together with existing place recognition
methods based on appearance information. As depicted in
Fig. 1, the Wi-Closure algorithm is used at the start of the
multi-robot SLAM pipeline.
In order to achieve good performance, Wi-Closure must also
address a major challenge to sensing over the communication
signal; namely, it must address multipath propagation of the
wireless signal. Multipath refers to the phenomenon where the
signal bounces off of various objects to arrive at the receiver
from different angles. Consequently, the AOA measurement
may include multiple directions, of which at most one is the
direct-line path to the other robot. We address this issue with
PCM, since only the true direct paths will give consistent
pairs of AOA measurements over time. In our hardware
experiments, after collecting 4 AOA measurements with in
total 3 direct paths and 17 multipaths, we are able to accurately
distinguish all direct paths from the multipaths.
Our numerical and hardware experiment results demonstrate
that our method efficiently prunes the search space of loop
closure candidates by 99% in simulation and 78.7% in hard-
ware experiments, and increases robustness against perceptual
aliasing by rejecting up front inter-robot loop closures between
distinct places and reducing absolute trajectory estimation
error by 99% in simulation and 89.2% in hardware results.
We summarize the contributions of this paper as follows:
1) We introduce a resource efficient approach, Wi-Closure,
to detect inter-robot loop closures in perceptually aliased
environments, based on spatial information from the
communication signal. It can work in tandem with
existing place recognition methods.
2) We address the challenging situation of multipath prop-
agation of the communication signal with PCM.
3) We demonstrate the merits of our approach in terms
of robustness against false inter-robot loop closures
and improved computation time in simulation with the
KITTI dataset and in hardware experiments.
II. RELATED WORK
For decades, the majority of research on loop closure
detection has focused on a single robot [12], [13]. Recently
however, loop closure detection algorithms are being adapted
to fleets of robots, to ensure reliable and efficient retrieval
of shared map and location estimates [5], [14]. We leverage
previous work on sensing over the communication signal to
simultaneously address two open problems: 1) computation to
match large trajectories is high, and 2) place recognition easily
mismatches trajectories in repetitive environments.
Wireless sensing Extensive research has shown that we
can obtain spatial information from wireless signals [9], [15].
Many works use UWB sensors to obtain ranging information
between two robots by measuring the time-of-flight of the
ultra-wideband signal. [16], [17] use the ranging information
amongst robots to improve the joint position estimate even
without being in line of sight of each other. Recently, [10] also
introduced sensing direction from the WiFi communication
signal to the robotics community, requiring only a single
WiFi antenna and movement of the robot. These innovations
avoid the need of bulky equipment and anchors as used
in classical works to estimate position, which come with
additional infrastructure requirements [18].
Range-only SLAM Previously, [19] used UWB sensors in
a multi-robot SLAM setting coined range-only SLAM, where
distance measurements are directly used as inter-robot loop
closures. This avoids the problem of perceptual aliasing, but
it only introduces connections between the maps of the robots
where the robots are communicating. In realistic scenarios
the communication is intermittent, and trajectories can overlap
in places where communication is unavailable and where the
position estimate is uncertain due to odometer drift. Additional
place recognition increases the accuracy of the map by match-
ing these overlapping locations. To our knowledge, we are the
first to speed up place recognition using ranging and direction
information from the communication signal.
Computation in loop closure Researchers sought to reduce
computation of loop closure detection, e.g. with easily ob-
tainable ORB features for vision-based approaches [20], and
efficient look-up trees to match scenes [12]. Unfortunately,
these methods may result in mismatched maps in perceptually
aliased environments [6]. In [21] the authors consider sampling
a subset of most informative inter-robot loop closures to reduce
overall time consumption. However, the authors also note that
the performance guarantee of their sampling method decreases
if a scene can be potentially matched to many others - i.e. when
there is substantial perceptual aliasing.
Perceptual aliasing Although repetitive scenes are per-
vasive in many environments, classical place recognition
approaches find it notoriously difficult to deal with them.
Researchers have focused on simultaneously representing all
possible matches as multiple hypotheses in one framework
[22]. However, to properly use these multiple hypotheses to
determine the best course of action for the robot, we need
computationally expensive methods such as data-association
belief space planning (DA-BSP) [8], [23]. In DA-BSP the
computation time scales exponentially with the hypotheses.
We observe that many methods have a trade-off between
robustness against perceptual aliasing and computation: in-
creased robustness requires large computation, while compu-
tationally efficient methods decrease robustness or perform
worse in repetitive environments. Our approach instead aims to
improve both computation and robustness against perceptually