The problem of selection of a minimal set of visual landmarks

Abstract

The representation of knowledge of the surrounding world plays an important role in mobile robot navigation tasks. Quality of visual navigation methods which use landmarks depends critically on the method of selection of landmarks. In this paper we consider the problem of selection of a minimal set of visual landmarks. We prove that the problem is NP-complete.