Abstract Nearly all spatial reasoning problems involve uncertainty of one sort or another. Uncertainty arises due to the inaccuracies of sensors used in measuring distances and angles. We refer to this as directional uncertainty. Uncertainty also arises in combining spatial information when one location is mistakenly identified with another. We refer to this as recognition uncertainty. Most problems in constructing spatial representations ( maps ) for the purpose of navigation involve both directional and recognition uncertainty. In this paper, we show that a particular class of spatial reasoning problems involving the construction of representations of large-scale space can be solved efficiently even in the presence of directional and recognition uncertainty. We pay particular attention to the problems that arise due to recognition uncertainty.
[1]
Leslie G. Valiant,et al.
A theory of the learnable
,
1984,
STOC '84.
[2]
Richard J. Lipton,et al.
Random walks, universal traversal sequences, and the complexity of maze problems
,
1979,
20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3]
G. Miller,et al.
Cognitive science.
,
1981,
Science.
[4]
Tod S. Levitt,et al.
Qualitative Landmark-based Path Planning and Following
,
1987,
AAAI.
[5]
Benjamin Kuipers,et al.
A Robust, Qualitative Method for Robot Spatial Learning
,
1988,
AAAI.
[6]
Benjamin Kuipers,et al.
Modeling Spatial Knowledge
,
1978,
IJCAI.