A Configuration Space View of View Planning

摘要

For sensor-based robot motion planning, view planning problem refers to planning the next sensing action to further facilitate the motion planning task. In Y. Yu and K. Gupta (2004), C-space entropy was introduced as a measure of knowledge of robot configuration space, or C-space. The robot plans the next sensing action to maximally reduce the expected C-space entropy, also called the maximal expected entropy reduction, or MER criterion. It was shown that MER criterion resulted in much more efficient C-space exploration performance than physical space based view planning criteria, such as to maximize unknown physical volume in each view. From a C-space perspective, MER criterion consists of two important aspects: sensing actions are evaluated in C-space (geometric aspect); these effects are evaluated in an information theoretical sense (stochastic aspect). In this paper, we investigate how much of this better performance is attributable to the paradigmatic shift to evaluating the sensor action in C-space, i.e., the pure geometric component of MER, and how much is attributable to the stochastic aspect of MER. We propose C-space based pure geometric criteria (which are essentially geometric aspect of MER) for view planning and compare them with the MER criterion. We empirically show that a great deal of efficiency is attributable to the pure geometric aspect; however, we also show that the stochastic aspect, despite being based on simple assumptions, result in moderately more efficient C-space exploration over the pure geometric component of MER. We outline explanations for our findings