Localization with Few Distance Measurements
share
Given a polygon W, a depth sensor placed at point p=(x,y) inside W and oriented in direction θ measures the distance d=h(x,y,θ) between p and the closest point on the boundary of W along a ray emanating from p in direction θ. We study the following problem: Give a polygon W, possibly with holes, with n vertices, preprocess it such that given a query real value d≥ 0, one can efficiently compute the preimage h^-1(d), namely determine all the possible poses (positions and orientations) of a depth sensor placed in W that would yield the reading d. We employ a decomposition of W× S^1, which is an extension of the celebrated trapezoidal decomposition, and which we call rotational trapezoidal decomposition and present an efficient data structure, which computes the preimage in an output-sensitive fashion relative to this decomposition: if k cells of the decomposition contribute to the final result, we will report them in O(k+1) time, after O(n^2log n) preprocessing time and using O(n^2) storage space. We also analyze the shape of the projection of the preimage onto the polygon W; this projection describes the portion of W where the sensor could have been placed. Furthermore, we obtain analogous results for the more useful case (narrowing down the set of possible poses), where the sensor performs two depth measurement from the same point p, one in direction θ and the other in direction θ+π. While localizations problems in robotics are often carried out by exploring the full visibility polygon of a sensor placed at a fixed point of the environment, the approach that we propose here opens the door to sufficing with only few depth measurements, which is advantageous as it allows for usage of inexpensive sensors and could also lead to savings in storage and communication costs.
READ FULL TEXT