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

نویسندگان

  • Pengpeng Wang
  • Kamal K. Gupta
چکیده

The concept of C-space entropy was recently introduced in [1, 2, 3], 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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy : A Measure for View Planning and Exploration for General Robot - Sensor

We consider the view planning problem where a range sensor is mounted on a robot mechanism with non-trivial geometry and kinematics. The robot–sensor system is required to explore the environment for obstacles and free space. We present an information theoretical approach in which the sensing action is viewed as reducing ignorance of the planning space, the C-space of the robot. The concept of ...

متن کامل

View planning for exploration via maximal C-space entropy reduction for robot mounted range sensors

We introduced the concept of C-space entropy recently in [9] as a measure of knowledge of Cspace for sensor-based exploration and path planning 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 resulting view planning algorithms showed significant i...

متن کامل

Computing C-space entropy for view planning with a generic range sensor model

We have recently introduced the concept of C-space entropy as a measure of knowledge of C-space for sensor-based path planning and exploration for general robot-sensor systems [1, 2, 3, 5]. 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, howev...

متن کامل

View Planning via Maximal C-space Entropy Reduction

We introduced the concept of C-space entropy recently in [1–3] 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 ...

متن کامل

An Information Theoretical Approach to View Planning with Kinematic and Geometric Constraints

We consider the view planning problem where the sensor, a range scanner, is mounted on a robot mechanism with non-trivial geometry and kinematics. The robot+sensor system is required to explore the environment (obstacle/free space). We present a novel information theoretical approach in which the sensing action is viewed as reducing ignorance of the planning space, the C-space of the robot. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002