首页 /研究 /Computing C-space entropy for view planning based on beam sensor model
OTHER

Computing C-space entropy for view planning based on beam sensor model

Peixin Wang, Kamal Gupta

发表年份
2003
引用次数
10

摘要

The concept of C-space entropy was recently introduced by the authors (2000, 2001), as a measure of knowledge of C-space for sensor-based path planning and exploration for general robot-sensor systems. 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. The expected C-space entropy computation, however, made two idealized assumptions. The first was that the sensor field of view (FOV) is a point; and the second was that no visibility (or occlusion) constraints are taken into account, i.e., as if the obstacles are transparent. We extend the expected C-space entropy formulation where the sensor FOV is a beam and furthermore, it is subject to visibility constraints, as is the case with real range sensors. Planar simulations show that this new formulation results in more efficient exploration.

关键词

Entropy (arrow of time)Motion planningComputationComputer sciencePlanarRobotConfiguration spaceArtificial intelligenceComputer visionMathematics

相关论文

查看 OTHER 分类全部论文